Skip Navigation Links.

BIM304 - Computer Algorithm Design

Instructor: Assoc. Prof. Dr. Alper Kürşat UYSAL
Teaching Assistants:
Course Book: Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein
Grading: MT1: %20, MT2: %25, Final: 40%, Projects: 15%
Other Resources: Data Structures and Algorithms in C, Mark Allen Weiss
Course Outline:
1. Week

Iterative Algorithm Analysis
Asymptotic Notations
Recursive Algorithms & their analysis
Hash Tables

2. Week

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

Animation of Data structures & Algorithms

3. Week

Divide&Conquer Sorting Algorithms: QuickSort
Selection & Medians

4. Week

Heaps and HeapSort

5. Week

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

6. Week


7. Week

Graphs: Introduction, Breath-First-Search

8. Week

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

9. Week

Minimum Spanning Trees

10. Week


11. Week

Shortest Path Algorithms

12. Week


13. Week

Greedy Algorithms: Activity Scheduling, Huffman Coding

14. Week

Course recap

Home | Department | Undergraduate | Graduate | Research | Continual Improvement

© 1993-2020 CENG. All rights reserved.