- Catalog Description
-
Linked lists, stacks, queues, recursion, trees, sorting, searching, introduction to graphs, space and time consideration. (Offered to non-CENG students only).
- Lecture Time/Place
- Wednesdays - 9:40 to 12:30 in IE-105.
- Course Objectives
- At the end of this course, students will be able to:
-
design and analyze basic algorithms such as sorting and searching,
-
learing basic algorithm design principles such as dynamic programming, divide and conguer, and backtracking,
-
and learn and use basic data structures such as stacks, queues, and trees.
- Prerequisites
- Reading Material
- Textbook:
Mark Allen Weiss, Data Structures and Algorithm Analysis in C++ (3rd ed.), Addison Wesley, 2006.
- Grading Policy
-
Programming assignments: 20%
-
Midterm exam: 35%
-
Final exam : 40%
-
Attendance : 5%
Other Policies
-
If you have a medical excuse you may take make-up exams for the midterm and final exams.
-
Late submission of assignment will be allowed with 20 points penalty per day. Submissions will be made via ODTU-Class.
-
All homework must be to be your own work. No group projects are allowed. Violators of this policy will be subject to disciplinary action.
-
At least 50% class attendance and taking the midterm exam is required to enter the final exam.
Instructor:
Tolga Can
(tcan@ceng.metu.edu.tr)
Office Location: Computer Engineering, B-109
Office Hours: Tuesdays 8:30-9:30, Wednesdays 8:30-9:30. Contact the instructor
Teaching assistant:
Mehmet Akif Akkus
e-mail: akifakkus@ceng.metu.edu.tr