The midterm examination covers the following topics Logarithms Inductive proofs Asymptotic analysis with Big O, Omega, and Theta Circular queues Binary search trees AVL trees B-trees Priority queues and binary heaps Hashing Sorting Graphs