1. CENG 707 Data Structures and Algorithms
Nihan Kesim Çiçekli
Department of Computer Engineering
Middle East Technical University
Fall 2014

2. CENG 707 Instructor: Nihan Kesim Çiçekli Office: A308
Lecture Hours: Tue. 18:00-21:00
Course Web Page:

3. Course Description
Course Objectives: To introduce abstract concepts for data organization and manipulation, to show how these concepts are useful in problem solving. 
Prerequisite: C programming
References
Mark Allen Weiss, Data Structures and Algorithm Analysis in C++ (3rd ed.), Addison Wesley, 2006 (Current Textbook).
M. T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++, John Wiley & Sons, 2004 Mark Allen Weiss, Data Structures and Problem Solving Using C++, 2nd ed., Addison Wesley 2000
Sartaj Sahni, Data Structures, Algorithms, and Applications in C++, McGraw Hill, 1998.
H.M. Deitel, P.J. Deitel, How To Program C++ and Java by Prentice-Hall, 2001.
The C++ Tutorial:

4. Course Outline Introduction to object-oriented programming with C++
Algorithm analysis
Recursion
Searching and Sorting
Linked Lists
Stacks
Queues
Trees
Hashing
Priority Queues
Graphs

5. Grading Midterm Exam 1 20% Midterm Exam 2 20% Final Exam 30%
Programming Assignments 30%

6. Policies Policy on missed midterm: Lateness policy:
no make-up exam
Lateness policy:
You have a 7 day late submission opportunity to be spend in any assignment.
All assignments and programs are to be your own work. No group projects or assignments are allowed.