1 / 11

Review #1

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. Review#1. Proper Design and Planning Complexity Analysis Formal proof of order

denali
Download Presentation

Review #1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. Review#1 • Proper Design and Planning • Complexity Analysis • Formal proof of order • Program analysis using the Rules

  3. Review #2 • Binary Search Trees • Insert, Search, Delete, Print • AVL-Trees • Height and Balance Factor calculation • Four Types of rotations • Insert and Delete Algorithms

  4. 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

  5. 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

  6. Final Review Yippee!

  7. 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

  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

  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

  10. Final Review - New Stuff III • Secondary Storage – not for this semester • Basic Disk Hardware • Space Calculations • Time Calculations • FOR ALL TOPICS • Time Complexities

  11. The End Slide

More Related