Computer algorithms : by Sara Baase and Allen Van Gelder introduction to design & analysis /

By: Baase, Sara
Contributor(s): Gelder, Allen Van
Material type: TextTextPublisher: New Delhi : Pearson, 2009Edition: 3rd edDescription: xiii, 688 p. ; ill. ; 24 cmISBN: 9788131702444 (pbk)Subject(s): Computer algorithmsDDC classification: 004
Contents:
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--------
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Call number Copy number Status Date due Barcode Item holds
Books Books Namal Library
Computer Science
004 BAA-C 2009 1099 (Browse shelf) Available 1099
Books Books Namal Library
Computer Science
004 BAA-C 2013 4274 (Browse shelf) 2 Available 0004274
Total holds: 0

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 for this item.

to post a comment.