 Course
Overview
 Algorithm
Analysis
 Introduction
to basic concepts of algorithms and computation.
 Modelling
Runtimes
 Some
Recurrences and their solutions
 BigOh
notation and analysis
 Linear
Data Structures
 Pointers
 Linked
lists
 Stacks
 Queues
 Trees
 Overview
 Binary
Trees
 Binary
Search Trees
 AVL
Trees
 Hash
Tables
 Overview
 Separated
Chaining
 Open
Addressing
 Heaps
(Priority Queues)
 Overview
 Binary
Heaps
 Applications

 Sorting
 Overview
 Insertion
Sort
 Shellsort
 Heapsort
 Mergesort
 Quicksort
 Analysis
of Sorting Algorithms
 Disjoint
Sets
 Graph
Data Structures and Algorithms
 Representation
of Graphs
 Topological
Sorting
 ShortestPath
Algorithms
 Minimum
Spanning Trees
 Depthfirst
Search Algorithms
 Algorithm
Design Techniques (Subject to Time remaining)
 Greedy
Algorithms
 Divide
and Conquer
 Dynamic
Programming
