Computer Science 761: Analysis of Algorithms
Lehman College, City University of New York
Fall 2002

Announcements:

• Information about the Comprehensive Exam for March 2003 is available here.
  

• The prerequisite for this course is CMP 338 (Data Structures and Algorithms I) and MAT 313 (Elements of Linear Algebra). It is highly recommended that you have also completed CMP 337 (Discrete Mathematics and Applications to Computer Science). If you have not taken the prerequisite courses, do not sign up for this course. All students who have not completed the prerequisites will be adminstratively dropped from the course during the first two weeks of classes.

Handouts:

• Syllabus
• Outline
• Academic Policies (pdf) 
• For lecture on Tuesday, 3 September:
  
  • Notes on sorting
  • Sun sorting demo
• For lecture on Thursday, 5 September:
  
  • Mergesort code (C++)
  • Mergesort demo (written by JungSin Min, based on work of James Gosling)
    
• Answer key for Quiz 0
• For lecture on Thursday, 19 September:
  • Heapsort notes
  • Heapsort demo (written by Prof. Holder, UT Arlington)
    
• For lecture on Tuesday, 24 September:
  • QuickSort notes
  • QuickSort demo (written by Alejo Hausner, CS Department, Princeton University)
• Quiz 1 (due 24 September)
• Programming Assignment 1 (due 25 September)
• For lecture on Thursday, 26 September:
  • Counting Sort notes
  Counting sort demo and notes (by Tristan Towers, CS Department, Cardiff University)
• Quiz 2 (due 3 October)
• Quiz 3 (due 10 October)
• For lecture on Thursday, 10 October:
  • Huffman code applet by Tony Xinging Yin.
• Information for Exam 1
  
• Quiz 4 (due 24 October)
• Quiz 5 (due 31 October)
• Quiz 6
• Quiz 7
• For lecture on Thursday, 7 November:
  
  • Kruskal's Algorithm applet (written by Kenji Ikeda, Tokushima University, Japan)
  • Prim's Algorithm applet (written by Papagelis Athanasios, University of Patras, Greece)
    
  • Maximum Flow applet (written by Rod Worl, Monash University, Australia)
• For lecture on Tuesday, 12 November:
  
  • Network Flow applet (written for U Sask. class project/lecture)
  • Dijkstra's algorithm applet (written for U Sask. class project/lecture)
• Quiz 8
• Information for Exam 2
• Quiz 9
  

Useful Links:

• Blackboard (Lehman's site)