CS Data Structures II Review & Final Exam

2 Topics Review Final Exam

3 Review Recursion - Chapter 6 backtracking 8-queen problem Language recognizer Palindromes AnBn Algebraic Expression Is prefix Convert among the expression

4 Review Class relationship – Chap 9 Inheritance and polymorphism Dynamic binding Abstract class and interface Class relations IS-A HAS-A

5 Review Tree – Chapter 11 Concepts Node (vertex), Edges, height, depth Full Binary Tree, Complete BT, Balanced Tree ADT Binary Tree Traversal Implementation (reference based) Expression tree Convert expression into tree Convert between different notation

6 Review Tree – Chapter 11 ADT BST Implementation Insertion Deletion Search Traversal Efficiency TreeSort How to store BST into file?

7 Review Table and priority Queues – Chap 12 Table Implementation Sorted Array-based BST-based Priority Queue Heap based implementation Heap Insertion & deletion Implementation-array based Heap sort Steps (transform array into heap, form two regions, deletion root, rebuild heap)

8 Review Advanced Implementation of Table – Chap tree Build Insert delete AVL tree Build Insert Delete Efficiency

9 Review Advanced Implementation of Table – Chap 13 Hashing Concepts How to choose a table size ? How to choose a hash function? How to handle the collision Open hashing –Chain Closed hashing – linear probing, quadratic probing Efficiency & Feedback

10 Review Graph – chap 14 Terminology Weighted graph Directed & undirected Connected & unconnected Strongly connected & weekly connected Cyclic & acyclic Implementation Array List

11 Review Graph – chap 14 Traversal DFS Recursive Using Stack BFS Using Queue

12 Review Graph – chap 14 Spanning Tree Using DFS to find Spanning tree Using BFS to find Spanning tree MST Prim algorithm Find a MST for a given graph Dijkstra algorithm Find the cheapest path from one vertex to another

13 Final Exam Topics No programming questions for 2-3 tree, avl tree and graph, hashing No question on chapter 15 Class Notes Labs Assignments

14 Final Exam Time: Monday, April 11th, 2pm Place: WW 102 Format 10 multiple choices (10%) Short Answer Questions (50%-60%) Programming Questions (~30%)