This page will automatically refresh every 60 seconds.

CSC17: Fundamentals of Computer Science III, Spring 2008

Dr. Chuck C. Liang
Associate Professor of Computer Science, Hofstra University .

Office Address:
201A Adams Hall
Hofstra University
Hempstead, NY 11550
Office Phone: (516 463) 5559

Email: cscccl@hofstra.edu (<- click to send me mail)

Official Office Hours: MWF 1-2pm


Course Syllabus
Goals and Objectives documents 1 and 2.

Online Resources:

lab 1, lab 2, lab 3, lab 4, lab 5, lab 6, lab 7, lab 8a, lab 8b, lab 9, lab 10, lab 11

Support files for lab 5: quicksort doubles, heap of doubles
Lab 3 Special Edition.


Sample correspondance between a C++ program first.cpp and a Java program first.java
some java code for linked lists. (similar to ones from 2/5 class).
quicksort.java
Heap implementation (for integers)
Basic interface example
Polymorphic linked lists
Examples of inheritance: account.java, teams.java
Example of an abstract class
Closed hash table
Polymorphic closed hash table

Polymorphic open hash tables: ohash.java, polyhash.java, student.java.

Another version of polymorphic (open) hash tables

Binary tree node class.(Reload for latest version)
treegraph program
testnode: sample usage of node and treegraph
Random binary search trees
Alternative, "algebraic" implementation of trees using inheritance.

What you need to know about recurrence relations.

Implementation of AVL trees
AVL tree test program,
AVL gui program. (be sure to download latest versions of all tree files before using)

Astar final assignment files:

  1. Assignment description
  2. coord.java. (coordinate info)
  3. pathfinder.java. (main)
  4. astar.java. (this is the file you'll change)
  5. heap.java. (priority heaps)
  6. man15.gif, gem1.gif, Water.gif, grass1.gif, boat.gif. (animated gifs)
Final Assignment SPECIAL EDITION!


Announcements:

We will meet in Adams 204 during the scheduled time of our final exam on Tuesday 5/13, 1:30-3:30pm. The A-star assignment is due at that time. Attendance is absolutely required (no credit for last assignment otherwise).