BILKENT UNIVERSITY
CS 202 Fundamental Structures of Computer Science II, Fall '13

Dr. Tugrul Dayar
Department of Computer Engineering (EA 2nd floor Dean’s Office) e-mail: tugrul@cs.bilkent.edu.tr
Section 1 (10:40-12:30 M, 8:40-10:30 Th at EB202)
OH: 13:40-15:30 Th (or if this is not possible, by appointment from 1261)

Teaching Assistant
(Gündüz Vehbi Demirci, EA505, OH: 10:40-11:30 F,

Mecit Sarı, EA525, OH: 16:00-17:00 W, or if this is not possible, by appointment from x1425)

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.

Textbooks:
[1] Frank M. Carrano, Data Abstraction and Problem Solving with C++:
Walls and Mirrors, 5th edition, Addison-Wesley, 2006.
(You can also use the 4th edition.)
[2] Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 3rd edition, Addison Wesley,
2006. (recommended)
[3] Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 6th edition, Prentice Hall, 2008.
(recommended)

Course Outline:

  • Algorithm Efficiency and Sorting (Ch.9 of textbook [1], 3 weeks)
  • Trees (Ch.10 of textbook [1], 2 weeks)
  • Tables and Priority Queues (Ch.11 of textbook [1], 2 weeks)
  • Advanced Implementation of Tables (Ch.12 of textbook [1], 4 weeks)
  • Graphs (Ch.13 of textbook [1], 3 weeks)

Resources:

Advice:
When you are in doubt, ask. Use office hours. If you cannot visit me 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.

Grading:

  • Quiz (15%)
  • Homework (15%)
    Assignments will be posted 7-10 days before their due date.
    Assignments are due at class time on the due date; they will not be accepted after class time.
    Turned in assignments must be printer outputs with your names, student-ids, and sections on them;
    otherwise they will not be graded.
    You should also send an e-mail message (to the assigned TA) containing your typed homework and
    source codes of your C++ programs in your homework. You should send this e-mail message
    before 18:00 on the due date.
    Graded assignments are to be picked up from the TAs during their office hours.
    You have to do your own homeworks. Cheating will be heavily punished.
    • Assignment 1 (due on monday, October 7)
    • Assignment 2 (due on monday, October 28)
    • Assignment 3 (due on monday, November 25)
    • Assignment 4 (due on monday, December 9)
    • Assignment 5 (due on thursday, December 26)
  • Midterm 1 (20%) October 31 (thursday), 17:40-19:40
    (a closed book/notes exam, covers chapters 9-10 from [1])
  • Midterm 2 (20%) December 12 (thursday), 17:40-19:40
    (a closed book/notes exam, covers chapters 10-11-12 from [1])
  • Final (30%)
    (a comprehensive closed book/notes exam, covers chapters 9-13 from [1])

In order to be able to take the final exam,
one must obtain an average of at least 50% from the quiz and midterm grades;
else one will receive FZ.

 

Please see the Bilkent University policy for academic honesty.

Scores.