Computer Science III Lectures for Spring 2008
Lecture |
Date |
Topics |
Overheads |
Handouts |
---|---|---|---|---|
Final Exam, Thursday (May 8) 10-11:50 AM in ITT 322 |
||||
30 |
5/1 |
Review for Final |
|
|
29 |
4/29 |
Graph Algorithm: Prim's Minimum-Spanning Tree algorithm |
|
|
28 |
4/24 |
Graph Algorithm: Strongly Connected Components |
|
|
27 |
4/22 |
Graph Searching: Details of DFS |
|
|
26 |
4/17 |
Test 2 |
|
|
25 |
4/15 |
Review for Test 2 |
|
|
24 |
4/10 |
|
|
|
23 |
4/8 |
Graph searching: BFS and DFS |
|
|
22 |
4/3 |
Introduction to Graphs, Adjacency Matrix and Adjacency List Representations |
|
|
21 |
4/1 |
(No class due to jury duty) |
|
|
20 |
3/27 |
Binary Heap |
|
|
19 |
3/25 |
AVL Trees – height balanced BST |
|
|
Spring Break – March 17 to March 21 |
||||
18 |
3/13 |
Homeworks #4 and #5 discussion; Lab 8 – BST code |
|
|
17 |
3/11 |
Homework #4 discussion; Binary Search Tree implementation |
|
|
16 |
3/6 |
Tree terminology, List of lists implementation and “pointer” implementation |
|
|
15 |
3/4 |
Quick Sort |
|
|
14 |
2/28 |
TEST 1 |
|
|
13 |
2/26 |
Review for Test 1 and Merge Sort |
|
|
12 |
2/21 |
Hash table introduction |
|
|
11 |
2/19 |
Binary Search – recursive and iterative Computational complexity argument that O(n log2 n) is the limit for comparison searches |
|
|
10 |
2/14 |
Algorithm Analysis: big-oh Examples: sequential search |
|
|
09 |
2/12 |
Section 7.2: List ADT using a linked representation |
|
|
08 |
2/7 |
Recursion – factorial, fibonacci (recursive/divide-and-conquer vs. dynamic programming) |
|
|
07 |
2/5 |
Queues Implementations (including circular array implementation), and Deque Implementations |
|
|
06 |
1/31 |
Stack Implementations: array, Lists, and linked |
|
|
05 |
1/29 |
More on the Python Tkinter GUI module |
|
|
04 |
1/24 |
Python Tkinter GUI module introduction |
|
|
03 |
1/22 |
Python functions, modules, and classes |
|
|
02 |
1/17 |
Python Control Structures and Files |
|
|
01 |
1/15 |
Python Intro. And Lists |
|