Skip Navigation Links.

BIM304 - Computer Algorithm Design

Instructor: Asst. Prof. Dr. Selcan KAPLAN BERKAYA
Teaching Assistants:
Course Book: Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein
Grading: MT1: %25, Final: 40%, Projects: 35%
Other Resources: Data Structures and Algorithms in C, Mark Allen Weiss
Course Outline:
1. Week

Iterative Algorithm Analysis
Asymptotic Notations


2. Week

Recursive Algorithms & their analysis

3. Week


Basic Sorting algorithms
Divide&Conquer Sorting Algorithms: MergeSort
Inversion Counting

Animation of Data structures & Algorithms


4. Week

Divide&Conquer Sorting Algorithms: QuickSort
Selection & Medians


5. Week

Heaps and HeapSort


6. Week

Lower Bounds on Comparison-based Sorting Algorithms
Linear Time Sorting Algorithms: Counting Sort and Radix Sort

7. Week


8. Week

Graphs: Introduction, Breath-First-Search

9. Week

Graphs: Depth-First Search, Topological Sort, Articulation Points (or Cut vertices)

10. Week

Minimum Spanning Trees

11. Week


12. Week

Shortest Path Algorithms

13. Week


14. Week

Course recap

Home | Department | Undergraduate | Graduate | Research | Continual Improvement FACEBOOK TWITTER INSTAGRAM LINKEDIN YOUTUBE

© 1993-2021 CENG. All rights reserved.