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 1: Tue. 9:40, 10:40; Thu. 9:40 (BMB4) Course Web Page: http://cow.ceng.metu.edu.tr/ Teaching Assistant: Atıl İşçen, atil@ceng.metu.edu.tr Kerem Hadimli, kerem@ceng.metu.edu.tr 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. CENG 213 Data Structures

Grading Midterm I 20 % (Nov 13, 2008 tentative) Midterm II 20 % (Dec 18, 2008 tentative) Final 35 % Assignments 25 % CENG 213 Data Structures

Policies Policy on missed midterm: Lateness policy: no make-up exam Lateness policy: Late assignments are penalized. 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] Priority queues [chapter 6] Hashing [chapter 5] Graphs [chapter 9] CENG 213 Data Structures