Miscellaneous on Data Structures MCQ question and answer with solution Page-8 section-11

Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Section 8 Section 9 Section 10 Section 11 Section 12

71.
The problem of finding a path in a graph that visits every vertex exactly once is called?

A. Hamiltonian path problem

B. Hamiltonian cycle problem

C. Subset sum problem

D. Turnpike reconstruction problem

Answer & Solution Discuss in Board Save for Later

72.
Who formulated a straight forward backtracking scheme for stable marriage problem?

A. McVitie and Wilson

B. Gale

C. Ford and Fulkerson

D. Dinitz

Answer & Solution Discuss in Board Save for Later

73.
Which of the following is true according to Ramanujan's congruence?

A. No. of partitions are divisible by 5 for a number 3 more than a multiple of 5

B. No. of partitions are divisible by 5 for a number 4 more than a multiple of 5

C. No. of partitions are divisible by 5 for a number 2 more than a multiple of 5

D. No. of partitions are divisible by 5 for a number 1 more than a multiple of 5

Answer & Solution Discuss in Board Save for Later

74.

What is the output of the following code?

int fact(int n)
{
      if(n == 0)
        return 1;
      return n * fact(n - 1);
}
int main()
{
      int n = 5;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

A. 24

B. 120

C. 720

D. 1

Answer & Solution Discuss in Board Save for Later

75.
Which of the following is not true about set partition problem?

A. the recursive solution has a time complexity of O(2n)

B. there is no known solution that takes polynomial time

C. the recursive solution is slower than dynamic programming solution

D. the dynamic programming solution has a time complexity of O(n log n)

Answer & Solution Discuss in Board Save for Later

76.

Find the output of the following code.

#include <bits/stdc++.h> 
using namespace std; 
void crossP(int A[], int B[], int cross[]) 
{ 
	cross[0] = A[1] * B[2] - A[2] * B[1]; 
	cross[1] = A[0] * B[2] - A[2] * B[0]; 
	cross[2] = A[0] * B[1] - A[1] * B[0]; 
}
int main() 
{ 
	int A[] = { 1, 2, 4 }; 
	int B[] = { 2, 3, 2 }; 
	int cross[3]; 
	crossP(A, B, cross); 
	for (int i = 0; i < 3; i++) 
		cout << cross[i] << " "; 
	return 0; 
}

A. 1 2 5

B. -1 -5 -3

C. -6 -8 -1

D. -8 -6 -1

Answer & Solution Discuss in Board Save for Later

77.
What is the average case time complexity of quickselect?

A. O(n log n)

B. O(n²)

C. O(n)

D. O(log n)

Answer & Solution Discuss in Board Save for Later

78.
Which of the following is not a type of traditional cipher?

A. Substitution cipher

B. Transposition cipher

C. Mono alphabetic cipher

D. PKCS cipher

Answer & Solution Discuss in Board Save for Later

79.
Who was the first person to find the solution of Eight Queen Puzzle using determinant?

A. Max Bezzel

B. Frank Nauck

C. Gunther

D. Friedrich

Answer & Solution Discuss in Board Save for Later

80.
Vigenere cipher is harder to decipher than keyword cipher.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

71.
The problem of finding a path in a graph that visits every vertex exactly once is called?

Answer & Solution

72.
Who formulated a straight forward backtracking scheme for stable marriage problem?

Answer & Solution

73.
Which of the following is true according to Ramanujan's congruence?

Answer & Solution

74.
What is the output of the following code?

`int fact(int n) { if(n == 0) return 1; return n * fact(n - 1); } int main() { int n = 5; int ans = fact(n); printf("%d",ans); return 0; }`

Answer & Solution

75.
Which of the following is not true about set partition problem?

Answer & Solution

Answer & Solution

77.
What is the average case time complexity of quickselect?

Answer & Solution

78.
Which of the following is not a type of traditional cipher?

Answer & Solution

79.
Who was the first person to find the solution of Eight Queen Puzzle using determinant?

Answer & Solution

80.
Vigenere cipher is harder to decipher than keyword cipher.

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

71. The problem of finding a path in a graph that visits every vertex exactly once is called?

Answer & Solution

72. Who formulated a straight forward backtracking scheme for stable marriage problem?

Answer & Solution

73. Which of the following is true according to Ramanujan's congruence?

Answer & Solution

74. What is the output of the following code? int fact(int n) { if(n == 0) return 1; return n * fact(n - 1); } int main() { int n = 5; int ans = fact(n); printf("%d",ans); return 0; }

Answer & Solution

75. Which of the following is not true about set partition problem?

Answer & Solution

Answer & Solution

77. What is the average case time complexity of quickselect?

Answer & Solution

78. Which of the following is not a type of traditional cipher?

Answer & Solution

79. Who was the first person to find the solution of Eight Queen Puzzle using determinant?

Answer & Solution

80. Vigenere cipher is harder to decipher than keyword cipher.

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

71.
The problem of finding a path in a graph that visits every vertex exactly once is called?

72.
Who formulated a straight forward backtracking scheme for stable marriage problem?

73.
Which of the following is true according to Ramanujan's congruence?

74.
What is the output of the following code?

`int fact(int n) { if(n == 0) return 1; return n * fact(n - 1); } int main() { int n = 5; int ans = fact(n); printf("%d",ans); return 0; }`

75.
Which of the following is not true about set partition problem?

77.
What is the average case time complexity of quickselect?

78.
Which of the following is not a type of traditional cipher?

79.
Who was the first person to find the solution of Eight Queen Puzzle using determinant?

80.
Vigenere cipher is harder to decipher than keyword cipher.