Homework 1 assignment
(Due date: Monday Sept. 21 (theory part)
and Thursday Sept. 24 (programming part))
Homework
2 assignment (Due date: October 2,
Friday)
Homework 3 assignment
(Due date: Thursday Oct. 7 (theory part)
and Thursday Oct. 14 (programming part))
Homework 4 assignment
(Due date: Tuesday Oct. 27 (theory part)
and Friday Oct. 30 (programming part))
Homework 5 assignment
(Due date: Friday Nov. 13 (theory part)
and Monday Nov. 16 (programming part))
Time: Mon, Tue, Thu, Fri, 10:10pm – 11:00am
Room: Stocker 107
Instructor: Dr. Jundong
Liu
Office:
Email:
liu@cs.ohiou.edu.
Phone:
593-1603.
Office
hours: Mon, 11am-1pm, Tue, Thu, 11am-12pm or by appointment.
Required Text: Horowitz, Sahni, and Mehta, Fundamentals
of Data Structures in C++, 2nd Edition, Silicon Press, 2007.
Recommended Text: A good C++ reference text that
contains information about STL. One standard is Stroustrup,
The C++ Programming Language,
Third
Edition, Addison Wesley Publishing Company, 1997.
Midterm
Exam: Friday, October 9
Last
Day to Drop: Monday,
October 12
Veteran's
Day (No Class): Wednesday, November 11
Final
Exam: Monday,
November 23, 10:10 a.m.
Grades:
· Written Homework (guideline),
Quizzes, and Programming Projects: 50%
· Midterm Exam: 25%
· Final Exam: 25%
Students enrolled in CS 561N will complete additional, more challenging
work in this course. In particular, students in CS 561N will
complete at least one additional programming project.
Final grades will be determined by applying the following scale. 90%
and above= A, 80% and above = B, 70% and above = C, 60% and above = D, Below
60% = F. This scale may be adjusted downward at the discretion of the
instructor; however, it is very unlikely that the scale will be adjusted
downward by more
than 10%.
The course emphasizes the importance of fundamental data structures
and algorithms to programming. Here we build on CS240C and examine the
following topics in more detail: (i) abstract data
types, (ii) mathematical analysis of algorithms, (iii) trees and graphs, (iv)
searching and sorting techniques, and (v)
advanced data
structures.
Regular
class attendance is strongly recommended. Class attendance is not used in the
final determination of grades. However, quiz dates will not be announced, and
missed quizzes cannot be retaken. Missed quizzes receive zero points unless you
have an excused absence. Students are required to attend class during the
midterm exam and the final exam.
It is
expected that the work you submit is your own. Plagiarism and other forms of
academic dishonesty will be handled within the guidelines of the Student
Handbook. Students who commit serious acts of academic misconduct will receive
an F in this class and the University Judiciaries will be noticed.