Introduction to algorithms

By: Cormen, Thomas HContributor(s): Leiserson, Charles E | Rivest, Ronald L | Stein, CliffordMaterial type: TextTextLanguage: Eng. Publication details: New Delhi.: PHI Learning pvt. ltd., 2008. 2010Edition: 2nd ed; 3rd edDescription: xix, 1180p.; PAPER BACK 23cm; xix, 1292p.; PAPER BACK 23 cmISBN: 9788120340077Subject(s): Computer science, alogrithmsDDC classification: 005.1
Contents:
Contents: Preface; FOUNDATIONS: Introduction: 1. The Role of Algorithms in Computing 2. Getting Started 3. Growth of Functions 4. Divide-and-Conquer 5. Probabilistic Analysis and Randomized Algorithms SORTING AND ORDER STATISTICS: Introduction: 6. Heapsort 7. Quicksort 8. Sorting in Linear Time 9. Medians and Order Statics DATA STRUCTURES: Introduction: 10. Elementary Data Structures 11. Hash Tables 12. Binary Search Trees 13. Red-Black Trees 14. Augmenting Data Structures ADVANCED DESIGN AND ANALYSIS TECHNIQUES: Introduction: 15. Dynamic Programming 16. Greedy Algorithms 17. Amortized Analysis ADVANCED DATA STRUCTURES: Introduction: 18. B-Trees 19. Fibonacci Heaps 20. Van Emde Boas Trees 21. Data Structures for Disjoint Sets GRAPH ALGORITHMS: Introduction: 22. Elementary Graph Algorithms 23. Minimum Spanning Trees 24. Signal-Source Shortest Paths 25. All-Pairs Shortest Paths 26. Maximum Flow SELECTED TOPICS: Introduction: 27. Multithreaded Algorithms 28. Matrix Operations 29. Linear Programming 30. Polynomials and the FFT 31. Number-Theoretic Algorithms 32. String Matching 33. Computational Geometry 34. NP-Completeness 35. Approximation Algorithms
Summary: Algorithms, algorithms in computing.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Notes Date due Barcode
Reference Reference ADBU Azara Campus Library
Reference
ADBU Azara Campus Library
Reference
Reference 005.1 COR (Browse shelf(Opens below)) 1 Not For Loan Placed in Reference stack. 8596
Books Books ADBU Azara Campus Library
General Stacks
ADBU Azara Campus Library
General Stacks
Non-fiction 005.1 COR (Browse shelf(Opens below)) 2 Available Placed in Computer Science & IT stacks. 8597
Books Books ADBU Azara Campus Library
General Stacks
ADBU Azara Campus Library
General Stacks
Non-fiction 005.1 COR (Browse shelf(Opens below)) 3 Available Placed in Computer Science & IT stacks. 8598
Books Books ADBU Azara Campus Library
General Stacks
ADBU Azara Campus Library
General Stacks
Non-fiction 005.1 COR (Browse shelf(Opens below)) 4 Available Placed in Computer Science & IT stacks. 8599
Books Books ADBU Azara Campus Library
CSE & IT Shelves
ADBU Azara Campus Library
CSE & IT Shelves
Non-fiction 005.1 COR (Browse shelf(Opens below)) 5 Available Place in school of technology library 6610
Books Books ADBU Azara Campus Library
CSE & IT Shelves
ADBU Azara Campus Library
CSE & IT Shelves
Non-fiction 005.1 COR (Browse shelf(Opens below)) 6 Available Placed in Azara Campus Library 16534
Books Books ADBU Azara Campus Library
CSE & IT Shelves
ADBU Azara Campus Library
CSE & IT Shelves
Non-fiction 005.1 COR (Browse shelf(Opens below)) 7 Available Placed in Azara Campus Library 16535
Books Books ADBU Azara Campus Library
CSE & IT Shelves
ADBU Azara Campus Library
CSE & IT Shelves
Non-fiction 005.1 COR (Browse shelf(Opens below)) 8 Available Placed in Azara Campus Library 16536
Books Books ADBU Azara Campus Library
CSE & IT Shelves
ADBU Azara Campus Library
CSE & IT Shelves
Non-fiction 005.1 COR (Browse shelf(Opens below)) 9 Available Placed in Azara Campus Library 16537
Books Books ADBU Azara Campus Library
CSE & IT Shelves
ADBU Azara Campus Library
CSE & IT Shelves
Non-fiction 005.1 COR (Browse shelf(Opens below)) 10 Available Placed in Azara Campus Library 16538

Computer Science

Contents:
Preface;
FOUNDATIONS:
Introduction:
1. The Role of Algorithms in Computing
2. Getting Started
3. Growth of Functions
4. Divide-and-Conquer
5. Probabilistic Analysis and Randomized Algorithms
SORTING AND ORDER STATISTICS:
Introduction:
6. Heapsort
7. Quicksort
8. Sorting in Linear Time
9. Medians and Order Statics
DATA STRUCTURES:
Introduction:
10. Elementary Data Structures
11. Hash Tables
12. Binary Search Trees
13. Red-Black Trees
14. Augmenting Data Structures
ADVANCED DESIGN AND ANALYSIS TECHNIQUES:
Introduction:
15. Dynamic Programming
16. Greedy Algorithms
17. Amortized Analysis
ADVANCED DATA STRUCTURES:
Introduction:
18. B-Trees
19. Fibonacci Heaps
20. Van Emde Boas Trees
21. Data Structures for Disjoint Sets
GRAPH ALGORITHMS:
Introduction:
22. Elementary Graph Algorithms
23. Minimum Spanning Trees
24. Signal-Source Shortest Paths
25. All-Pairs Shortest Paths
26. Maximum Flow
SELECTED TOPICS:
Introduction:
27. Multithreaded Algorithms
28. Matrix Operations
29. Linear Programming
30. Polynomials and the FFT
31. Number-Theoretic Algorithms
32. String Matching
33. Computational Geometry
34. NP-Completeness
35. Approximation Algorithms

Algorithms, algorithms in computing.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Central Library, Assam Don Bosco University
For any Suggestions/Query Contact to library or E-mail: [email protected]. Phone No:91+8638042220
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.
HTML Counter
Visitors

Powered by Koha