Skip Navigation Links.

BIM304 - Computer Algorithm Design

Instructor: Asst.Prof.Dr.Alper BİLGE
Teaching Assistants:
Course Book: Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein
Grading: MT1: %30, Final: 40%, Projects: 30%
Other Resources: Data Structures and Algorithms in C, Mark Allen Weiss
Course Outline:
1. Week

Introduction
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
https://www.cs.usfca.edu/~galles/visualization/Algorithms.html


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

MIDTERM I


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

Union-Find


11. Week

Shortest Path Algorithms


12. Week

MIDTERM II


13. Week

Greedy Algorithms: Activity Scheduling, Huffman Coding


14. Week

KD-Trees


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

© 1993-2017 CENG. All rights reserved.