1. CENG 213 Data Structures Dr. Cevat Şener

2. Data Structures
Entities (data organization) and operations on these entities
These entities often constitute a common language and basic tools that facilitate the problem solving
Implementation of these entities and operations
Efficiency → Algorithm Analysis

3. CENG 213 Data Structures Learning the abstract model Analysis
How to implement
How to use in a problem solution

4. CENG 213 – Section 03 Instructor:
Dr. Cevat Şener, Office: B206
Lecture Hours:
Section 03: Monday 14:40 -16:30, BMB1 & Wednesday 10:40 -11:30, BMB3
Web:
Newsgroup:
snews://news.ceng.metu.edu.tr:2050/metu.ceng.course.213
Assistants:
Burak Kerim Akkuş, Office: A206
Mehmet Akif Akkuş, Office: A402
M. Tuğberk İşyapar, Office: A302
CENG 213 Data Structures

5. Course Description
Course Objectives: To introduce abstract concepts for data organization and manipulation, to show how these concepts are useful in problem solving. 
Prerequisite: CENG140
Textbook: Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 3rd ed., Addison Wesley, 2006.
References
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, PHall, 2001.
The C++ Tutorial:
Info:
CENG 213 Data Structures

6. Course Outline
Overview of object-oriented programming with C++ [ch. 1]
Algorithm analysis [ch. 2]
Sorting [ch. 7]
Lists, stacks, queues [ch. 3]
Trees [ch. 4]
Priority queues [ch. 6]
Hashing [ch. 5]
Graphs [ch. 9]
CENG 213 Data Structures

7. Lab Sessions Introduction to C++ C++ Classes Memory management in C++
C++ templates
Linked Lists
Binary trees
CENG 213 Data Structures

8. Grading Midterm: 35% Final Exam: 35% Programming Assignments: 15%
Lab Quizzes: 15%
CENG 213 Data Structures

9. Policies Late policy for programming assignments:
Each assignment will have a fixed duration of 10 days and every student has a total of 7 days for late submissions during which no points will be deducted.
However, one can use at most 3 late days for any assignment. Your assignment will not be accepted if you submit more than 3 days late or you used up all of the 7 late days.
In order to be eligible to take the final exam, a student needs to:
get at least 12 points out of 30 for prog. assignments + lab quizzes
AND
attend majority of the lab sessions (at least 4 out of 6).
Otherwise; the student is not allowed to take the final exam and hence will get "NA".
CENG 213 Data Structures

10. Policies (2) Makeup exams
Makeup for the midterm exam will take place one week after the exam.
Makeup for the final exam will take place at the end of the semester.
One needs officially documented excuse to take a makeup exam.
Assignments will be announced on the newsgroup. Please, check the newsgroup regularly.
All assignments and programs are to be your own work. No joint work between students is allowed in assignments. Cheating will be punished according to the university regulations.
CENG 213 Data Structures

11. Quizzes
Quiz questions will be related to the programming assignments and they will take place right after the deadlines of the respective assignments.
Therefore, it is critical that you have worked on and submitted your programming assignments before the quizzes.
CENG 213 Data Structures