Course Outline
Topics
Abstract Data Types
Complexity Analysis and Big O Notion
Stacks (linked lists and array implementations)
Recursion and analyzing recursive algorithms
Divide and conquer algorithms
Sorting Algorithms
Ques
Types of Linked Lists
Binary search for sorted arrays
Hashing and Indexing
Trees and Tree Traversals
Binary Search Trees
Heaps
M-Way Trees
AVL Trees
Tree Traversals
Topological Order
Memory management and garbage collection
Back to Subject Selection