Jobs By Abekus

Algorithms Questions Set 9:

Quiz Mode

Best Case Time Complexity for BInary Search Algoritm is

O(n)

O(1)

O(log n)

None of Above

Solution:

What is the auxiliary space requirement of exponential search when used with iterative binary search?

O(1)

O(n)

O(n log n)

O(log n)

Solution:

Which of the following problems can't be solved using recursion?

Factorial of a number

Length of a string

Nth Fibonacci number

Problems without a base case

Solution:

What is the need for a circular queue?

to delete elements based on priority

implement LIFO principle in queues

easier computations

effective usage of memory

Solution:

When is a binary search algorithm best applied?

When the search element is at the first place

When the search element is at the last place

When the search element is at the middle place

Solution:

What is the correct statement when the corresponding end bracket/braces/parentheses are not found?

Ignore the parentheses

The stack is popped

It is treated as an exception

An error is reported

Solution:

What sorting network always gives monotonically increasing or decreasing sequences even when the input is monotonically increasing, decreasing or both?

Bitonic

Ditonic

Singleton

None of the above

Solution:

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b] ? Assume that the number of reported elements is k.

O(log n)

O(log(n) + k)

O(k log n)

O(n log k)

Solution:

If n is the length of the text (t) and m is the length of the pattern (q), identify the correct pre-processing algorithm. (where p is a suitable modulus to reduce the complexity)

q = 0; T0 = 0;

for k=1 to m do T0 = (dT0 + q[k]) mod p p = (dp + T[i]) mod q

for k=1 to m do q = (dq + q[k]) mod p T0 = (dT0 + t[k]) mod p

for k=1 to m do q = (dq + q[k]) mod p t0 = (dT0 + t[k]) mod p

for k=1 to m do p = (dq + q[k]) mod p T0 = (dT0 + t[k]) mod p

Solution:

Consider the following C program that attempts to locate an element x in an array Y[] using binary search. The program is erroneous.

`1. f(int Y[10], int x) { 2. int i, j, k; 3. i = 0; j = 9; 4. do { 5. k = (i + j) / 2; 6. if (Y[k] < x) i = k + 1; else j = k; 7. } while (Y[k] != x && i < j); 8. if (Y[k] == x) printf("x is in the array"); 9. else printf("x is not in the array"); 10. }`

Y is [1 2 3 4 5 6 7 8 9 10] and x < 10

Y is [1 3 5 7 9 11 13 15 17 19] and x < 1

Y is [2 2 2 2 2 2 2 2 2 2] and x > 2

Y is [2 4 6 8 10 12 14 16 18 20] and 2 < x < 20 and x is even

Algorithms Questions Set 9:

Best Case Time Complexity for BInary Search Algoritm is

Solution:

What is the auxiliary space requirement of exponential search when used with iterative binary search?

Solution:

Which of the following problems can't be solved using recursion?

Solution:

What is the need for a circular queue?

Solution:

When is a binary search algorithm best applied?

Solution:

What is the correct statement when the corresponding end bracket/braces/parentheses are not found?

Solution:

What sorting network always gives monotonically increasing or decreasing sequences even when the input is monotonically increasing, decreasing or both?

Solution:

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b] ? Assume that the number of reported elements is k.

Solution:

If n is the length of the text (t) and m is the length of the pattern (q), identify the correct pre-processing algorithm. (where p is a suitable modulus to reduce the complexity)

q = 0; T0 = 0;

Solution:

Solution:

Related Question Sets:

Related Topics:

Algorithms Questions Set 9:

Best Case Time Complexity for BInary Search Algoritm is

Solution:

What is the auxiliary space requirement of exponential search when used with iterative binary search?

Solution:

Which of the following problems can't be solved using recursion?

Solution:

What is the need for a circular queue?

Solution:

When is a binary search algorithm best applied?

Solution:

What is the correct statement when the corresponding end bracket/braces/parentheses are not found?

Solution:

What sorting network always gives monotonically increasing or decreasing sequences even when the input is monotonically increasing, decreasing or both?

Solution:

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a,b] ? Assume that the number of reported elements is k.

Solution:

If n is the length of the text (t) and m is the length of the pattern (q), identify the correct pre-processing algorithm. (where p is a suitable modulus to reduce the complexity) q = 0; T0 = 0;

Solution:

Solution:

Related Question Sets:

Related Topics:

If n is the length of the text (t) and m is the length of the pattern (q), identify the correct pre-processing algorithm. (where p is a suitable modulus to reduce the complexity)

q = 0; T0 = 0;