Algorithms illuminated (part 3) : greedy algorithms and dynamic programming
Publication details: San Francisco : Soundlikeyourself Publishing, ©2019Description: xi, 217 p. : ill. ; 23 cmISBN:- 9780999282946
- 005.73 ROU-A
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | Course reserves |
---|---|---|---|---|---|---|---|---|
![]() |
IIITD General Stacks | Computer Science and Engineering | 005.73 ROU-A (Browse shelf(Opens below)) | Available | 013185 | |||
![]() |
IIITD Reference | Computer Science and Engineering | REF 005.73 ROU-A (Browse shelf(Opens below)) | Not for loan | 013186 |
Analysis and Design of Algorithms (Sec A & B) UG (SEM IV) WNT25 |
Browsing IIITD shelves, Shelving location: General Stacks, Collection: Computer Science and Engineering Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.73 NEC-D Data structures and algorithms using Python | 005.73 ROU-A Algorithms illuminated (part 1) : the basics | 005.73 ROU-A Algorithms illuminated (part 2) : graph algorithms and data structures | 005.73 ROU-A Algorithms illuminated (part 3) : greedy algorithms and dynamic programming | 005.73 SHA-D Data Structures using C | 005.73 SUL-D Data structures | 005.73 TEN-D Data structures using C |
Includes index
13. Introduction to greedy algorithms
14. Huffman codes
15. Minimum spanning trees
16. Introduction to dynamic programming
17. Advance dynamic programming
18. Shortest paths revisited
There are no comments on this title.