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

21.

How many times will the function fibo() be called when the following code is executed?

int fibo(int n)
{
      if(n == 1)
         return 0;
      else if(n == 2)
        return 1;
      return fibo(n - 1) + fibo(n - 2);
}
int main()
{
     int n = 5;
     int ans = fibo(n);
     printf("%d",ans);
     return 0;
}

A. 5

B. 6

C. 8

D. 9

Answer & Solution Discuss in Board Save for Later

22.
Vigenere table consists of . . . . . . . .

A. 26 rows and 26 columns

B. 26 rows and 1 column

C. 1 row and 26 columns

D. 27 rows and 27 columns

Answer & Solution Discuss in Board Save for Later

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

A. {{2,1,3},{3,2,1},{3,1,2},{2,3,1},{1,2,3},{1,3,2}}

B. {{1,2,3},{1,3,2},{2,3,1},{2,1,3},{3,2,1},{3,1,2}}

C. {{1,2,3},{1,3,2},{2,1,3},{2,3,1},{3,1,2},{3,2,1}}

D. {{2,1,3},{3,1,2},{3,2,1},{2,3,1},{1,2,3},{1,3,2}}

Answer & Solution Discuss in Board Save for Later

24.
What is the computational complexity of Binary GCD algorithm where a and b are integers?

A. O (log a + log b)²)

B. O (log (a + b))

C. O (log ab)

D. O (log a-b)

Answer & Solution Discuss in Board Save for Later

25.
Chan's algorithm is used for computing . . . . . . . .

A. Closest distance between two points

B. Convex hull

C. Area of a polygon

D. Shortest path between two points

Answer & Solution Discuss in Board Save for Later

26.
Which of the following was the first diagram substitution cipher?

A. autokey cipher

B. hill cipher

C. one time pad cipher

D. playfair cipher

Answer & Solution Discuss in Board Save for Later

27.
In a graph, perfect matching exists only if the number of vertices is even.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

28.
Which of the following is used as signal duration in Morse Code?

A. Dash

B. Forward Slash

C. Apostrophe

D. Ampersand

Answer & Solution Discuss in Board Save for Later

29.
How many combinations of 2 elements will be formed from the array arr={1, 2, 3}?

A. 1

B. 2

C. 3

D. 4

Answer & Solution Discuss in Board Save for Later

30.
Minimum number of moves required to solve a tower of hanoi problem with n disks is . . . . . . . .

A. 2ⁿ

B. 2ⁿ-1

C. n²

D. n²-1

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

21.
How many times will the function fibo() be called when the following code is executed?

`int fibo(int n) { if(n == 1) return 0; else if(n == 2) return 1; return fibo(n - 1) + fibo(n - 2); } int main() { int n = 5; int ans = fibo(n); printf("%d",ans); return 0; }`

Answer & Solution

22.
Vigenere table consists of . . . . . . . .

Answer & Solution

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

Answer & Solution

24.
What is the computational complexity of Binary GCD algorithm where a and b are integers?

Answer & Solution

25.
Chan's algorithm is used for computing . . . . . . . .

Answer & Solution

26.
Which of the following was the first diagram substitution cipher?

Answer & Solution

27.
In a graph, perfect matching exists only if the number of vertices is even.

Answer & Solution

28.
Which of the following is used as signal duration in Morse Code?

Answer & Solution

29.
How many combinations of 2 elements will be formed from the array arr={1, 2, 3}?

Answer & Solution

30.
Minimum number of moves required to solve a tower of hanoi problem with n disks is . . . . . . . .

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

21. How many times will the function fibo() be called when the following code is executed? int fibo(int n) { if(n == 1) return 0; else if(n == 2) return 1; return fibo(n - 1) + fibo(n - 2); } int main() { int n = 5; int ans = fibo(n); printf("%d",ans); return 0; }

Answer & Solution

22. Vigenere table consists of . . . . . . . .

Answer & Solution

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

Answer & Solution

24. What is the computational complexity of Binary GCD algorithm where a and b are integers?

Answer & Solution

25. Chan's algorithm is used for computing . . . . . . . .

Answer & Solution

26. Which of the following was the first diagram substitution cipher?

Answer & Solution

27. In a graph, perfect matching exists only if the number of vertices is even.

Answer & Solution

28. Which of the following is used as signal duration in Morse Code?

Answer & Solution

29. How many combinations of 2 elements will be formed from the array arr={1, 2, 3}?

Answer & Solution

30. Minimum number of moves required to solve a tower of hanoi problem with n disks is . . . . . . . .

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

21.
How many times will the function fibo() be called when the following code is executed?

`int fibo(int n) { if(n == 1) return 0; else if(n == 2) return 1; return fibo(n - 1) + fibo(n - 2); } int main() { int n = 5; int ans = fibo(n); printf("%d",ans); return 0; }`

22.
Vigenere table consists of . . . . . . . .

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

24.
What is the computational complexity of Binary GCD algorithm where a and b are integers?

25.
Chan's algorithm is used for computing . . . . . . . .

26.
Which of the following was the first diagram substitution cipher?

27.
In a graph, perfect matching exists only if the number of vertices is even.

28.
Which of the following is used as signal duration in Morse Code?

29.
How many combinations of 2 elements will be formed from the array arr={1, 2, 3}?

30.
Minimum number of moves required to solve a tower of hanoi problem with n disks is . . . . . . . .