Download - Review #1
![Page 1: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/1.jpg)
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
![Page 2: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/2.jpg)
Review#1
Proper Design and Planning
Complexity Analysis Formal proof of order Program analysis using the Rules
2
![Page 3: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/3.jpg)
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
![Page 4: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/4.jpg)
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
![Page 5: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/5.jpg)
Review #2
Graphs and Graph Theory Applications to Computer Science Basic Definitions Representations – Adjacency List,
Adjacency Matrix DFT, BFT, tests for connectivity
C++ ProgrammingRun Time Analysis
5
![Page 6: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/6.jpg)
6
Final Review
Yippee!
![Page 7: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/7.jpg)
7
Final Review -Old Stuff
C/C++ ProgrammingData Structures Review
Stacks, Queues, Linked Lists Binary Search Trees
Binary Trees Heaps
Order ArithmeticObject-Oriented DesignAVL-Trees
![Page 8: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/8.jpg)
8
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
![Page 9: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/9.jpg)
9
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
![Page 10: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/10.jpg)
10
Final Review - New Stuff III
Secondary Storage – not for this semester Basic Disk Hardware Space Calculations Time Calculations
FOR ALL TOPICS Time Complexities
![Page 11: Review #1](https://reader036.vdocument.in/reader036/viewer/2022083006/56813ad2550346895da30417/html5/thumbnails/11.jpg)
11
The End Slide