Introduction to algorithms (Instructor's manual) - (E-BOOK) Thomas H. Cormen ... [et al.].

By: Cormen, Thomas HContributor(s): Cormen, Thomas HPublisher: Cambridge, Mass. : MIT Press, c2009Edition: 2nd edDescription: xix, 1292 p. : ill. ; 24 cmISBN: 0262033844 (hardcover : alk. paper); 0262533057 (pbk. : alk. paper); 9780262033848 (hardcover : alk. paper); 9780262533058 (pbk. : alk. paper)Subject(s): Computer algorithms | Computer programming | E-BOOKDDC classification: 005.1
Contents:
Revision History (Page-1), Getting Started (Page-25), Growth Of Functions (Page-45), Recurrences (Page-75),Probabilistic Analysis And Randomized Algorithms (Page-105), Quicksort (Page-125), Sorting In Linear Time (Page-144), Medians And Order Statistics (Page-170), Hash Tables (Page-188), Binary Search Trees (Page-205), Augmenting Data Structures (Page-240), Greedy Algorithms (Page-290), Data Structures For Disjoint Sets (Page-330), Elementary Graph Algorithms (Page-355),Minimum Spanning Trees (Page-380), Single-Source Shortest Paths (Page-410).
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Home library Collection Call number URL Status Date due Barcode Item holds
Book Book Military College of Signals (MCS)
Military College of Signals (MCS)
NFIC 005.1 COR (Browse shelf) Link to resource Available MCSEB-854
Total holds: 0

Revision History (Page-1), Getting Started (Page-25), Growth Of Functions (Page-45), Recurrences (Page-75),Probabilistic Analysis And Randomized Algorithms (Page-105), Quicksort (Page-125), Sorting In Linear Time (Page-144), Medians And Order Statistics (Page-170), Hash Tables (Page-188), Binary Search Trees (Page-205), Augmenting Data Structures (Page-240), Greedy Algorithms (Page-290), Data Structures For Disjoint Sets (Page-330), Elementary Graph Algorithms (Page-355),Minimum Spanning Trees (Page-380), Single-Source Shortest Paths (Page-410).

There are no comments on this title.

to post a comment.
© 2023 Central Library, National University of Sciences and Technology. All Rights Reserved.