A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Practice library for exams, subjects, and daily revision. For learning purposes only.

ObjectiveMcq

Print Protected

Printing this content is disabled

This page is protected for print. Use the website to view the content.

For any array, given that at most one element is non-zero, i - Practice - ObjectiveMcq

For any array, given that at most one element is non-zero, it is ALWAYS possible to reach the end of the array using minimum jumps.

Correct Answer: B — False

Consider the array {1,0,2,3,4}.

In this case, only one element is 0 but it is not possible to reach the end of the array.

Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
Which of the following is a sub string of "SANFOUNDRY"?
The naive pattern searching algorithm is an in place algorithm.
What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
What is the recurrence relation for the linear search recursive algorithm?
Can linear search recursive algorithm and binary search recursive algorithm be performed on an unordered list?