Practice Problems

Midterm 01

Practice problems for topics on Midterm 01. See also the Sample Midterm 01 and its solutions.

See all problems in this set, or choose a tag below to view only those problems.

• asymptotic notation
• best and worst case
• binary search
• binary search trees
• expected time
• loop invariants
• mergesort
• quickselect
• recurrence relations
• recursion
• sorted structure
• theoretical lower bounds
• time complexity
• verifying recursion

Midterm 02

Practice problems for topics on Midterm 02. See also the Sample Midterm 02 and its solutions.

See all problems in this set, or choose a tag below to view only those problems.

• aggregate analysis
• bellman-ford
• breadth first search
• connected components
• depth first search
• dijkstra
• graph representations
• graph theory
• hashing
• shortest paths
• start and finish times
• topological sorting

Quiz 01

Practice problems for topics on Quiz 01.

See all problems in this set, or choose a tag below to view only those problems.

• lecture-01
• lecture-02

Quiz 02

Practice problems for topics on Quiz 02.

See all problems in this set, or choose a tag below to view only those problems.

• lecture-03
• lecture-04

Quiz 03

Practice problems for topics on Quiz 03.

See all problems in this set, or choose a tag below to view only those problems.

• lecture-05
• lecture-06