Data Structures and Algorithms-I MCQs

Page No. 35

Which of the following technique stores data separately in case of a collision?


aOpen addressing

✖


bDouble hashing

✖


cQuadratic probing

✖


dChaining using a binary tree

✓



What is the disadvantage of BST over the hash table?


aBST is easier to implement

✖


bBST can get the keys sorted by just performing in order traversal

✖


cBST can perform range query easily

✖


dTime complexity of hash table in inserting, searching and deleting is less than that of BST

✓



What is the advantage of a hash table over BST?


ahash table has a better average time complexity for performing insert, delete and search operations

✓


bhash table requires less space

✖


crange query is easy with hash table

✖


deasier to implement

✖



What is the time complexity of the delete function in the hash table using a binary tree?


aO(1)

✓


bO(n)

✖


cO(log n)

✖


dO(n log n)

✖


View Answer O(1)

What is the time complexity of the search function in a hash table using a binary tree?


aO(1)

✓


bO(n)

✖


cO(log n)

✖


dO(n log n)

✖


View Answer O(1)

What is the time complexity of insert function in a hash table using a binary tree?


aO(1)

✓


bO(n)

✖


cO(log n)

✖


dO(n log n)

✖


View Answer O(1)

What is the disadvantage of hashing with chaining?


anot easy to implement

✖


btakes more space

✓


cquite sensitive to hash function

✖


dtable gets filled up easily

✖


View Answer takes more space

What is the advantage of hashing with chaining?


acache performance is good

✖


buses less space

✖


cless sensitive to hash function

✓


dhas a time complexity of O(n) in the worst case

✖



Which of the following variant of a hash table has the best cache performance?


ahash table using a linked list for separate chaining

✖


bhash table using binary search tree for separate chaining

✖


chash table using open addressing

✓


dhash table using a doubly linked list for separate chaining

✖



Which of the following is an advantage of open addressing over separate chaining?


ait is simpler to implement

✓


btable never gets full

✖


cit is less sensitive to hash function

✖


dit has better cache performance

✖



Goto Page No.

Page 35 of 53

Alphabetical MCQs Categories
—

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"
—

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan