Algorithms Questions

This book contains more than three hundred questions on the design and analysis of algorithms. Questions are classified as beginning, intermediate, and advanced. Covered topics include discrete math, program correctness, asymptotic growth of functions, recurrence relations, lower bound theory, average case analysis and randomized algorithms, divide and conquer algorithms, dynamic programming algorithms, greedy algorithms, computational geometry, string matching, graph and network algorithms, backtracking and branch and bound, algorithms in mathematics, and the theory of NP-completeness.

This book is focused on questions. It is not a text on algorithms. It should be used in conjunction with a text on algorithms, and after the relevant topics have been understood. It will work well in the following situation. You are taking a course on algorithms and have attended some lectures on a certain topic - say divide and conquer algorithms. Use this book to practice the material by answering the questions. A related situation in which it will work well is practice for an exam on the topic, including master’s or PhD qualifying exams. This book will also work well in problem-solving sessions lead by a teaching assistant in a course on algorithms. (Many schools use discussion or “recitation” sessions, lead by teaching assistants, as adjuncts to the main lectures, to give the students more practice.) The teaching assistant could cover some of the answers in addition to the questions.