Section A: Multiple Choice Questions : Q1: Consider searching element 45 using binary search in an array A [ ] = { 23, 34, 45, 67, 78, 54, 87, 91 }. The returned index would be a) Index [0] b) Index [2] c) Index [3] d) None of these Q2: In the context of recursive search a) Recursion terminates when the item is found b) Same function is called again and again c) Slower than iterative search d) All options are correct Q3: Which one of the following is an approach for a systematic trial and error to search an item? a) Binary search b) Backtracking c) Recursion d) Iteration
Section A: Multiple Choice Questions : Q1: Consider searching element 45 using binary search in an array A [ ] = { 23, 34, 45, 67, 78, 54, 87, 91 }. The returned index would be a) Index [0] b) Index [2] c) Index [3] d) None of these Q2: In the context of recursive search a) Recursion terminates when the item is found b) Same function is called again and again c) Slower than iterative search d) All options are correct Q3: Which one of the following is an approach for a systematic trial and error to search an item? a) Binary search b) Backtracking c) Recursion d) Iteration
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 18PE
Related questions
Question
Section A: Multiple Choice Questions :
Q1: Consider searching element 45 using binary search in an array A [ ] = { 23, 34, 45, 67, 78, 54, 87, 91 }. The returned index would be
a) Index [0]
b) Index [2]
c) Index [3]
d) None of these
Q2: In the context of recursive search
a) Recursion terminates when the item is found
b) Same function is called again and again
c) Slower than iterative search
d) All options are correct
Q3: Which one of the following is an approach for a systematic trial and error to search an item?
a) Binary search
b) Backtracking
c) Recursion
d) Iteration
Q4: In terms of time efficiency, the following method is ____.
public int function(int n) {
int result = 1; for (int k = 1; k returnType methodName(methodParameters)
c) methodModifiers returnType methodName (methodParameters)
d) methodModifiers returnType methodName(methodParameters)
Q8: Given a function f(n) = n2 + 20n on an input parameter n, which of the following is true
a) f(n)=O(1)
b) f(n)=O(n)
c) f(n)=O(logn)
d) f(n)=O(n3)
Q9: A normal queue, if implemented using an array of size MAX_SIZE, gets full when-
a) Rear = MAX_SIZE – 1
b) Front = (rear + 1)mod MAX_SIZE
c) Front = rear + 1
d) Rear = front
Q10: Consider the given function. The function grows at a __________ rate
public static int search(int[] x, int target) {
for(int i=0; i < x.length; i++) { if (x[i]==target) return i; }
return -1; // target not found
}
a) Constant
b) Logarithm
c) Linear
d) Quadratic
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning