Substring Searching Algorithm Quiz Online Practice Test

1. Which of these is a substring of “SANFOUNDRY”?

SANO

FOUND

SAND

FOND

2. What will the following code output?

#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;
}

3. What is the worst-case time complexity 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;
}

O(n)

O(m)

O(m * n)

O(m + n)

4. What is the auxiliary space complexity 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;
}

O(n)

O(1)

O(log n)

O(m)

5. In the KMP algorithm for pattern matching, what is the worst-case time complexity, with m representing the length of the text and n the length of the pattern?

O(n)

O(n * m)

O(m)

O(n)

6. What is the best-case time complexity 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;
}

O(n)

O(m)

O(m * n)

O(m + n)

7. What is the time complexity of the Z algorithm for searching a pattern of length n in a text of length m?

O(n + m)

O(m)

O(n)

O(m * n)

8. What is the auxiliary space complexity of the Z algorithm when searching for a pattern of length n in a text of length m?

O(n + m)

O(m)

O(n)

O(m * n)

9. The naive pattern searching algorithm is an in-place algorithm.

True

False

Not applicable

Depends on the implementation

10. Rabin-Karp algorithm and naive pattern searching algorithm have the same worst-case time complexity.

True

False

Not applicable

Only if the pattern length is zero

Test Name:	Substring Searching Algorithm Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	10 / 10
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Substring Searching Algorithm MCQ Quiz Online Practice Test