This page will automatically refresh every 60 seconds.

CSC155: Fundamentals of Computer Science III, Spring 2005

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: (<- click to send me mail)

Official Office Hours: MW 5:30-6:30pm, TuThF 2-3pm

Course Syllabus

Online Resources:

Submit Assignment
View Submitted Assignment

(Please accept the self-signed certificate. Your data will be encrypted.)

Better version of the "quick and dirty" tutorial's program that illustrates the use of header files and friend functions: header file, implementation file

Warshall's algorithm (from 4/7 class, bugs fixed)
code to check if a tree structure is indeed a tree (from 4/7 class).
Dijkstra's single-source shortest path algorithm

Assignment 1
Assignment 2. (tentative)
Files for assignment 2: boxworld.h, boxworld.cpp, asn2.h, asn2.cpp
Additional help for assignment 2

Assignment 3 (Heaps and heapsort). Here's the program that times the performance of quicksort
Written Assignment 1. Due date Tuesday 3/22.
Assignment 3b. Due Tuesday 3/15. Here's my code for polymorphic quicksort: header and implementation.
Here's the heap sort sample solution if you need it.

Assignment 4. Due Tuesday 4/12, with additional problem (firm deadline).
Assignment 5. There's only one problem right now, more will be added later. Submit under designation "asn5".
DNA sequencing assignment part I. Due 4/28. (submit hardcopy).
DNA sequencing assignment part II. Due 5/5.

Final Assignment: A* pathfinding. You'll need the following files:


Attendance during scheduled final exam time (Tuesday 4-6pm) is mandatory. Non-attendance would be equivalent to missing the final exam. The current due date of A* assignment is the time of the final. I will be here everyday during finals week.