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

2. CENG 213 – Section 1 Instructor: Nihan Kesim Çiçekli Office: A308
Lecture Hours:
Section 01: Monday 14:40 -16:30 (BMB2); Thursday 10:40 -11:30 (BMB2)
Course Web Page:
Teaching Assistants:
Burak Kerim Akkuş, Office: A206
Mehmet Akif Akkuş, Office: A402
Tuğberk İşyapar, Office: A302
CENG 213 Data Structures

3. 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
S.B. Lippman, J.Lajoie, B. Moo, C++ Primer, Pearson Education, 2010
H.M. Deitel, P.J. Deitel, How To Program C++ and Java by Prentice-Hall, 2001.
The C++ Tutorial:
CENG 213 Data Structures

4. Grading Midterm: 35% Final Exam: 35%
Programming Assignments: 15% (3 x 5%)
Lab Quizzes: 15% (3 x 5%)
CENG 213 Data Structures

5. Policies Policy on missed midterm: Lateness policy:
There will be a make-up exam in the week following the midterm exam.
Lateness policy:
Every student has a total of 7 days for late submission of the assignments. One can use at most 3 late days for any assignment. There will be no penalty submission in case the limit is exceeded.
In order to be eligible to take the final exam, a student needs to:
get at least 12 points out of 30 points for programming assignments and lab quizzes;
AND
attend at least 4 lab recitations out of 7 sessions.
Otherwise; the student is not allowed to take the final exam and hence will get "NA".
All assignments and programs are to be your own work. No group projects or assignments are allowed.
CENG 213 Data Structures

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]
Priority queues [chapter 6]
Hashing [chapter 5]
Graphs [chapter 9]
CENG 213 Data Structures