Algorithmics 3

10 downloads 79 Views 7KB Size Report
Algorithm Analysis q. Harel, Ch. ... Goodrich & Tamassia, Ch. 1, especially Secs. ... M.T. Goodrich & R. Tamassia, “Algorithm Design: Foundations, Analysis, and.
Algorithmics 3 List of Detailed Text References for the Course •

Algorithm Analysis Harel, Ch. 6, especially pages 127 - 139. q Goodrich & Tamassia, Ch. 1, especially Secs. 1.1 - 1.3. q Manber, Ch. 2, especially pages 37 - 47. Sorting q Goodrich & Tamassia, Ch. 4, especially Secs. 4.1 - 4.5. q Manber, Sec. 6.4, especially pages 37 - 47. AVL trees q Goodrich & Tamassia, Sec. 3.2. q Manber, Sec. 4.3.4. Tries q Goodrich & Tamassia, Sec. 9.2. Heaps q Goodrich & Tamassia, Sec. 2.4. q Manber, Sec. 4.3.2. Graphs: search and traversal q Goodrich & Tamassia, Secs. 6.2, 6.3. q Manber, Secs. 7.1, 7.3. Minimum spanning trees q Goodrich & Tamassia, Sec. 7.3. q Manber, Sec. 7.6. Shortest paths q Goodrich & Tamassia, Sec. 7.1. q Manber, Sec. 7.5. Topological ordering q Goodrich & Tamassia, Sec. 6.4.4. q Manber, Sec. 7.4. Huffman coding q Goodrich & Tamassia, Sec. 9.3. q Manber, Sec. 6.6. q Binstock & Rex, Chapter 9, pages 479-499. LZW q Binstock & Rex, Chapter 9, pages 508-532. String searching q Manber, Sec. 6.7. q Goodrich & Tamassia, Sec. 9.1. q Binstock & Rex, Chapter 4, pages 95-111. String comparison q Manber, Sec. 6.8. q Goodrich & Tamassia, Sec. 9.4. q

• • • • • • • • •

• •





NP-completeness Harel, Ch. 7. q Goodrich & Tamassia, Ch. 13. Computability q Harel, Ch. 8. q Kimber &Smith, Ch.2-3 (Languages) q Kimber & Smith, Ch4-5 (Turing Machines) q



List of Textbooks • • • • •

A. Binstock & J. Rex, “Practical Algorithms for Programmers”, Addison-Wesley 1995. ISBN 020163208X. M.T. Goodrich & R. Tamassia, “Algorithm Design: Foundations, Analysis, and Internet Examples”, Wiley, 2001. ISBN 0471383651. D. Harel, “Algorithmics: The Spirit of Computing”, Second Edition, Addison-Wesley, 1992. ISBN 0201504014. U. Manber, “Introduction to Algorithms: A Creative Approach”, Addison-Wesley, 1989. ISBN 0201120372. E. Kinber & C. Smith, “Theory of Computing: a Gentle Introduction”, Prentice-Hall, 2001. ISBN 0130279617.