Announcements

  1. (Sep. 18) Classes begin
  2. (Sep. 29) Midetrm information is posted
  3. (Oct. 01) Homework1 is posted

Course Description

The course picks up from where the first semester course 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: Erman Ayday(Office: EA 529, Email: erman[at]cs.bilkent.edu.tr)
Lectures: Tue 13:40-15:30 (B-204), Thu 15:40-17:30 (B-204)

Section 2

Instructor: Ugur Dogrusoz (Office: EA 522, Email: )
Lectures: Mon 10:40-12:30 (EA-Z03), Thu 8:40-10:30 (EA-Z03)

Teaching Assistants

Graders

  • Umut Utku Calis, Email: utku.calis[at]bilkent.edu.tr
  • Mustafa Enes Karaca, Email: enes.karaca[at]bilkent.edu.tr

    • Office Hours

    Texts

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

    Lectures

    Topics

    Contents: Carrano-Henry Book, Sixth Ed., Related Chapter

    Algorithm Efficiency and Sorting

    [ Slides, Slides ]
    • Algorithm Efficiency and Sorting Algorithm Efficiency: Ch. 10, 11
    • Sorting animation
    • 3 Weeks

    Trees

    [ Slides ]
    • Bınary Search Tree: Ch. 15, 16
    • 2 Weeks

    Heaps

    [ Slides ]
    • Heaps: Ch. 17
    • 2 Weeks

    Balanced Search Trees

    [ Slides: Part 1 | Part 2 ]
    • AVL, 2-3, 2-3-4, Red-Black Trees: Ch. 19
    • 3 Weeks

    Hashing

    [ Slides ]
    • Hashing: Ch. 18
    • 1 Week

    Graphs

    [ Slides ]
    • Graphs: Ch.20
    • 3 Weeks

    Exams

    Homework (tentative schedule)

    1. Assignment 1: Algorithm Analysis using Sorting Algorithms
    2. Assignment 2: Mostly Binary Search Trees
    3. Assignment 3: Heaps and AVL Trees
    4. Assignment 4: 2-3, 2-3,4, red-black trees, and hash tables

    Homework assignments will be posted on this page about 10 days before their due date. 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. No late submission will be accepted.

    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, quizzes, and homework assignments will be punished according to these regulations.

    Grading Policy

    Quiz:9%
    Homework:16%
    Midterm exam 1:25%
    Midterm exam 2:25%
    Final exam:25%

    To avoid FZ and take the final exam a student must collect at least

  • 40% of the weighted sum of the quiz, midterm1, midterm2, and first 3 homework grades
    • and
  • 30% of first 3 homework grades

    • 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