Advanced Data Structures

Student Learning Outcomes, Goals, Objectives:

Students successfully completing this course will be able to:

1. understand and use advanced features of Java such as inheritance and generics;

2. can design divide-and-conquer algorithms using three steps and apply to merge sort, quick sort, dynamic programming, and backtracking;

3. understand tree representation and traversals;

4. understand associative containers, red-black trees, and hashing;

5. understand graph representations, traversals, and basic graph algorithms;

Course Grading Information:

Activity/Performance Measure	Percentage/Points
Assignments	40%
Mid-Term 1	15%
Mid-Term 2	15%
Final Exam	20%
Attendance	10%

Attendance is mandatory for all class meetings. If a student is unable to attend an in-person class, they must inform the instructor in advance by providing a valid reason for their absence. This communication should be done through email and must be sent before the class session begins. Failure to notify the instructor prior to the start of class will result in the student losing credit for that absence. It should be noted that attendance records may be taken either at the beginning or the end of the class. Students are advised to ensure their presence throughout the session to avoid any discrepancies in the attendance record.

There will be in-class short-quizzes or problem solving for bonus points.

Grading Scale

Percentage	Letter Grade
94-100	A
90-93	A-
87-89	B+
84-86	B
80-83	B-
77-79	C+
74-76	C
70-73	C-
67-69	D+
64-66	D
60-63	D-
<59	F

Attendance/Participation:

Attendance is mandatory for all class meetings. If a student is unable to attend an in-person class, they must inform the instructor in advance by providing a valid reason for their absence. This communication should be done through email and must be sent before the class session begins. Failure to notify the instructor prior to the start of class will result in the student losing credit for that absence. It should be noted that attendance records may be taken either at the beginning or the end of the class. Students are advised to ensure their presence throughout the session to avoid any discrepancies in the attendance record.

There will be in-class short-quizzes or problem solving for bonus points.

Course Materials Purchased by the Students:

Mark Allen Weiss. Data Structures and Problem Solving Using Java, 4th edition, Addison Wesley, ISBN 0-321-54140-5.