Difference: ExamTwoStudyGuide (4 vs. 5)

Revision 52016-11-14 - JimSkon

Line: 1 to 1
META TOPICPARENT name="Math391F2016"

Algorithm Analysis and Design

Exam 2 Study Guide

Line: 23 to 23
Chapter 11 - Hash Tables
  • Review hash table and direct lookup operation, and exercises.
Chapter 15 Dynamic Programming
  • The cut-rod problem and it solution, analysis, and sections exercises.
  • Elements of dynamic programming (15.3).
    • What is an optimal substructor? How is it used?
    • How does it differ from greedy solutions?
    • What is memoization?
    • Exercises for 15.3
  • Be able to create a dynamic algorithm for an appropriate problem.
\ No newline at end of file
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback