## Asst. Prof. Salih Bayar

## CEN360 (Algorithms Design and Analysis) Fall 2018/2019

### Text Book

- A. Levitin “Introduction to the Design & Analysis of Algorithms,” 3rd ed., Ch. 6 ©2012 Pearson Education.
- Algorithm design, Foundations, Analysis, and Internet Examples, M.T.Goodrich, R.Tamassia, John Wiley & Sons, 2002, ISBN: 9780471383659

### Grades

### Grading Policy

**Midterm Exam** 30%
**LAB** 20% (There are 10 LABs, each LAB is 2% of your grade)
**Final Exam** 50%

### Exam Dates (Tentative)

**Midterm Exam** 16th November 2018, 14:00-15:45
**Final Exam** 4th January 2019, 14:00-15:45
**Retake Exam** 18th January 2019, 14:00-15:45

### Hints for the exams

- Exams will be closed book
- There will also be questions related to LABs
- There will no coding from scratch
- You will probably fill in the blanks in a given code snippet

### LABS

### Course Outline

- Time Complexity, Order of growth
- O(g(n)), Θ(g(n)), Ω(g(n))
- Euclid's Algorithm (gcd)
- Gaussian elimination, Counting binary digits
- Solving recurrence relations
- Brute force algorithms (e.g. computing a^n, a!, string matching, ...)
- TSP, Knapsack
- Binary search, Quick Sort, Merge Sort
- Master Theorem
- Gaussian Elimination
- Heaps (MaxHeap, MinHeap) and HeapSort

### Lecture Slides

### Midterm Exam Study Guides