BIM 446: Analysis of Algorithms

1
BIM 446 Analysis of Algorithms

• Time Tuesdays 9-12am
• Location
• Instructor Cuneyt Akinlar
• Grading
• 2 Midterms 20 each
• Final 40
• Homeworks Project(s) - 20
• Books
• Introduction to Algorithms
• By Cormen, Lieserson, Rivest, Stein MIT press
• Data Structures and Algorithm Analysis in C
• Weiss

2
Whats an Algorithm

• A well-defined computational procedure that takes
  some values (data) as input and produces some
  result as output.
• Like a recipe, an algorithm provides a
  step-by-step method for solving a problem
• An algorithm is a mathematical entity independent
  of the PL

3
Whats Algorithm Analysis?

• Predicting the resources that the algorithm
  requires during its execution
• Typical resources?
• CPU, Memory

4
Course Outline

• Iterative Algorithm Design and Analysis
• Asymptotic Notations Chapters 1-3
• Iterative Sorting Algorithms
• Selection Sort, Bubble Sort, Insertion Sort
  Chapters 1-3
• Recursive Algorithm Design and Analysis
• Basic Recursive Algorithm Design Analysis
  Chapter 4
• Recursive Sorting Algorithms
• Mergesort, Quicksort, Heapsort Chapters 6, 7,
  8, 9
• Linear Sorting Algorithms
• Counting Sort and Radix Sort Chapter 9
• Selection and Medians Chapter 9

5
Course Outline (cont)

• Important Data Structures
• BSTs, AVL-Trees, 2-3 Trees, B and B Trees
• Tries and Hashing
• Graphs and Graph Algorithms
• Representation, Breath First search, Depth First
  Search, Topological Sort - Chapter 22
• Minimum Spanning Trees Chapter 23
• Single-Source Shortest Paths Chapter 24