Introduction to Computer Science II (Honors)
Prof. Marsha Berger
Mon/Wed 11:00 a.m.-12:15 p.m.
Warren Weaver Hall, Room 101
Midterm:Wednesday, March 6
Final: Thursday, May 7, 2-4, Room 101 WWH.
Program 1: due by email to etutor by classtime
on Monday, Feb. 11
Program 2: due by email to etutor by midnight
on Monday, March 4
Program 3: due by email to etutor by midnight
on Monday April 1
Written Assignment 1: due by email to Prof. Berger by midnight on Wed.
Write a non-recursive routine to do inorder traversal using
an explicit stack.
Written Assignment 2: due to Prof. Berger Monday April
15, on heaps and Huffman codes.
Program 4: due by email to etutor by midnight
on Monday April 29
Chapter 1, background (mostly review)
Chapter 2 (we will start with this in class)
Chapter 3 Lists
Chapter 3 Stacks
Chapter 4 Trees (through 4.3, also 4.6)
Chapter 6 Heaps (through 6.4)
Section 7.5 (Heapsort)
Section 10.1 (Huffman codes only)
Sections 7.6 and 7.7 (Mergesort and Quicksort)
Hashing (Chapter 5)