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

81.
Which is the smallest number of 3 digits that is divisible by 2, 4, 8?

A. 100

B. 102

C. 116

D. 104

Answer & Solution Discuss in Board Save for Later

82.

What will be the output for following code?

#include<stdio.h> 
int func(int x,  int y) 
{ 
	if (y == 0) 
		return 1; 
	else if (y%2 == 0) 
		return func(x, y/2)*func(x, y/2); 
	else
		return x*func(x, y/2)*func(x, y/2); 
} 
int main() 
{ 
	int x = 2; 
    int y = 3; 
 
	printf("%d", func(x, y)); 
	return 0; 
}

A. 9

B. 6

C. 8

D. 5

Answer & Solution Discuss in Board Save for Later

83.

What is the output of the following code?

#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. 55

B. 45

C. 35

D. Depends on compiler

Answer & Solution Discuss in Board Save for Later

84.
The shortest distance between a line and a point is achieved when?

A. a line is drawn at 90 degrees to the given line from the given point

B. a line is drawn at 180 degrees to the given line from the given point

C. a line is drawn at 60 degrees to the given line from the given point

D. a line is drawn at 270 degrees to the given line from the given point

Answer & Solution Discuss in Board Save for Later

85.
Which of the following is not a transposition cipher?

A. rail fence cipher

B. gronsfeld cipher

C. hill cipher

D. route cipher

Answer & Solution Discuss in Board Save for Later

86.
What is the running time of Dinic's blocking flow algorithm?

A. O(V²E)

B. O(VE²)

C. O(V³)

D. O(E max |f|)

Answer & Solution Discuss in Board Save for Later

87.
Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

A. Bipartite

B. Complete Bipartite

C. Cartesian

D. Pie

Answer & Solution Discuss in Board Save for Later

88.
The greedy algorithm can find a minimal vertex cover in polynomial time for which among the following?

A. Tree graphs

B. Bipartite graphs

C. Hypercube

D. Clique graphs

Answer & Solution Discuss in Board Save for Later

89.
Under what case of Master's theorem will the recurrence relation of binary search fall?

A. 1

B. 2

C. 3

D. It cannot be solved using master's theorem

Answer & Solution Discuss in Board Save for Later

90.
What is meant by integer partition?

A. representing an integer as sum of positive and negative real numbers

B. representing an integer as sum of positive and negative integers

C. representing an integer as sum of positive integers

D. representing an integer as sum of positive real numbers

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

81.
Which is the smallest number of 3 digits that is divisible by 2, 4, 8?

Answer & Solution

82.
What will be the output for following code?

`#include<stdio.h> int func(int x, int y) { if (y == 0) return 1; else if (y%2 == 0) return func(x, y/2)func(x, y/2); else return xfunc(x, y/2)*func(x, y/2); } int main() { int x = 2; int y = 3; printf("%d", func(x, y)); return 0; }`

Answer & Solution

83.
What is the output of the following code?

`#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

84.
The shortest distance between a line and a point is achieved when?

Answer & Solution

85.
Which of the following is not a transposition cipher?

Answer & Solution

86.
What is the running time of Dinic's blocking flow algorithm?

Answer & Solution

87.
Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

Answer & Solution

88.
The greedy algorithm can find a minimal vertex cover in polynomial time for which among the following?

Answer & Solution

89.
Under what case of Master's theorem will the recurrence relation of binary search fall?

Answer & Solution

90.
What is meant by integer partition?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

81. Which is the smallest number of 3 digits that is divisible by 2, 4, 8?

Answer & Solution

82. What will be the output for following code? #include<stdio.h> int func(int x, int y) { if (y == 0) return 1; else if (y%2 == 0) return func(x, y/2)*func(x, y/2); else return x*func(x, y/2)*func(x, y/2); } int main() { int x = 2; int y = 3; printf("%d", func(x, y)); return 0; }

Answer & Solution

83. What is the output of the following code? #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

84. The shortest distance between a line and a point is achieved when?

Answer & Solution

85. Which of the following is not a transposition cipher?

Answer & Solution

86. What is the running time of Dinic's blocking flow algorithm?

Answer & Solution

87. Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

Answer & Solution

88. The greedy algorithm can find a minimal vertex cover in polynomial time for which among the following?

Answer & Solution

89. Under what case of Master's theorem will the recurrence relation of binary search fall?

Answer & Solution

90. What is meant by integer partition?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

81.
Which is the smallest number of 3 digits that is divisible by 2, 4, 8?

82.
What will be the output for following code?

`#include<stdio.h> int func(int x, int y) { if (y == 0) return 1; else if (y%2 == 0) return func(x, y/2)func(x, y/2); else return xfunc(x, y/2)*func(x, y/2); } int main() { int x = 2; int y = 3; printf("%d", func(x, y)); return 0; }`

83.
What is the output of the following code?

`#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; }`

84.
The shortest distance between a line and a point is achieved when?

85.
Which of the following is not a transposition cipher?

86.
What is the running time of Dinic's blocking flow algorithm?

87.
Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

88.
The greedy algorithm can find a minimal vertex cover in polynomial time for which among the following?

89.
Under what case of Master's theorem will the recurrence relation of binary search fall?

90.
What is meant by integer partition?