Week - 1 |
Review of C++ Programming |
Week - 2 |
Review of program performance complexity |
Week - 3 |
Formula based and linked representation |
Week - 4 |
Linked, indirect addressing and simulated pointer |
Week - 5 |
Arrays and matrices |
Week - 6 |
Stacks and applications |
Week - 7 |
Midterm 1 |
Week - 8 |
Queues and applications |
Week - 9 |
Skip lists and hashing |
Week - 10 |
Binary and the other trees |
Week - 11 |
Priority queues heap sort an Huffman codes |
Week - 12 |
Midterm 2 |
Week - 13 |
Priority queues |
Week - 14 |
AVL trees and B-trees |