Study Plan - Fall 2021

Free Dynamic Array of Structs in C

Easy

Swap Second and Third Nodes in Linked List

Hard

Implement Circular Queue Dequeue Function

Med.

Swap Binary Tree Children Recursively

Med.

Prefix Subtree Relation in String Minheap

Hard

AVL Tree Deletion with Double Rebalance

Hard

Balance Scale with Recursive Weight Selection

Insane

Determine Sub-Linear Big O Runtime

Hard

Closed Form of Double Summation with Unique Bounds

Hard

Count Set Bits Using Recursion

Hard

Median of Three for Quick Sort Partitioning

Med.

Backtrack A-B Strings Without Consecutive Bs

Med.

Practice this exam with 12 Qs