CS 223- Spring 2006

 

Handouts
Links

Announcements
  • Final grades should be posted on myinfo.  If you would like to pick up your final, drop by my office.  If you are interested in any of the solutions to the final, I'll be happy to show you them.
  • Will has posted the lab grades here.  Please check to see that your grades are accurate.
  • If you plan to take CS 324 next year, please hold on to the CLRS textbook.
  • Will Merryman's (TA) office hours: Tuesday and Thursday 10-12 in EPS 351

Lecture/Lab Schedule

  • The lab sections are:
        CS 223-02 W 1100-1250 EPS 110
        CS 223-03 R 1410-1600 EPS 110
        CS 223-04 M 1610-1800 EPS 110
     
  • Labs will begin the week of Monday, Jan 23. 
  • There will be no lab sections during the week of Monday, Feb 20 due to Presidents Day and Midterm I.
     
  • Approximate lecture schedule below.
    • KW = Koffman, Wolfgang
    • CLRS = Cormen, Leiserson, Rivest, Stein
Date Topic Reading Labs
1/12 Introduction, course outline
review		   no labs
1/17
1/19		 Heaps and Heapsort
Priority Queues		 CLRS 6.1-6.5
KW 8.5		 no labs
1/24
1/26		 Median finding and
selection
Selection.java		 CLRS 9.1-9.3 In-lab 1
Out-lab 1
1/31
2/2		 Hash Tables
cont.
HashTable.java		 CLRS 11.1-11.4
KW 9.3-9.4		 In-lab 2
Out-lab 2
2/7
2/9		 Binary Search Trees
Red Black Trees
BinarySearchTrees.zip		 CLRS 12.1-12.3
KW 8.1-8.4
CLRS 13.1-13.4		 In-lab 3
Out-lab 3
2/14
2/16		 RB Trees cont.
RB Trees cont.
 		 KW 11.3
 		 In-lab 4
Out-lab 4
2/21
2/23		 MIDTERM I
Dynamic Programming
TowerHeight.java
CLRS 15.1-15.5		 no labs
 
2/28
3/2		 DP cont.
Greedy Algorithms
 Sequence Alignment
CLRS 16.1-16.3		 In-lab 5
Out-lab 5
3/7
3/9		 Huffman codes
Graph Algorithms
 		 KW 8.6
CLRS 22.1-22.3		 In-lab 6
3/14
3/16		 Spring break    
3/21
3/23		 BFS / DFS
Minimum Spanning Trees
 		 KW 12.1-12.3
CLRS 23.1-23.2		 In-lab 7
Out-lab 6
3/28
3/30		 MST cont.
MIDTERM II
 		 KW 12.6 In-lab 8
4/4
4/6		 Single Source Shortest Path
Dijkstra's algorithm
ByteTest.java		 CLRS 24.1-24.3 In-lab 9
Out-lab 7
4/11
4/13		 Bellman-Ford algorithm
Floyd-Warshall algorithm
FloydWarshall.zip		 CLRS 25.1-25.2
 		 In-lab 10
 
4/18
4/20		 Randomized algorithms
RSA Cryptosystem
 		 CLRS 5.1-5.3
CLRS 31.7
 		 In-lab 11
4/25
4/27		 Computability and Complexity
Course Review
 		 CLRS 34.1-24.5 In-lab 12
5/2
 		 FINAL EXAM (12:00-1:50)