Introduction to algorithms / by Thomas H. Cormen..[et..al.].
Material type:
TextPublication details: New Delhi : PHI Learning Education Private Limited, 2012, 2009cEdition: 3rd edDescription: xvii, 1028 p. : ill ; 26 cmISBN: 9788120340077Subject(s): Computer algorithms | Computer ScienceDDC classification: 005.1 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| Book Bank | Namal Library Computer Science | 005.1 COR-I 2009 3046 (Browse shelf (Opens below)) | Available | 0003046 | |||
| Reference | Namal Library Reference | 005.1 COR-I 2009 972 (Browse shelf (Opens below)) | 1 | Not for loan | 972 | ||
Books
|
Namal Library Computer Science | 005.1 COR-I 2009 971 (Browse shelf (Opens below)) | 2 | Available | 971 | ||
|
Books
|
Namal Library Computer Science | 005.1 COR-I 2009 355 (Browse shelf (Opens below)) | 3 | Checked out | 04/03/2023 | 355 | |
|
Books
|
Namal Library Computer Science | 005.1 COR-I 2009 1049 (Browse shelf (Opens below)) | 4 | Available | 1049 | ||
|
Books
|
Namal Library Computer Science | 005.1 COR-I 2009 1979 (Browse shelf (Opens below)) | 5 | Available | 0001979 | ||
|
Books
|
Namal Library Computer Science | 005.1 COR-I 2009 1980 (Browse shelf (Opens below)) | 6 | Available | 0001980 | ||
|
Books
|
Namal Library Computer Science | 005.1 COR-I 2009 3047 (Browse shelf (Opens below)) | 7 | Available | 0003047 | ||
|
Books
|
Namal Library Computer Science | 005.1 COR-I 2009 3048 (Browse shelf (Opens below)) | 8 | Available | 0003048 |
Browsing Namal Library shelves, Shelving location: Reference Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 005.1 ALS-A 2006 822 Algorithms : design techniques and analysis vol. 7 / | 005.1 BAL-A 2004 1285 Algorithms and data structures : | 005.1 CHH-C 2011 388 Conceptual programming tips for interviews and competitive exams : | 005.1 COR-I 2009 972 Introduction to algorithms | 005.1 DEI-A 2012 962 Android for programmers : an app-driven approach / | 005.1 JAC-A 2011 35 Android apps for absolute beginners / | 005.1 SOM-S 2013 278 Software engineering |
Growth of functions -- Summations -- Recurrences -- Sets, etc. -- Counting and probability -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.
There are no comments on this title.