Middle East Technical University
Department of Computer Engineering
CENG 213 Data Structures
Fall 2009
Instructors:
Halit Oğuztüzün(Section 01)
Phone: 210 5587 Email: oguztuzn@ceng.metu.edu.tr Office: A307
Pınar Şenkul (Section 02)
Phone: 210 5518 Email: senkul@ceng.metu.edu.tr; Office: B110
Teaching Assistants:
Onur Deniz
Phone: 210 5532 Email: deniz@ceng.metu.edu.tr Office: B301
Samet Akpınar
Phone: 210 5511 Email: samet@ceng.metu.edu.tr Office: BZ19
Lecture Hours:
Section 01: Tue. 10:40, 11:40; Thu. 9:40 (BMB1)
Section 02: Tue. 10:40, 11:40; Thu. 9:40 (BMB2)
Prerequisite: CENG 140
Mark Allen Weiss, Data Structures and Algorithm Analysis in C++ (3rd ed.), Addison Wesley, 2006.
Course Objectives: To introduce abstract concepts for data organization and manipulation, to show how these concepts are useful in problem solving and how they can be made concrete by using an object-oriented programming language.
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]
Midterm I 20 % (Nov 19, 2009 tentative)
Midterm II 20 % (Dec17, 2009 tentative)
Final 30 %
Assignments 30 %
There will be no make-up exams for midterms. In case you have a legal and documented excuse, the weight of the final exam will be adjusted to compensate for the missing exam. Exams and homework assignments will be common to all sections.
Code of Honor: Any work you submit must be your own.