Schedule:
week |
Topics |
1 |
Introduction, list definition and operations, storing a list, creating a linked list examples |
2 |
Processing a linked list, deleting an element from a linked list, insertion of an element into a linked list, deleting a linked list, copying linked list |
3 |
Recursion, C++ class review, Implementing a linked list as a class, Circular linked list, double linked list, Stack, implementing a stack using an array |
4 |
Simple examples on using stacks, Implementing a stack using a linked list, postfix expressions |
5 |
Converting from infix to postfix, Evaluation of postfix expressions using a stack |
6 |
Generating assembly like code, Run-time stack, function call, first exam |
7 |
recursion examples, Queue |
8 |
circular queue, array implementation, linked list implementation |
9 |
Trees, terminology, tree implementation, binary tree, complete tree, Binary tree traversal |
10 |
copying a binary tree, binary tree processing examples, Binary search trees |
11 |
searching a binary search tree by key and by rank, deletion and insertion into a binary search tree |
12 |
Balanacing a binary search tree, second exam |
13 |
heap, insertion and deletion from a heap, heap sort |
14 |
Hash tables |
15 |
B+ trees |
Office Hours
Sunday, tuseday, Thursday: 10-11
Mon, Wed: 9-11, 12.5-1.5
Grade distribution:
First Exam 20%
Second Exam 20%