CSE 3318

Data Structures & Algorithms

Topics covered:

1. Exam 1
   • Insertion Sort, Indirect Sorting, Binary Search,
   • Time Complexity, Growth of Functions, Count Sort,
   • Bucket Sort, Radix Sort, Trees, Tree Traversals,
   • TC of Trees, Binary Search Tree, Rotating Trees,
2. Exam 2
   • Priority Queues, Binary Heap (Max, Min),
   • Heap Sort, FIFO Queues, Hash tables, Hash func,
   • Open Addressing, Amorotized Analysis,
   • Dynamic Programming,