University:
California State University, Northridge
Course:
COMP 182 | Data Structures and Program Design and Lab
Academic year:

2022
Views:

55

Pages:

8
Author:

NyiH

Attempt HistoryAttemptTimeScoreLATESTAttempt 155 minutes30 out of 30! Correct answers will be available on Nov 12 at 12:01am.Score for this quiz: 30 out of 30Submitted Nov 10 at 3:12pmThis attempt took 55 minutes.Question 12 ptsWhat is the best case for unordered linear search?O(nlogn)O(logn)O(n)oO(1) Question 22 ptsWhere is linear searching used?When the list has only a few elementsWhen performing a single search in an unordered listUsed all the timeWhen the list has only a few elements and Whenperforming a single search in an unordered listQuestion 32 ptsWhich of the following is a disadvantage of linear search?Requires more spaceGreater time complexities compared to other searchingalgorithmsNot easy to understandNot easy to implement Question 42 ptsWhat is the worst case for unordered linear search?O(nlogn)O(logn)O(n)O(1)Question 52 ptsWhat is the best case and worst case complexity of ordered linearsearch?O(nlogn), O(logn)O(logn), O(nlogn)O(n), O(1)O(1), O(n) Question 62 ptsIn which of the cases uniform binary search fails compared to binarysearch?A table lookup is generally faster than an addition and ashiftMany searches will be performed on the same arrayMany searches will be performed on several arrays ofthe same lengthComplexity of codeQuestion 72 ptsWhat is the time complexity of binary search with iteration?O(nlogn)O(logn)O(n)O(n2) Question 82 ptsGiven an array arr = {45,77,89,90,94,99,100} and key = 100; Whatare the mid values(corresponding array elements) generated in thefirst and second iterations?90 and 9990 and 10089 and 9494 and 99Question 92 ptsGiven an array arr = {5,6,77,88,99} and key = 88; How manyiterations are done until the element is found?1342 Question 102 ptsWhat is the advantage of recursive approach than an iterativeapproach?Consumes less memoryLess code and easy to implementConsumes more memoryMore code has to be writtenQuestion 112 ptsWhat is the worst case complexity of binary search using recursion?O(nlogn)O(logn)O(n)O(n2) Question 122 ptsWhich of the following is not an application of binary search?To find the lower/upper bound in an ordered sequenceUnion of intervalsDebuggingTo search in unordered listQuestion 132 ptsBinary Search can be categorized into which of the following?Brute Force techniqueDivide and conquerGreedy algorithmDynamic programming Question 142 ptsWhich of the following methods can be used to search an element ina linked list?Iterative linear searchIterative binary searchRecursive binary searchNormal binary searchQuestion 152 ptsConsider the array {1,1,1,1,1}. Select the wrong option?Iterative linear search can be used to search for theelements in the given arrayRecursive linear search can be used to search for theelements in the given arrayRecursive binary search can be used to search for theelements in the given arrayNo method is defined to search for an element in thegiven array