Basic Course Information

Tests:

Programming Assignments/Homework:

• 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. April 3.

  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

Reading Assignments:

• 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)
• Recursion
• Sections 7.6  and 7.7 (Mergesort and Quicksort)
• Hashing (Chapter 5)

Class Programs:

•  Linked List with Header Node
•  Stacks using Array Implementation

Parentheses Checking Example.
•  Binary Search Trees

Insertion, traversal, making copies, computing height.
•  More on Tree Traversals
• Heap Examples
• Gui Examples 1-8
• Quicksort Example
• Non-recursive Inorder Traversal