Review #1
C/C++ Programming
Basic Statements
Structs, subroutines, call by address
Pointers
Static Vs. Dynamic Space Allocation
Classes
Public vs. Private methods
“friend” classes
1
Review#1
Proper Design and Planning
Complexity Analysis
Formal proof of order
Program analysis using the Rules
2
Review #2
Binary Search Trees
Insert, Search, Delete, Print
AVL-Trees
Height and Balance Factor calculation
Four Types of rotations
Insert and Delete Algorithms
3
Review #2
B-Trees
Idea of a m-way search tree
B-Tree Properties
Insert, Search, Delete, Print
File Representation
Heaps
Binary Min Heaps (could be Max as well)
Use, justification
Insert, delete  percolate up and down
4
Review #2
Graphs and Graph Theory
Applications to Computer Science
Basic Definitions
Representations – Adjacency List, Adjacency
Matrix
DFT, BFT, tests for connectivity
C++ Programming
Run Time Analysis
5
Final Review
Yippee!
6
Final Review -Old Stuff
C/C++ Programming
Data Structures Review
Stacks, Queues, Linked Lists
Binary Search Trees
Binary Trees
Heaps
Order Arithmetic
Object-Oriented Design
AVL-Trees
7
Final Review - New Stuff
Graphs and Graph Algorithms
Definitions
Graph Representations
Graph Algorithms
Traversals, Dijkstra’s Algorithm, Bellman-Ford
Algorithm, Prim’s Algorithm, Kruskal’s Algorithm
Algorithmic Strategies
Brute-Force, Backtracking, Branch & Bound,
Greedy, Divide & Conquer
8
Final Review - New Stuff II
B-Trees and m-way search trees
Definitions and properties
Insert, search, delete, print
Hashing
Basic idea, definitions
Extendible hashing – (Not for this semester)
insert, delete, search
9
Final Review - New Stuff III
Secondary Storage – not for this semester
Basic Disk Hardware
Space Calculations
Time Calculations
FOR ALL TOPICS
Time Complexities
10
The End Slide

11