BREADTH_FIRST_SEARCH_IS_USED_IN?$ – McqOptions

MCQOPTIONS

1.	BREADTH_FIRST_SEARCH_IS_USED_IN?$
A.	Binary trees
B.	Stacks
C.	Graphs
D.	All of the mentioned
Answer» D. All of the mentioned

Discussion

No Comment Found

Related MCQs

BREADTH_FIRST_SEARCH_IS_USED_IN?$
WHICH_OF_THE_FOLLOWING_SCENARIOS_LEADS_TO_LINEAR_RUNNING_TIME_FOR_A_RANDOM_SEARCH_HIT_IN_A_LINEAR-PROBING_HASH_TABLE??$
What is the best definition of a collision in a hash table?
Key value pairs is usually seen in
A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‚Äö√Ñ√∂‚àö√ë‚àö‚â§_‚Äö√Ñ√∂‚àö√ë‚àö¬• denotes an empty location in the table.$
The goal of hashing is to produce a search that takes
The searching technique that takes O (1) time to find a data is
A technique for direct search is
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 :