Professor: Peter Pacheco
Office: Harney 540
Phone: 422-6630
Email: peter@usfca.edu
Office Hours: MW 5:30-7:00 and by appointment

TA: Anna Tikhonova
Email: atikhono@cs.usfca.edu

Course Syllabus

Information on the Final Exam

Homework Assignments

1. Assignment 1. Due Monday, Jan 31 at the beginning of class
   • pp. 15-17 of the text: 1.5, 1.13a
   • pp. 70-74: 3.3, 3.4abc, 3.6ab, 3.9abcd
   • A Key to assignment 1.
   • A Parentheses Checking Program
2. Assignment 2. Due Monday, Feb 7. Add the dummy header to the linked list class StudentDB.java.ll and modify the methods so that the constructor, insertStudent, member, getStudent, and printDB all work correctly.
3. Assignment 3. Due Monday, Feb 14. Modify StudentDB.java.ll2 so that it uses a doubly-linked list instead of a singly-linked list.
4. Assignment 4. Due Wednesday, Feb 23, Modify TohStack.java so that it uses an array instead of a linked list. The other classes in the program are TohI.java and TohNode.java.
5. Assignment 5. Due Monday, March 7. Use this code to study the average heights of binary search trees. Write a main method (and any other methods you need) so that the code finds the average height of binary search trees with a given number n of keys. The average should be taken over all possible permutations of the keys 0, 1, . . . , n-1. What's the largest number of keys that your program can handle?
6. Assignment 6. Due Wednesday, March 30. Here's a key to assignment 6.
7. Assignment 7. Due Monday, April 11.
   • pp. 219-222: 7.3abc, 7.4, 7.5
   • Use mathematical induction on the number of vertices n to prove that a free tree has n-1 edges.
   Here's a key to assignment 7.
8. Assignment 8. Due Monday, April 18.
   • Apply the strong components algorithm to the digraph that has the following adjacency matrix:

                 0 1 0 1 0 0 0
                 0 0 1 1 0 0 0
                 1 0 0 1 0 0 0
                 1 0 1 0 0 0 0
                 0 0 0 0 0 1 1
                 0 1 0 0 0 0 0
                 0 0 1 0 0 1 0
        

     Your solution should show the depth-first spanning forest and vertex numbering generated by the first depth-first search. It should also show the depth-first spanning forest generated by the second DFS.
   • pp. 219-222: 7.7, 7.12
   Here's a key to assignment 8.
9. Assignment 9. Due Monday, April 25. Here's a key to assignment 9.
10. Assignment 10. Due Monday, May 9.
    • pp. 262-266: 8.4, 8.5ab, 8.8ab, 8.10ab
    Use the implementations of sorting algorithms from class.

    Note that the code segment in 8.10b should read

             for (i = 0; i < L.length; i++)
                qsort(L, i, L.length-1);
       

    Here's a key.

Programming Assignments

1. Programming Assignment 1
2. Programming Assignment 2
3. Programming Assignment 3. Here are some definitions and algorithms.
4. Programming Assignment 4

Additional Information

• Sun's Java Tutorial
• Introduction to Programming Using Java, an online Java textbook.
• Thinking in Java, another online Java textbook.
• Student Database Program
  1. StudentDBMain.java
  2. Student.java
  3. StudentDB.java.array
  4. StudentDB.java.ll
  5. StudentDB.java.ll2
• Timing examples
  1. ArrayOps.java
  2. StopWatch.java
  3. array_ops.c
  4. timer.c
  5. timer.h
• Run time type checking in Java
  1. TypeMain.java
  2. Foo.java
  3. Bar.java
• The Towers of Hanoi solved iteratively by using a stack
  1. TohI.java
  2. TohNode.java
  3. TohStack.java
• Files for studying the height of binary search trees.
• Some definitions and algorithms for B-trees.
• Pseudo-code for Dijkstra's algorithm.
• Pseudo-code for Prim's algorithm.
• Pseudo-code for DFS, BFS, and Topological Sort.
• Some sorting algorithms.