Introduction to Computer Science II

Rules for writing programs

Instructions for course email list

Sending homeworks by email

• Where to submit your programs
• How to attach and send your programs to a Unix machine

Writeups & Related Programs

• Stack programs

  • Evaluating postfix expressions & converting infix to postfix
  • Converting infix w/oparentheses to postfix
  • StackIsEmptyException
  • StackADT w/API exception

• Queue programs

  • The queue ADT class
  • Using the queue

• Linked list programs

  • Introduction to linked lists
  • stackadt.java as a linked list
  • Using a queue
  • The queueadt.java as a linked list
  • About queues

• Tree programs

  • manually producing a binary tree
  • Binary search tree using char type
  • Binary search tree using Comparable
  • calculating the height & printing the leaves
  • Counting nodes of a tree w/ void method
  • Counting the nodes of a tree w/ a function & making mirror image
  • Copying a tree
  • evaluating an expression tree
  • Testing for identical tree
  • Performing a binary search
  • A breadth-first search of a tree
  • The QueueADT file
  • Inserting balance factor in O(n)
  • Time analysis
  • 2-3 Trees
  • How to write tree procedures
  • Overton's tree-drawing methods

• Sort programs

  • The quick sort
  • The quick sort w/midpoint element as pivot
  • The quick sort w/midpoint element as pivot; uses Comparable
  • How the Quick sort works
  • Building a heap
  • Sorting an array using heap sort
  • How the heap sort works

• Hashing programs

  • A simple hash
  • Using the API HashMap

Homeworks

• Homework #1 Evaluating infix expressions
  
• Homework #2 Solving the fifteen puzzle
  
  • The original fifteen program
• Homework #3, Draft1, Huffman Coding

  Helpers for Homework #3, draft #1

  • Data set
  • FileStringReader(name) reads a string from file name
  • How to procede
  • The output for draft 1
• Homework #3, Draft 2, Huffman Coding compression

  Helpers for Homework #3, draft #2

  • Algorithm explained
  • The testing program(Optional)
  • The compressed file for the testing program(Optional)
  • The output for the testing program(Optional)
  • The compressed file
  • Partial output for the program
• Homework #3, Draft 3, Huffman Coding using a heap
  • Partial output for draft #3
  • Diagram of steps for draft #3
• Homework #4 , A Simple Compiler

  Helpers for Homework #4

  • Statement to be compiled (input data)
  • IR code for sequential T subscripting
  • A stack of Object

  Honors Projects

  • Unary minus

Class Programs

2002 midterm and answers

Sample midterm #2

Solutions for Sample midterm #2

The sample final questions