CENG 213 Data Structures Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University CENG 213 Data Structures

CENG 213 – Section 1 Instructor: Nihan Kesim Çiçekli Office: A308 Email: nihan@ceng.metu.edu.tr Lecture Hours: Section 01: Tue. 10:40 12:30 (BMB2); Thur. 11:40 12:30 (BMB2) Course Web Page: http://cow.ceng.metu.edu.tr/ Teaching Assistants: Sinem Demirci, E-mail: sinem@ceng.metu.edu.tr; Office: A301 Özcan Dülger, E-mail: odulger@ceng.metu.edu.tr; Office: B202 CENG 213 Data Structures

Course Description Course Objectives: To introduce abstract concepts for data organization and manipulation, to show how these concepts are useful in problem solving.  Prerequisite: CENG 140 Text Book and 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: http://www.learncpp.com/ CENG 213 Data Structures

Grading Midterm I 20% (Nov 21, 2013, Thursday, tentative) Midterm II 20% (Dec 26, 2013, Thursday, tentative) Final Exam 30% Assignments 30% (Four programming homework) CENG 213 Data Structures

Policies Policy on missed midterm: Lateness policy: no make-up exam Lateness policy: Every student has a total of 7 days for late submission for assignments. One can spend this credit for any of the assignments or distribute it for all. If total of late submissions exceeds the limit, a penalty of 5*day*day is applied. A student can take the final exam if and only if s/he gets at least 30% points from each of the first two assignments All assignments and programs are to be your own work. No group projects or assignments are allowed. CENG 213 Data Structures

Course Outline Overview of object-oriented programming with C++ [chapter 1] Algorithm analysis [chapter 2] Sorting [chapter 7] Lists, stacks, queues [chapter 3] Trees [chapter 4] Hashing [chapter 5] Priority queues [chapter 6] Graphs [chapter 9] CENG 213 Data Structures