Data Structure II Mock Test 4

10%

Question 1 of 10

1. Compute the product matrix using Strassen’s matrix multiplication algorithm.
Given a11=1; a12=3;a21=5;a22=7
b11=8;b12=4;b21=6;b22=2

c11=15;c12=7;c21=80;c22=34

c11=20;c12=12;c21=100;c22=15

c11=26;c12=10;c21=82;c22=34

c11=22;c12=8;c21=90;c22=32

Question 1 of 10

Question 2 of 10

2. Who invented Euclid’s algorithm?

Euclid

Gabriel lame

Sieve

Euclid-Sieve

Question 2 of 10

Question 3 of 10

3. Number of elements in the power set of set S={1,2,3} will be?

Question 3 of 10

Question 4 of 10

4. Which of the following strategies does the following diagram depict?

Brute force

Backtracking

Divide and conquer strategy

Exhaustive search

Question 4 of 10

Question 5 of 10

5. What is the time complexity of the Quick search algorithm?

O(n)

O(log n)

O(mn)

O(m+n)

Question 5 of 10

Question 6 of 10

6. Which of the following is a possible result of depth first traversal of the given graph(consider 1 to be source element)?

1 4 5 3 2

1 4 5 1 2 3

1 2 3 4 5

1 2 3 1 4 5

Question 6 of 10

Question 7 of 10

7. Which of the following data structure is used to implement DFS?

linked list

tree

queue

stack

Question 7 of 10

Question 8 of 10

8. Which of the following code will give an error?

#include <stdlib.h> 
int main() 
{ 
     srand(1); 
     return 0; 
}

#include <stdlib.h> 
int main() 
{ 
     srand(time(0)); 
     printf("%d\n", rand()%50); 
     return 0; 
}

#include <stdlib.h> 
int main() 
{ 
     printf("%d\n", srand()); 
     return 0; 
}

#include <stdlib.h> 
int main() 
{
     printf("%d\n", rand()%50); 
     return 0; 
}

Question 8 of 10

Question 9 of 10

9. ____________ is one of the most useful principles of enumeration in combinationatorics and discrete probability.

Quick search algorithm

Inclusion-exclusion principle

Set theory

Euclid's algorithm

Question 9 of 10

Question 10 of 10

10. What will be the lexicographical order of permutations formed from the array arr={1,2,3}?

{{2,1,3},{3,1,2},{3,2,1},{2,3,1},{1,2,3},{1,3,2}}

{{1,2,3},{1,3,2},{2,3,1},{2,1,3},{3,2,1},{3,1,2}}

{{2,1,3},{3,2,1},{3,1,2},{2,3,1},{1,2,3},{1,3,2}}

{{1,2,3},{1,3,2},{2,1,3},{2,3,1},{3,1,2},{3,2,1}}

Question 10 of 10