CISC 5835: Topics Covered

As mentioned in the mission statement, this course covers some of the topics found in a tradtional algorithms course, as well as some material found in other courses. We will organize our topics so as to follow the Dasgupta text as much as possible. With that in mind, here are the Dasgupta chapters we will follow, with these additional topics listed as interludes or sub-topics:

• A warmup: mathematical induction
• Prologue
• Algorithms with numbers
  • An interlude: loop invariants (Hoare axiomatics)
• Divide-and-conquer algorithms
  • Sorting algorithms: insertion sort, bubblesort, mergesort, quicksort
  • Searching algorithms: linear search, binary search
• Decomposition of graphs
• Paths in graphs
• Greedy algorithms
• Dynamic programming
• Linear programming
• NP-complete problems

Since no book is free of typos, please take note of the errata list for the Dasgupta text.

Time permitting, we may cover some additional topics in Data Analytics.