Transcript CENG 213 Data Structures - Middle East Technical University

CENG 213
Data Structures
Nihan Kesim Çiçekli
Department of Computer Engineering
Middle East Technical University
CENG 213 Data Structures
1
CENG 213 – Section 1
Instructor: Nihan Kesim Çiçekli
Office: A308
Email: [email protected]
Lecture Hours:
• Section 1: Tue. 9:40, 10:40; Thu. 9:40 (BMB4)
Course Web Page: http://cow.ceng.metu.edu.tr/
Teaching Assistant:
Atıl İşçen, [email protected]
Kerem Hadimli, [email protected]
CENG 213 Data Structures
2
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++, 2nd
ed., Addison Wesley 2000
3. Sartaj Sahni, Data Structures, Algorithms, and Applications in
C++, McGraw Hill, 1998.
4. H.M. Deitel, P.J. Deitel, How To Program C++ and Java by
Prentice-Hall, 2001.
CENG 213 Data Structures
3
Grading
•
•
•
•
Midterm I
Midterm II
Final
Assignments
20 % (Nov 13, 2008 tentative)
20 % (Dec 18, 2008 tentative)
35 %
25 %
CENG 213 Data Structures
4
Policies
• Policy on missed midterm:
– no make-up exam
• Lateness policy:
– Late assignments are penalized.
• All assignments and programs are to be
your own work. No group projects or
assignments are allowed.
CENG 213 Data Structures
5
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
6