---

CmpE 300.02 Analysis Of Algorithms

Fall 2007

---

ANNOUNCEMENTS

• Problem Session: January 5, 15:00, ETA A5.
• Here are your midterm grades:

AĞAYEV	37	59
ALITSIK	13
CERAN	76	54
ÇİZMECİLER	50	26
DİNÇ	27	76
DİNLER	55	33
ERDOĞAN	21	23
FERHAT	71	50
KARASU	10	28
KAYA	55	65
RAŞİT	27	63
SELÇUK	26	59
ŞENER	55	9
TUNAOĞLU	81	83

• Midterm 2 will be held in room 16 on Friday, December 14, at 14:00.
• No lecture on Wednesday, December 12.
• Problem Session: December 10, 17:00, ETA A6.
• There will be no lecture on December 3. We are all invited to say goodbye to our physicist friends.
• Here are your midterm grades:

AĞAYEV	37
ALITSIK	13
CERAN	76
ÇİZMECİLER	50
DİNÇ	27
DİNLER	55
ERDOĞAN	21
FERHAT	71
KARASU	10
KAYA	55
RAŞİT	27
SELÇUK	26
ŞENER	55
TUNAOĞLU	81

• Important: The two sections of this course are separate: Different exams, different instructor, different textbook, etc.
• Reload this page frequently if you don’t want to miss announcements.

· We don't delete announcements. They just slide down to become old announcements.

---

Catalog Description

Analysis of computer science algorithms: Sorting, searching, paging and parallelism. Analysis of mathematical algorithms: Games and puzzles, network algorithms, and probabilistic algorithms.

Textbook

“Algorithms,” by Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh Vazirani. McGraw-Hill Science/Engineering/Math, 2006.

Instructor

A. C. Cem Say (say@boun.edu.tr)

Prerequisite:

CmpE250

Course Topics

0. Big-O notation

1. Algorithms with numbers

2. Divide-and-conquer algorithms

3. Decompositions of graphs

4. Paths in graphs

5. Greedy algorithms

6. Dynamic programming

7. Randomized algorithms