Introduction to Algorithms

By:

Cormen, Thomas H

Contributor(s):

Material type: Text

TextPublication details: New Delhi Prentice-Hall of India Pvt. Ltd. 1998Description: 1028pISBN:

9788120313538

Subject(s):

Mathematics

DDC classification:

511.8 COR

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Item location	Collection	Call number	Status	Barcode
Book	NIMA Knowledge Centre	9th Floor Reading Zone	General	511.8 COR (Browse shelf(Opens below))	Available	T0011916
Reference Book	NIMA Knowledge Centre	7th Floor Silence Zone	Reference	511.8 COR (Browse shelf(Opens below))	Not For Loan	T0011914
Book	NIMA Knowledge Centre	9th Floor Reading Zone	General	511.8 COR (Browse shelf(Opens below))	Available	T0005233

Total holds: 0

Browsing Institute of Technology shelves, Collection: General Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available					Next
Previous	511.8 CHI Computational Techniques: Methods, Algorithms and Programs	511.8 CHI Computational Techniques: Methods, Algorithms and Programs	511.8 CHI Numerical Computational Techniques	511.8 COR Introduction to Algorithms	511.8 COR Introduction to Algorithms	511.8 COR Introduction to Algorithms	511.8 COR Introduction to Algorithms	Next

Introduction Part - 1: Mathematical Foundations Growth of Functions Summations Recurrences Sets Etc Counting and Probability Part - 2: Sorting and Order Statistics Heapsort Quicksort Sorting in Linear Time Medians and Order Statistics Part - 3: Data Structures Elementary Data Structures Hash Tables Binary Search Trees Red Black Trees Augmenting Data Structures Part - 4: Advanced Design and Analysis Techniques Dynamic Programming Greedy Algorithms Amortized Analysis Part - 5: Advanced Data Structures B Trees Binomial Heaps Fibonacci Heaps Data Structures for Disjoint Sets Part - 6: Graph Algorithms Elementary Graph Theory Minimum Spanning Trees Single Source Shortest Paths All Pairs Shortest Paths Maximum Flow Part - 7: Selected Topics 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 Bibliography Index

There are no comments on this title.

to post a comment.