1. Short Questions: a) Why is Hashing prefèrred over other method of searching? b) Give a real life example where minimum spanning tree can be useful c) Given a complete graph with 20 vertices, how many edges are there? d) Explin the difference between a Tree and a Graph. e) How a spanning tree related to a graph? t) Explain briefly the separate chaining method of colision resolving. g) Given a graph with 12 vertices and
OR
OR