The handouts are in PDF format; they can be viewed/printed using
Adobe Acrobat Reader™. Acrobat Reader can be downloaded by
clicking on the following button
The slides are supplied in color and black and white (second form for printing). They are 1-up. To get more on one page use. e.g. PDFCreator
the course. Problem Solving. Notions of Algortimics.
Stacks, queues.pdf L01a-Lists.pdf
Stack of primitives An implementation in C of an array-basedstack of primitive types, completed with tests. Current implementation stores ints, but, by changing StackElementT to other C primitive type, and rebuilding you get a stack of that type.
||L02Trees. Terminology. Rooted Trees. Traversals. Labeled Trees and Expression Trees. Tree ADT. Tree Implementations. Binary Search Trees. Optimal Search Trees.pdf|
||L03-SetsTerminology. Operations. Set-Based ADTs. Implementations. ADT Dictionary. Direct Access Tables. Hash Tables. Mapping ADT. Priority Queue ADT. Partially Ordered Trees. Heaps.pdf|
Set Representation Methods. AVL trees. 2-3(4) trees.
Graphs. Definitions, representations, ADTs. Single Source
Shortest Path Problem (Dijkstra, Bellman-Ford,
Floyd-Warshall). Traversals for DGs. Parenthesis Lemma.
DAGs. Strong Components. Topological Sort.pdf
Graphs. Terminology. Free Trees. Representations. Minimum
Spanning Trees (algorithms Prim, Kruskal). Graph
Traversals (dfs, bfs). Articulation points. Biconnected
Components. Graph Matching.pdf
Analysis. Correctness and efficiency.pdf
Design. Divide-and-Conquer. Dynamic Programming.pdf
Design. Brute Force Algorithms. Greedy Algorithms.
Design. Minimax. Alpha-Beta Pruning. Search Tree
Strategies (backtracking revisited, branch and bound).
sorting. Index files.pdf
Variants. Amortized Analysis.pdf