CSC 344 - Algorithms and Complexity

Dr R. M. Siegfried

Midterm Study Guide

Midterm exam is Monday, March 6, 2017

You will need to know the following for the midterm:

• Basic mathematical induction problems (lecture 1)
• Determining asymptotic notation for algorithms (lecture 2)
• Algorithmic efficiency (best case, worst case, average case) (lecture #3) for:
• Selection sort
• Insertion sort
• Mergesort
• Quicksort
• Heapsort
• Bubble sort
• Cocktail shaker sort
• Polyphase merge for external sorting (Lecture #4)
• Constructing (Lecture #5):
• AVL tree
• 2-3 tree
• B-tree (for a given order)
• Finding the minimum spanning tree from a graph (Lecture #6) using:
• Kruskal's Algorithm
• Prim's Algorithm

[Back to the Notes Page]