Design and Analysis of Algorithms

Info & Contact

  • 12:00 - 2:30 p.m.
    Wednesday and Friday
  • Room 106
    Math and Computer Science Building
  • Syllabus (pdf)
  • Introduction to Algorithms,
    by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
    3rd edition, MIT Press, 2009
  • By arrangement
    Room 352 (Math and Computer Science Building)
  • aleitert@cs.kent.edu

Supplemental Resources

Voluntary Homework

Homework will not be graded and is not relevant for your final grade.

Set Topics
1 Binary Search [pdf]
2 Runtime Analysis [pdf]
3 Merge- and Quicksort [pdf]
4 Heaps [pdf]
5 Linear Time Sorting [pdf]
6 Balanced Trees [pdf]
7 Hash Tables [pdf]
8 Graph Algorithms I [pdf]
9 Graph Algorithms II [pdf]

Exams

The first three exams will be during class. The dates may change.

Sample exam: [pdf]

Date Topics
Jun 30. First Exam
Binary Search
Runtime Analysis
Insertion, Merge, and Quicksort
Heaps and Priority Queues
Jul 19. Second Exam
Linear Time Sorting
Red-Black and AVL-Trees
Hash Tables
Disjoint Sets
Aug 4. Third Exam
Graphs

Schedule and Slidess

The schedule and topics are not final. They may change.

Date Topic Slides
Jun 14.
Jun 14.
Jun 16.
Introduction
Binary Search
Model of Computation and Runtime Analysis
[pdf]
[pdf]
[pdf]

Jun 21.
Jun 23.
Jun 28.
Sorting
Insertion, Merge, and Quicksort
Heaps and Priority Queues
Linear Time Sorting

[pdf]
[pdf]
[pdf]

Jul 5.
Jul 7.
Jul 12.
Data Structures
Red-Black, AVL, and B-Trees
Hash Tables
Disjoint Sets

[pdf]
[pdf]
[pdf]

Jul 14.
Jul 21.
Jul 26.
Graphs
BFS, DFS, DAGs
Minimum Spanning Tree
Shortest Path
[pdf]
[pdf]
[pdf]
[pdf]