Data Structures Algorithms-II MCQs

Page No. 7

What is the auxiliary space requirement of interpolation search?


aO(n)

✖


bO(2n)

✖


c O(1)

✓


dO(log n)

✖


View Answer O(1)

What is the time complexity of interpolation search when the input array has uniformly distributed values and is sorted?


a O(n)

✖


b O(log log n)

✓


c O(n log n)

✖


dO(log n)

✖


View Answer O(log log n)

ln which of the following case jump search performs better than interpolation search?


aWhen array has uniformly distributed values but is not sorted

✖


b when array is sorted and has uniform distribution of values

✖


cwhen array is sorted but the values increases exponentially

✓


dwhen array is not sorted

✖



Interpolation search performs better than binary search when?


aarray has uniformly distributed values but is not sorted

✖


barray is sorted and has uniform distribution of values

✓


carray is sorted but the values are not uniformly distributed

✖


darray is not sorted

✖



Interpolation search is a variation of?


a Linear search

✖


bBinary search

✓


cJump search

✖


d Exponential search

✖


View Answer Binary search

Which of the following is the most desirable condition for interpolation search?


aarray should be sorted

✖


barray should not be sorted but the values should be uniformly distributed

✖


carray should have a less than 64 elements

✖


d array should be sorted and the values should be uniformly distributed

✓



Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.


a true

✓


b false

✖


cA & B

✖


dNone of these

✖


View Answer true

The naive pattern searching algorithm is an in place algorithm.


atrue

✓


bfalse

✖


cA & B

✖


dNone of these

✖


View Answer true

What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?


aO(n + m)

✖


bO(m)

✓


cO(n)

✖


dO(m * n)

✖


View Answer O(m)

What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?


aO(n + m)

✓


bO(m)

✖


cO(n)

✖


d O(m * n)

✖


View Answer O(n + m)

Goto Page No.

Page 7 of 149

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