Home  Course Archive  My YouTube playlists  Video/Audio Library  Papers Archive  CV  My Keeper Shelf  Cultural References in Class  Quotes 
Distributed  Due  Identifier/ Link  Precis 

3/2  3/7  HW03/02  Recursively zip up two lists into one list 
2/28  3/2  HW02/28  Recursively reverse a list 
1/23  1/30  HW01/23  Use stack to evaluate postfix 
1/17  1/19  HW01/17  Recursive print a linked list 
1/12  1/17  HW01/12  Delete kth element from end of linked list 
1/10  1/12  HW01/10  Delete kth element from linked list 
1/5  1/10  HW 01/05  Compute prefix sums 
Date  Topic  Reading  Resources 

4/18  A couple data structures  just for fun: trie, skiplist More on rigorous definition of Big Oh  
4/11 

GTG: 4.2, 4.3 Haynes' writeup on runtimeAnalysis.html  
4/6  Sorts (mostly review). Lectures stressed quicksort, mergesort (internal and external),
bogo sort, radix sort.  GTG: 12.1, 12.2; GRG: 9.4.2; 

4/4  Discussion of hashing project: char stream file, random file access  especially "recordbased" I/O  
3/30  Test #2: Hashing, trees, BST, AVL, splay tree, Huffman; Priority queue  
3/28  Priority queue insert and delete operations, Priority queue array representation  
3/23  Priority queue introduction  
3/2  Trees, expression tree, binary tree, firstchildnextsibling, binary search tree (BST)  GTG: 11.1, 11.2  Recursive Code for BST 
2/28  Hashing: load factor, rehashing, what makes a good hash function, closed addressing  
2/16  Test #1  
2/14  Tail recursion examples Summary on recursion Hashing  open addressing, linear probe (insert, delete, find)  Hash Tables: see GTG Section 10.2  
2/7  Recursion  G T & G: Chapter 5 Recursion  Watching it work 
recursion examples: pseudocode 
2/1  Expression tree. Postfix, infix tree traversal  Expression tree is described GTG page 318  
1/26  stack algorithms  
1/24  Continue from 1/12 (circular queue, Stack operations, queue, dequeue)  Infix <==> Postfix worksheet  
1/17  Continue from 1/12  
1/12  Demo: debugging Linear Data Structures: array, singly linked list, doubly linked list, circular list, stack, queue, dequeue  SEARCH! 
GTG: 3.1  3.4 (array, sll, dll, cl), 6.1 (stack), 6.2 (queue), 6.3 (dequeue)  
1/10  Explanations of sorts: insertion, selection, bubble  https://en.wikipedia.org/wiki/Insertion_sort, GTG 3.1.2 https://en.wikipedia.org/wiki/Selection_sort https://en.wikipedia.org/wiki/Bubble_sort  
1/5  Orientation to the course Homework example Assignment A Solution 
Review Java: GT & G: Chpt 1, 2 
3. Projects
Distributed  Due  Identifier/ Link  Precis 

4/4  4/18/2017  PP #2 input.dat  Hashing to a random access file 
2/7/2017  2/28/2017  PP #1  Simulation 