CSC17: Fundamentals of Computer Science III, Spring 2010

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: Monday-Thursday 1:30-2:30pm

Course Syllabus
Goals and Objectives documents 1 and 2.

Online Resources:

• Java API Documentation
• A short C++ to Java tutorial
• plaingui.java: simple gui class for interactive IO
  
• Tutorial on algorithm complexity
• Complexity of sorting algorithms
• Notes on Heap data structure (pdf). Required Reading.
• More on Hash Tables. Required Reading
• More background on dynamic programming and dynamic programming tutorial (advanced)
• Dynamic programming in bioinformatics. (Must Read)

lab 1, lab 2, lab 3, lab 4, lab 5, lab 6a, lab 6b

Support file for lab 5: student.java
Support files for lab 4: dheap.class (right click to download), quickdouble.java
Lab 3 Special Edition.

Submit all programming assignments on blackboard (please heed the warning about saving versus submitting)

Sample correspondance between a C++ program first.cpp and a Java program first.java
some java code for linked lists.
Recursive program that draws triangles. (from 1/27 class).
quicksort.java (only works with integers)
polymorphic quicksort
polymorphic heap structure
spaghetticode.java and foodfactory.java (examples of oop).
Another example of an abstract class with a generic type variable
Closed hash table and polymorphic closed hash table
Open hash table (one-dimensional)
More on interfaces and inheritance

Announcements:

Note on lab 5: in the polymorphic part of the program, you may have to call the three versions of search by different names (search1 and search2...). Otherwise, since their types are all abstract, the compiler will not be able to tell the difference (thanks to Mike for pointing this out).

Lab 4 MUST be submitted BEFORE Wednesday 3/10. Lab 5 must be submitted before Monday 3/15.

Exam March 17th DOWNGRADED to demi-exam. Study guide with practice problems available.

Classes were canceled for Wednesday 2/10. For make up: You are REQUIRED to watch this ONLINE LECTURE. This was the introductory lecture of a course taught at MIT, where "skipping problems will have a non-linear effect on your grade." You can skip the first 17 minutes of the lecture.

Please also read the tutorial above on algorithm complexity.