1. CENG 213 Data Structures Department of Computer Engineering Middle East Technical University Fall 2014 CENG 213 Data Structures 1

2. CENG 213 Section 1 Instructor: Pınar KARAGÖZ A404 karagoz@ceng.metu.edu.tr Lecture Hours: Section 1: Mon. 13:40, 14:40 (BMB1); Thurs. 09:40 (BMB1) Course Web Page: http://cow.ceng.metu.edu.tr/http://cow.ceng.metu.edu.tr/ Teaching Assistants: Özcan Dülger, Fatih Semiz, Dilek Önal, Batuhan Karagöz CENG 213 Data Structures 2

3. Course Description Course Objectives: To introduce abstract concepts for data organization and manipulation, to show how these concepts are useful in problem solving. Learning Outcomes: At the end of the course unit, the student is expected to be able to use appropriate data structures for the solution of the problem at hand. The student should be able to design and implement abstract data types which use efficient algorithms to manipulate these structures. Prerequisite: CENG 140 Text Book Mark Allen Weiss, Data Structures and Algorithm Analysis in C++ (3rd ed.), Addison Wesley, 2006. CENG 213 Data Structures 3

4. Grading Midterm I20% November 13, 2014 Midterm II20% December 18, 2014 Final30% Quiz and Assignments30% (1 quiz and 3 prog. homeworks) CENG 213 Data Structures 4

5. Policies Policy on missed exam: o make-up exam in case of formal excuse (submitted BEFORE exam) Lateness policy: o On the total 7 days for late submission o You can can use at most 3 days per homework A student can take the final exam if and only if s/he has at least 50% attendance and gets at least 30% points as the average first two assignments. All assignments and programs are to be your own work. No group projects or assignments are allowed. CENG 213 Data Structures 5

6. 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 6