Miscellaneous on Data Structures MCQ question and answer with solution

Home / Data Structure / Miscellaneous On Data Structures

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

61.
Running key cipher is an example of . . . . . . . .

A. mono-alphabetic cipher

B. poly-alphabetic cipher

C. transposition cipher

D. additive cipher

Answer & Solution Discuss in Board Save for Later

62.
All the graphs have a dominating set of vertices.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

63.
What will be the ciphered text corresponding to "EXAMPLE" if gronsfeld cipher is used for encryption with key as "1234"?

A. FZDQQNH

B. HNQQDZF

C. QNHFZDQ

D. QQNHDZF

Answer & Solution Discuss in Board Save for Later

64.
The result of the fractional knapsack is greater than or equal to 0/1 knapsack.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

65.
Which of the following is the time complexity of finding n^th Catalan numbers using binomial coefficient?

A. O(n)

B. O(n²)

C. O(1)

D. O(log n²)

Answer & Solution Discuss in Board Save for Later

66.
What will be the plain text corresponding to ciphered text "|_ _| >" if pigpen cipher is used for encryption?

A. cat

B. hat

C. dog

D. rat

Answer & Solution Discuss in Board Save for Later

67.

What is the time complexity of the following iterative method used to find the sum of the first n natural numbers?

#include<stdio.h>
int get_sum(int n)
{
      int sm, i;
      for(i = 1; i <= n; i++)
        sm += i;
      return sm;
}
int main()
{
    int n = 10;
    int ans = get_sum(n);
    printf("%d",ans);
    return 0;
}

A. O(1)

B. O(n)

C. O(n²)

D. O(n³)

Answer & Solution Discuss in Board Save for Later

68.
How many colours are used in a bipartite graph?

A. 1

B. 2

C. 3

D. 4

Answer & Solution Discuss in Board Save for Later

69.
Which among the following best represents the time complexity to find articulate points in a graph?

A. O(V)

B. O(E)

C. O(V + E)

D. O(V * E)

Answer & Solution Discuss in Board Save for Later

70.
LCM is also called as . . . . . . . .

A. GCD

B. SCM

C. GCF

D. HCF

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

61.
Running key cipher is an example of . . . . . . . .

Answer & Solution

62.
All the graphs have a dominating set of vertices.

Answer & Solution

63.
What will be the ciphered text corresponding to "EXAMPLE" if gronsfeld cipher is used for encryption with key as "1234"?

Answer & Solution

64.
The result of the fractional knapsack is greater than or equal to 0/1 knapsack.

Answer & Solution

65.
Which of the following is the time complexity of finding n^th Catalan numbers using binomial coefficient?

Answer & Solution

66.
What will be the plain text corresponding to ciphered text "|_ _| >" if pigpen cipher is used for encryption?

Answer & Solution

67.
What is the time complexity of the following iterative method used to find the sum of the first n natural numbers?

`#include<stdio.h> int get_sum(int n) { int sm, i; for(i = 1; i <= n; i++) sm += i; return sm; } int main() { int n = 10; int ans = get_sum(n); printf("%d",ans); return 0; }`

Answer & Solution

68.
How many colours are used in a bipartite graph?

Answer & Solution

69.
Which among the following best represents the time complexity to find articulate points in a graph?

Answer & Solution

70.
LCM is also called as . . . . . . . .

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

61. Running key cipher is an example of . . . . . . . .

Answer & Solution

62. All the graphs have a dominating set of vertices.

Answer & Solution

63. What will be the ciphered text corresponding to "EXAMPLE" if gronsfeld cipher is used for encryption with key as "1234"?

Answer & Solution

64. The result of the fractional knapsack is greater than or equal to 0/1 knapsack.

Answer & Solution

65. Which of the following is the time complexity of finding nth Catalan numbers using binomial coefficient?

Answer & Solution

66. What will be the plain text corresponding to ciphered text "|_ _| >" if pigpen cipher is used for encryption?

Answer & Solution

67. What is the time complexity of the following iterative method used to find the sum of the first n natural numbers? #include<stdio.h> int get_sum(int n) { int sm, i; for(i = 1; i <= n; i++) sm += i; return sm; } int main() { int n = 10; int ans = get_sum(n); printf("%d",ans); return 0; }

Answer & Solution

68. How many colours are used in a bipartite graph?

Answer & Solution

69. Which among the following best represents the time complexity to find articulate points in a graph?

Answer & Solution

70. LCM is also called as . . . . . . . .

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

61.
Running key cipher is an example of . . . . . . . .

62.
All the graphs have a dominating set of vertices.

63.
What will be the ciphered text corresponding to "EXAMPLE" if gronsfeld cipher is used for encryption with key as "1234"?

64.
The result of the fractional knapsack is greater than or equal to 0/1 knapsack.

65.
Which of the following is the time complexity of finding n^th Catalan numbers using binomial coefficient?

66.
What will be the plain text corresponding to ciphered text "|_ _| >" if pigpen cipher is used for encryption?

67.
What is the time complexity of the following iterative method used to find the sum of the first n natural numbers?

`#include<stdio.h> int get_sum(int n) { int sm, i; for(i = 1; i <= n; i++) sm += i; return sm; } int main() { int n = 10; int ans = get_sum(n); printf("%d",ans); return 0; }`

68.
How many colours are used in a bipartite graph?

69.
Which among the following best represents the time complexity to find articulate points in a graph?

70.
LCM is also called as . . . . . . . .