21. What is the auxiliary space requirement of an exponential sort when used with iterative binary search?
22. Jump search has a better time complexity than the exponential search.
23. In which of the following case jump search will be preferred over exponential search?
24. What will be the output of the following code?
#include<bits/stdc++.h>
using namespace std;
void func(char* str2, char* str1)
{
int m = strlen(str2);
int n = strlen(str1);
for (int i = 0; i <= n - m; i++)
{
int j;
for (j = 0; j < m; j++)
if (str1[i + j] != str2[j])
break;
if (j == m)
cout << i << endl;
}
}
int main()
{
char str1[] = "1253234";
char str2[] = "323";
func(str2, str1);
return 0;
}
#include<bits/stdc++.h>
using namespace std;
void func(char* str2, char* str1)
{
int m = strlen(str2);
int n = strlen(str1);
for (int i = 0; i <= n - m; i++)
{
int j;
for (j = 0; j < m; j++)
if (str1[i + j] != str2[j])
break;
if (j == m)
cout << i << endl;
}
}
int main()
{
char str1[] = "1253234";
char str2[] = "323";
func(str2, str1);
return 0;
}25. Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
26. Which of the following searching algorithm is used with exponential sort after finding the appropriate range?
27. Which of the following is not an alternate name of exponential search?
28. The array is as follows: 1, 2, 3, 6, 8, 10. At what time the element 6 is found? (By using linear search(recursive) algorithm)
29. Choose the recursive formula for the Fibonacci series.(n>=1)
30. Given an array arr = {45, 77, 89, 90, 94, 99, 100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
Read More Section(Searching Algorithms)
Each Section contains maximum 100 MCQs question on Searching Algorithms. To get more questions visit other sections.