Dc08 Study guides, Class notes & Summaries

h Question carries 2 marks. Q.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is : (A) less than 1. (B) less than n. (C) less than m. (D) less than n/2. Ans:A Q.2 Let A be an adjacency matrix of a graph G. The th ij entry in the matrix K A , gives (A) The number of paths of length K from vertex Vi to vertex Vj. (B) Shortest ...