gs gs122 Recursion - Search an Element in an Array using Recursion - Quiz No.2
gs gs122 Data Communication and Computer Network Quiz
This quiz belongs to book/course code gs gs122 Data Communication and Computer Network of gs organization. We have 268 quizzes available related to the book/course Data Communication and Computer Network. This quiz has a total of 8 multiple choice questions (MCQs) to prepare and belongs to topic Recursion. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: What does the following code do?
#include<stdio.h> int cnt = 0; int recursive_search_num(int *arr, int num, int idx, int len) { int cnt = 0; if(idx == len) return cnt; if(arr[idx] == num) cnt++; return cnt + recursive_search_num(arr, num, idx+1, len); } int main() { int arr[8] ={0,0,0,0,3,5,-6,7},num = 0,len = 8; int ans = recursive_search_num(arr,num,0,len); printf("%d",ans); return 0; }
Adds all the indexes of the number 0
Finds the first last occurrence of the number 0
Counts the number of occurrences of the number 0
None of the mentioned
Question 3: What is the output of the following code?
#include<stdio.h> int recursive_binary_search(int *arr, int num, int lo, int hi) { if(lo > hi) return -1; int mid = (lo + hi)/2; if(arr[mid] == num) return mid; else if(arr[mid] < num) lo = mid + 1; else hi = mid - 1; return recursive_binary_search(arr, num, lo, hi); } int main() { int arr[8] = {1,2,3,4,5,6,7,8},num = 7,len = 8; int indx = recursive_binary_search(arr,num,0,len-1); printf("Index of %d is %d",num,indx); return 0; }
Index of 7 is 4
Index of 7 is 5
Index of 7 is 6
Index of 7 is 7
Question 4: What is the output of the following code?
#include<stdio.h> int recursive_binary_search(int *arr, int num, int lo, int hi) { if(lo > hi) return -1; int mid = (lo + hi)/2; if(arr[mid] == num) return mid; else if(arr[mid] < num) lo = mid + 1; else hi = mid - 1; return recursive_binary_search(arr, num, lo, hi); } int main() { int arr[8] = {0,0,0,0,3,5,6,7},num = 0,len = 8; int indx = recursive_binary_search(arr,num,0,len-1); printf("Index of %d is %d",num,indx); return 0; }
Index of 0 is 0
Index of 0 is 1
Index of 0 is 2
Index of 0 is 3
Question 5: What is the time complexity of the above recursive implementation of binary search?
O(n)
O(2n)
O(logn)
O(n!)
Question 6: In which of the below cases will the following code produce a wrong output?
int recursive_binary_search(int *arr, int num, int lo, int hi) { if(lo > hi) return -1; int mid = (lo + hi)/2; if(arr[mid] == num) return mid; else if(arr[mid] < num) lo = mid + 1; else hi = mid - 1; return recursive_binary_search(arr, num, lo, hi); }
Array: {0,0,0,0,0,0} Search: -10
Array: {1,2,3,4,5} Search: 0
Array: {5,4,3,2,1} Search: 1
Array: {-5,-4,-3,-2,-1} Search: -1
Question 8: What is the output of the following code?
#include<stdio.h> int recursive_binary_search(int *arr, int num, int lo, int hi) { if(lo > hi) return -1; int mid = (lo + hi)/2; if(arr[mid] == num) return mid; else if(arr[mid] < num) lo = mid + 1; else hi = mid - 1; return recursive_binary_search(arr, num, lo, hi); } int main() { int arr[5] = {5,4,3,2,1},num = 1,len = 5; int indx = recursive_binary_search(arr,num,0,len-1); printf("Index of %d is %d",num,indx); return 0; }
Index of 1 is 4
Index of 1 is 5
Index of 1 is -1
Index of 1 is 0
Online Quizzes of gs122 Data Communication and Computer Network
Sorting - Insertion Sort - Quiz No.1
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - Insertion Sort - Quiz No.2
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - Insertion Sort - Quiz No.3
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - LSD Radix Sort - Quiz No.1
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - MSD Radix Sort - Quiz No.1
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - MSD Radix Sort - Quiz No.2
gs gs122
Data Communication and Computer Network Online Quizzes
