Computer algorithms : by Sara Baase and Allen Van Gelder introduction to design & analysis /
Material type: TextPublication details: New Delhi : Pearson, 2009Edition: 3rd edDescription: xiii, 688 p. ; ill. ; 24 cmISBN: 9788131702444 (pbk)Subject(s): Computer algorithmsDDC classification: 004Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Books | Namal Library Computer Science | 004 BAA-C 2009 1099 (Browse shelf (Opens below)) | Available | 1099 | |||
Books | Namal Library Computer Science | 004 BAA-C 2013 4274 (Browse shelf (Opens below)) | 2 | Available | 0004274 |
Browsing Namal Library shelves, Shelving location: Computer Science Close shelf browser (Hides shelf browser)
004.6802 HAN- 2008 3934 Handbook of local area networks / | 004.692 HAN- 2008 3966 Handbook of electronic messaging / | 004 BAA-C 2009 1099 Computer algorithms : | 004 BAA-C 2013 4274 Computer algorithms : | 004 BAT-M 2010 3491 Mathematical foundations of computer science / | 004 BEA-S 2011 129 SOA and web services interface design : | 004 BEE-C 2005 6471 Computer confluence : |
http://library.namal.edu.pk:8080/cgi-bin/koha/cataloguing/addbiblio.pl?biblionumber=840&op=#tab5XX
Chapter 1: Analyzing Algorithms and Problems: Principles and Examples---------
Chapter 2: Data Abstraction and Basic Data Structures--------
Chapter 3: Recursion and Induction--------
Chapter 4: Sorting--------
Chapter 5: Selection and Adversary Arguments----------
Chapter 6: Dynamic Sets and Searching---------
Chapter 7: Graphs and Graph Traversals--------
Chapter 8: Graph Optimization Problems and Greedy Algorithms-------
Chapter 9: Transitive Closure, All-Pairs shortest Path-------
Chapter 10: Dynamic Programming-------
Chapter 11: String Matching
Chapter 12: Polynomials and Matrices--------
Chapter 13: NP-Complete Problems--------
Chapter 14: Parallel Algorithms--------
Chapter A: Java Examples and Techniques--------
There are no comments on this title.