Miscellaneous On Data Structures - Study Mode
[#161] Which of the following fields are included in the hash table of coalesced hashing?
Correct Answer
(B) h(key), data, next
[#162] What will be the chromatic number for an bipartite graph having n vertices?
Correct Answer
(C) 2
[#163] What will be the chromatic number for a tree having more than 1 vertex?
Correct Answer
(C) 2
[#164] Which data structures can be used to implement least recently used cache?
Correct Answer
(A) Doubly linked list and a hash map
[#165] . . . . . . . . is one of the most useful principles of enumeration in combinationatorics and discrete probability.
Correct Answer
(A) Inclusion-exclusion principle