![]() |
CISC2200, Data Structures, Spring 2024 |
Course Description:
This class studies abstract data types (their specification, applicaiton and implementation) including list, stack, queue, tree, and graph, with an emphasis on object oriented engineering principles such as encapsulation, inheritance and polymorphism. Problem solving using recursion, analysis and comparison of sorting/search algorithms are also studied.
Prerequisite: CISC2000/CISC2010, Computer Science II and Lab, or equivalent. Topics:
Lecture: Tuesday/Friday 11:30-12:45pm, JMH330 Instructor: Dr. Xiaolan Zhang
Attendance: Attendance of lecture is mandatory. Expectation: Students are expected to spend five to eight hours (not including the lecture) each week in the assigned reading, homework and lab projects. Students are expected to read the assigned chapter of the textbook before the class. Assignment: Submissions turned in late will be penalized, and no submission is accepted one week after its due date. You can write to the instructor to ask for an extension of up to one week for reasons such as illness, heavy workload or other reasons. The maximum number of extensions per person is three. It's the student's responsibility to notify the instructor if there is any difficult in submitting programming assignment on line right away by email, and follow up with the instructor on next class. Academic Integrity: You should only hand in your own work for assignments (written or programming). Copying solutions from others, or from the Internet will be penalized as violation of academic integrity. Equally important, you should not let other students copy your solutions to assignments. Please review Academic Integrity Poicy of Fordham. Grading Criteria: Final grade is based on the weighted sum of the following course works, with the exception that if one fails the final exam, then one fails the class.
|
|||||||||||||