Data Structures and Algorithms-I MCQs

Page No. 12

What is the time complexity for storing the maximum number of elements in Van Emde Boas tree if M is the maximum number of elements?


aO (log M)

✖


bO (M!)

✖


cO (M)

✓


dO (1)

✖


View Answer O (M)

Who Invented The vEB also known as Van Emde Boas Tree?


aPeter Van Emde Boas

✖


bSamuel F. B. Morse

✖


cFriedrich Clemens Gerke

✖


dAlexander Morse

✓


View Answer Alexander Morse

What is the other name or Van Emde Boas Tree data structure?


aVan Emde Boas Array

✖


bVan Emde Boas Stack

✖


cVan Emde Boas Priority Queue

✓


dVan Emde Boas Heap

✖



What is the condition for an equivalence relation if two cities are related within a country?


athe two cities should have a one-way connection

✖


bthe two cities should have a two-way connection

✓


cthe two cities should be in different countries

✖


dno equivalence relation will exist between two cities

✖



What is the total time spent for N-1 merges in a dynamic equivalence problem?


aO(N)

✖


bO(log N)

✖


cO(N log N)

✓


dO(M log N)

✖


View Answer O(N log N)

How many strategies are followed to solve a dynamic equivalence problem?


a1

✖


b2

✓


c3

✖


d4

✖


View Answer 2

In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from?


aleaf to root

✓


broot to node

✖


croot to leaf

✖


dleft subtree to right subtree

✖


View Answer leaf to root

What is the worst-case running time of unions done by size and path compression?


aO(N)

✖


bO(logN)

✖


cO(N logN)

✖


dO(M logN)

✓


View Answer O(M logN)

What is the value for the number of nodes of rank r?


aN

✖


bN/2

✖


cN/2r

✓


dNr

✖


View Answer N/2r

When executing a sequence of Unions, a node of rank r must have at least 2r descendants.


atrue

✓


bfalse

✖


ceither true either false

✖


dNone of the mentioned

✖


View Answer true

Goto Page No.

Page 12 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