CPSC 215L: Data Structures and Algorithms, Fall 1999

Class Time: TR 9:55am-11:10am
Class Location: MC 225
Lab Time: Th 1:15-3:55pm
Lab Location: Mac Lab, MCEC 136

Dr. Chuck C. Liang
Office: MCEC 343
Office Phone: (860 297) 5395
Office Hours: Monday-Thursday 4-5pm or by appointment
Email: chuck.liang@mail.trincoll.edu

Course Description:

A study of data structures and algorithms using the Java programming language. The basic data structures (lists, stacks, queues, trees, and heaps) and basic algorithms (searching, sorting) will be introduced and implemented. Data and procedural abstraction, software design principles, and analysis of the complexity of algorithms will be studied. Details related to writing programs will be covered in a required weekly lab.
Prerequisite: CPSC 115L.

Required Text: "Data Structures in Java" by Thomas A. Standish.

Reference Material:


Class Web Page: http://www2.trincoll.edu/~cliang/c215F/


List of Topics (tentative):

  1. Introduction and Review of Java Basics
  2. Static scoping; runtime stack
  3. File handling
  4. Primitive v.s. Reference Data Types
  5. Abstract data type concept
  6. Some sorting algorithms
  7. Linked lists
  8. Complexity Analysis
  9. Recursion
  10. Polymorphism and inheritance
  11. stacks and queues
  12. Binary trees
  13. Heaps
  14. Hash Tables
  15. Graphs
  16. Advanced topics (as time allow)

Auxiliary Topics:

  1. Object oriented design
  2. Memory Management
  3. Event handling
  4. Multi-threaded programming
  5. Computer mathematics
  6. GUI design and computer graphics



Exams, Assignments and Grading

Assignment will be given regularly. There will be a midterm exam and a final. The final exam will be cumulative. The grade distribution will be roughly as follows: midterm: 20%, final 25%, quizes, homeworks, labs and other programming assignments 55%.

All material handed in must be in hard copy, and be well organized and legible. Unreadable material will not be graded. Consultation of outside sources (including books, friends) for completion of assignments must be pre-approved. Late assignments will not be accepted.

Attendance

Regular class attendance is required. The Dean of Students' office will be notified of those who repeated miss classes. Students are responsible for all material, in all forms, presented during scheduled class times. All labs must be attended. No points will be given for missed labs, even if the required work is completed.


Final Note: The contents of the this syllabus may be modified according to the progress of the course.