TEST 2: CS 425 (Theory of Algorithms) Date: 11/17/2017 1. Short Questions: a) What is the advantage of Hashing over other method of searching? b) Consider a complete undirected graph with 8 vertices. How many edges this graph will have? c) Given a binary search tree as below: 7 Give the post-order tree traversal order of the vertices. d) Give the adjacency matrix for the following graph 8 10 20 12 60 32 Draw a binary search tree using the following keys: 34 38 Show the full tree. No details needed. Put dummy nodes if needed. 17 25 35