DOWNLOAD FREE PDF <<CLICK HERE>>
Data Structure Questions and AnswersBinary Search Iterative
Congratulations  you have completed Data Structure Questions and AnswersBinary Search Iterative.
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 6 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] 
What is the average case time complexity of binary search using recursion?
O(nlogn)  
O(logn)  
O(n)  
O(n^{2}) 
Question 6 Explanation:
T(n) = T(n/2) + 1, Using the divide and conquer master theorem.
Question 7 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] 
What are the applications of binary search?
To find the lower/upper bound in an ordered sequence  
Union of intervals  
Debugging  
All of the mentioned 
Question 7 Explanation:
All of the mentioned can be realized by binary search.
Question 8 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] 
Choose among the following code for an iterative binary search.
public static int iterative(int arr[], int key) { int low = 0; int mid = 0; int high = arr.length1; whil  
public static int iterative(int arr[], int key) { int low = 0; int mid = 0; int high = arr.length1; while  
public static int iterative(int arr[], int key) { int low = 0; int mid = 0; int high = arr.length
Binary Search can be categorized into which of the following?
Question 9 Explanation: Since 'mid' is calculated for every iteration or recursion, we are diving the array into half and then try to solve the problem.
Given an array arr = {5, 6, 77, 88, 99} and key = 88; How many iterations are done until the element is found?
Question 10 Explanation: Iteration1 : mid = 77; Iteration2 : mid = 88; Once you are finished, click the button below. Any items you have not completed will be marked incorrect. There are 10 questions to complete. Grab YOUR EBOOK
