Home | Course Archive | Video/Audio Library | Papers Archive | CV | My Keeper Shelf | Cultural References in Class | Quotes |
Date | Topic | Reading | Notes | Assignments Due at following class |
---|---|---|---|---|
11/16/2015 | ||||
11/9/2015 | B tree | |||
11/2/2015 | AVL trees - pseudocode for recursive implementation | |||
10/28 | AVL trees A nice write-up is here |
In class "homework" solution | ||
10/26 | Priority queues (heaps) Insert, delete, implement as binary tree, implement as 1D array |
|||
10/21 | BST iterative implementations Big-Oh |
|||
10/19 | Trees | chpt 6 | Due 10/26 Self Check Exercises Section 6.1 (#1-5), p 303. Self Check Exercises Section 6.2 (#1 - 4), p 306. Self Check Exercises Section 6.4 (#1 - 6), p 331. | |
9/28/2015 | ||||
9/23/2015 | Stack applications: delimiter matching, evaluate postfix, infix -> postfix | Chapter 3 | Write pseudo-code to use a stack to: (1) reverse a list (2) test if a list is a palindrome (3) return the maximum value of a list Due 9/28/2015 | |
9/21/2015 | Queue and applications, Circular queue Stack and applications, Stack in array |
| ||
9/16/2015 | For an unordered link list implemented in a 1D array (not the heap),
give pseudo-code (in the style of pseudo code at link for today's topic) for insert element, delete any element, delete element with value = key,
find index of element with value = key. DUE: 9/23/2015. | |||
9/14/2015 |
| no new homework | ||
9/9/2015 | Course overview Program execution (use of memory) | 2.1 - 2.3 |
2. Projects
Project | Due |
---|---|
Hashing for symbol table | 12/14/2015 |
Priority queue implementation to create Huffman tree mystery code (php source file) |
|
Stack-based arithmetic | 11/11/2015 |
Memory manager | |
Unsorted list is O(n) for search | 10/14/2015 |