1. Overview Analysis Notation Specific ADTs
Review
Overview
Analysis
Notation
Specific ADTs
4/6/2019
CS 303 – Review
Lecture 13

2. Review Problem Mathematical Model Abstract Data Types Data Structures
Informal Algorithm
Pseudo-code
Code
Solution
Analysis
Input - length (very large) and condition (worst case)
Algorithm Complexity (vs. constant factors)
Notation
T(n), O(f(n)), W(g(n)
4/6/2019
CS 303 – Review
Lecture 13

3. Specific ADTs & Implementation Techniques
List (Sequence)
Stack, Queue
Tree
Ordered vs. unordered (TTLO)
Paths, length, ancestor/descendant, height/depth
Traversals
Binary Tree (see text for weighted BT & Huffman coding)
Priority Queue
Partial Order
Heap
4/6/2019
CS 303 – Review
Lecture 13