Index of class resources

Handouts — homework problem sets, homework solutions, other helpful handouts
General Class Information — class and section times, instructor and TA information

• Course Syllabus
• Resources and Guidelines
• Homework
• Homework # 1 (Due at 12:30 on 01/21/04)
• Homework # 2 (due at 12:30pm on 01/28/04)
• Homework # 3 (Due at 12:30pm on 02/04/04)
• Homework # 4 (Due at 12:30pm on 02/18/04)
• Homework # 5 (Due at 12:30pm on 03/03/04)
• Homework # 6 (Due at 12:30pm on 03/10/04)
• Practice exam
• Lecture Notes
• Introduction - divide and Conquer
• Abstract Data Types and Modules in C
• Growth of functions
• Recurrences
• Graphs and Graph Traversals
• Minimum Spanning Trees
• Binary search trees and Red-Black trees
• HeapSort
• Quicksort
Programming assignments
• Prog Assign. # 1 (Due at 11:59pm on 01/25/04)
  Linked list ADT (iterative version) and sorting lists.
• Prog Assign. # 2 (Due at 11:59pm on 02/08/04)
  Arithmetic expression evaluation using binary tree ADT and stack ADT.
• Prog Assign. # 3 (Due at 11:59pm on 02/29/04)
  Boggle: the word game (Backtracking algorithm and dictionary ADT)
• Prog Assign. # 4 (Due at 11:59pm on 03/08/04)
  Depth First Search and Strongly connected components

• Alisa Neeman ( aneeman _at_ cse.ucsc.edu )
• Kai Wang ( kwang _at_ cse.ucsc.edu )
• Rajya Hari ( rhari _at_ cse.ucsc.edu )

• MSI page:
  http://people.ucsc.edu/~tguicher/msi
• Schedule:(Check with Thib for any changes in the schedule)
  * Monday 11:00-12:10 (Baskin Whiteboards)
  * Wednesday 5:00-6:10 (Baskin Whiteboards)
  * Thursday 4:00-5:10 (Baskin Whiteboards)