- Lab 01 : HW1 review, recursion, order notation
- Lab 02 : execution time, pseudo random numbers, generic types
- Lab 03 : Stacks
- Lab 04 : Linked List
Exceptions in Java
- Lab 05 : Exercises on Sorting and Linked List
- Practice midterm solutions: revised version,
old version with some errors
(the practice questions are here)
- Grade table including midterm grades.pdf
- Lab 06 : Binary tree traversals
- Lab 07 : Binary Search Tree batch inserts and graphics display.
- Lab 08 : Collision-handling in open addressed hash tables.
- Lab 09 : Generics redux - map data type.
- Lab 10 : Breadth First Search for source destination paths in graphs.
- Lab 11 : Breadth First Search to compute graph diameter.
- Lab 12 : Shortest path between cities.
|