Announcements

  1. (Jan 22) Course page is online.
  2. (Jan 22) Please register to the Moodle system. You will submit your assignments using Moodle.
  3. (Feb 11) Homework assignment 1 is available.
  4. (Mar 1) Homework assignment 2 is available.
  5. (Mar 31) Homework assignment 3 is available.
  6. (Apr 22) Homework assignment 4 is available.

Course Description

The course picks up from where CS 201 left by discussing concepts related to algorithmic efficiency on basic abstract data types and some sorting algorithms that utilize recursion. Then, the course introduces the abstract data types of trees, tables, priority queues, and graphs, and shows how one can implement them in C++ using fundamental data structures by emphasizing run-time complexity analysis.

Section 1

Instructor: Aynur Dayanık (Office: EA 426, Email: adayanik[at]cs.bilkent.edu.tr)
Lectures: Wed 10:30-12:20 (EE 214), Fri 15:30-17:20 (EE 214)

Section 2

Instructor: Aynur Dayanık (Office: EA 426, Email: adayanik[at]cs.bilkent.edu.tr)
Lectures: Mon 8:30-10:20 (B Z05), Wed 13:30-15:20 (B Z05)

Section 3

Instructor: Selim Aksoy (Office: EA 422, Email: )
Lectures: Tue 8:30-10:20 (EE 412), Thu 13:30-15:20 (EE 412)

Teaching Assistants

Office Hours

Texts

  1. Frank M. Carrano and Timothy Henry, Data Abstraction and Problem Solving with C++: Walls and Mirrors, any edition, Pearson, 2013 or newer (textbook, ebook).
  2. Harvey M. Deitel and Paul J. Deitel, C++ How to Program, any edition, Prentice Hall, 2011 or newer (recommended).
  3. Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 3rd edition, Addison Wesley, 2006 (recommended).

Lectures

Topics

Contents

Algorithm Analysis

[ Slides ]
  • Measuring the Efficiency of Algorithms (Ch. 10 of Carrano-Henry)
  • 1 week

Sorting

[ Slides ]
  • Sorting Algorithms and Their Efficiency (Ch. 11 of Carrano-Henry)
  • Sorting animation
  • 2 weeks

Trees

[ Slides ]
  • Binary Search Trees (Ch. 15, 16 of Carrano-Henry)
  • 2 weeks

Heaps

[ Slides ]
  • Heaps (Ch. 17 of Carrano-Henry)
  • 2 weeks

Balanced Search Trees

[ Slides: Part 1 | Part 2 ]
  • AVL, 2-3, 2-3-4, Red-Black Trees (Ch. 19 of Carrano-Henry)
  • 3 weeks

Hashing

[ Slides ]
  • Hashing (Ch. 18 of Carrano-Henry)
  • 1 week

Graphs

[ Slides ]
  • Graphs (Ch. 20 of Carrano-Henry)
  • 3 weeks

Exams

Homework

  1. Assignment 1: Due 23:55 on February 26, 2021
  2. Assignment 2: Due 23:55 on March 18, 2021
  3. Assignment 3: Due 23:55 on April 16, 2021
  4. Assignment 4 (vertex data, edge data): Due 23:55 on May 10, 2021

Homework assignments will be posted on this page. Assignments are expected to be turned in by 23:55 on the due date. You should upload your solutions to the homework assignments using Moodle before the deadline.

For the late submissions, each student will be given two grace days for each homework assignment (with no deduction of points). If no submission is received within two days after the homework deadline, no submission will be accepted for that homework.

Please make sure you fully understand the Bilkent University Policy on Academic Honesty (in Turkish) and the Rules and Regulations of the Higher Education Council (YOK) (in Turkish). Cheating and plagiarism on exams and homework assignments will be punished according to these regulations.

Grading Policy

Homework:20%
Midterm exam:40%
Final exam:40%

In order to be able to take the final exam, a student must

Otherwise, the student will receive the FZ grade.

The instructors also reserve the right to set other thresholds for passing grades.

Due to the YOK (Higher Education Council) regulations, we are taking attendance and will report it to the Department at the end of the semester.

Advice

When you are in doubt, ask. Use office hours. If you cannot visit us during office hours, you can always ask questions or arrange meetings by e-mail. Study regularly for the course and attend classes. Do your assignments on time and pay attention to the instructions for submitting assignments. Always make sure that the code you submitted does compile and run correctly.

Related Links