Dc08 - Study guides, Class notes & Summaries
Looking for the best study guides, study notes and summaries about Dc08? On this page you'll find 1 study documents about Dc08.
All 1 results
Sort by
-
DC08 DATA STRUCTURES
- Exam (elaborations) • 187 pages • 2024
-
- $21.99
- + learn more
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 ...
Want to regain your expenses?
How much did you already spend on Stuvia? Imagine there are plenty more of you out there paying for study notes, but this time YOU are the seller. Ka-ching! Discover all about earning on Stuvia