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

CENG 213 Data Structures2 CENG 213 – Section 2 Instructor: Nihan Kesim Çiçekli Office: A308 Lecture Hours: Section 2: Tue. 09:40, 10:40 (BMB4); Thu. 09:40 (BMB2) Course Web Page: Teaching Assistants: Ümit Ruşen Aktaş, Office: Gülcan Can, Office: Abdullah Doğan, Office: İbrahim İleri, Office: Erdal Sivri, Office:

CENG 213 Data Structures3 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 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 Sartaj Sahni, Data Structures, Algorithms, and Applications in C++, McGraw Hill, H.M. Deitel, P.J. Deitel, How To Program C++ and Java by Prentice-Hall, 2001.

CENG 213 Data Structures4 Grading Midterm I20% (Nov 15, 2012, Thursday, tentative) Midterm II20% (Dec 13, 2012, Thursday, tentative) Final Exam25% Assignments30% (Three programming homework) Attendance & Quizzes 5%

CENG 213 Data Structures5 Policies Policy on missed midterm: – 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, and – s/he attends at least 1/2 of the quizzes/attendance checks All assignments and programs are to be your own work. No group projects or assignments are allowed.

CENG 213 Data Structures6 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]