CS 361/561N, Data Structure, Fall 2008

Lecture notes

 

 

Your grades

 

 

Homework 1  (updated due date: September 22, 11:59pm)

Homework 2  (due date: September 30)

Homework 3  (theory part due: October 7, project part due: October 14)

Midterm review

Homework 4  (theory part due: October 27, project part due: October 31)

 

Homework 5 Assignment (Due date: Thursday Nov. 13)

 

Bonus project (Due date: Friday Nov. 21, 11:59pm)

 

Final Review

 

Class Meetings:

Time: Mon, Tue, Thu, Fri, 10:10pm – 11:00am

Room: Stocker 198

 

Instructor: Dr. Jundong Liu

Office: Stocker Center 321 A.

Email: liu@cs.ohiou.edu.

Phone: 593-1603.

Office hours:  Mon, 11am-1pm, Thu, Fri, 11am-12pm or by appointment.

 

Pre-requisites:  CS 240C and CS 300

 

Textbooks:

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.

 

Course Syllabus and Schedule (PDF)

 

Important Dates:

Midterm Exam:                  Friday, October 10, 2008

Last Day to Drop:               Monday, October 13, 2008

Veteran's Day (No Class): Tuesday, November 11, 2008

Final Exam:                        Tuesday, November 18, 2008 8:10 a.m.

 

Grades:

·       Written Homework (guideline), Quizzes, and Programming Projects: 55%

·       Midterm Exam: 20%

·       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%.

 

Course Description:

     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.

 

Course and Attendance Policies:

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.

 

Academic Dishonesty:

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.