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

2. 2 CENG 707 Instructor: Nihan Kesim Çiçekli Office: A308 Email: nihan@ceng.metu.edu.tr Lecture Hours: Tue. 18:00-21:00 Course Web Page: http://cow.ceng.metu.edu.tr

3. 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 1.Mark Allen Weiss, Data Structures and Algorithm Analysis in C++ (3rd ed.), Addison Wesley, 2006 (Current Textbook). 2.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++, 2 nd ed., Addison Wesley 2000 3.Sartaj Sahni, Data Structures, Algorithms, and Applications in C++, McGraw Hill, 1998. 4.H.M. Deitel, P.J. Deitel, How To Program C++ and Java by Prentice-Hall, 2001. 5.The C++ Tutorial: http://www.learncpp.com/

4. 4 Course Outline 1.Introduction to object-oriented programming with C++ 2.Algorithm analysis 3.Recursion 4.Searching and Sorting 5.Linked Lists 6.Stacks 7.Queues 8.Trees 9.Hashing 10.Priority Queues 11.Graphs

5. 5 Grading Midterm Exam 120% Midterm Exam 220% Final Exam30% Programming Assignments30%

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