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

11.
How many printable characters does the ASCII character set consists of?

A. 120

B. 128

C. 100

D. 98

Answer & Solution Discuss in Board Save for Later

12.
Which algorithm is the most efficient numerical algorithm to obtain lcm?

A. Euler's Algorithm

B. Euclid's Algorithm

C. Chebyshev Function

D. Partial Division Algorithm

Answer & Solution Discuss in Board Save for Later

13.
From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?

A. 5

B. 4

C. 3

D. 2

Answer & Solution Discuss in Board Save for Later

14.

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 = 1;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

A. 0

B. 1

C. 2

D. 3

Answer & Solution Discuss in Board Save for Later

15.
Which among the following is the eulerian tour for the graph given below?

A. ABCDEC

B. ABCECBA

C. ACEDCA

D. ABCEDCA

Answer & Solution Discuss in Board Save for Later

16.
Under what case of Master's theorem will the recurrence relation of stooge sort fall?

A. 1

B. 2

C. 3

D. It cannot be solved using master's theorem

Answer & Solution Discuss in Board Save for Later

17.
Which of the following is not an application of topological sorting?

A. Finding prerequisite of a task

B. Finding Deadlock in an Operating System

C. Finding Cycle in a graph

D. Ordered Statistics

Answer & Solution Discuss in Board Save for Later

18.
Which graph has a size of minimum vertex cover equal to maximum matching?

A. Cartesian

B. Tree

C. Heap

D. Bipartite

Answer & Solution Discuss in Board Save for Later

19.
Consider the given page reference string 6, 1, 0, 3, 1, 2, 1, 5, 3, 2, 0, 1, 3. How many page faults will occur if the program has 4-page frames available to it and it uses the least recently used algorithm?

A. 6

B. 7

C. 8

D. 9

Answer & Solution Discuss in Board Save for Later

20.
What is the rule for encryption in playfair cipher if the letters in a pair appear in same row?

A. they are replaced by the letter appearing immediately below them respectively

B. they are replaced by the letter appearing immediately right to them respectively

C. they are replaced by the letter at the corner of the row

D. that pair is neglected

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

11.
How many printable characters does the ASCII character set consists of?

Answer & Solution

12.
Which algorithm is the most efficient numerical algorithm to obtain lcm?

Answer & Solution

13.
From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?

Answer & Solution

14.
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 = 1; int ans = fact(n); printf("%d",ans); return 0; }`

Answer & Solution

15.
Which among the following is the eulerian tour for the graph given below?

Answer & Solution

16.
Under what case of Master's theorem will the recurrence relation of stooge sort fall?

Answer & Solution

17.
Which of the following is not an application of topological sorting?

Answer & Solution

18.
Which graph has a size of minimum vertex cover equal to maximum matching?

Answer & Solution

19.
Consider the given page reference string 6, 1, 0, 3, 1, 2, 1, 5, 3, 2, 0, 1, 3. How many page faults will occur if the program has 4-page frames available to it and it uses the least recently used algorithm?

Answer & Solution

20.
What is the rule for encryption in playfair cipher if the letters in a pair appear in same row?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

11. How many printable characters does the ASCII character set consists of?

Answer & Solution

12. Which algorithm is the most efficient numerical algorithm to obtain lcm?

Answer & Solution

13. From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?

Answer & Solution

14. 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 = 1; int ans = fact(n); printf("%d",ans); return 0; }

Answer & Solution

15. Which among the following is the eulerian tour for the graph given below?

Answer & Solution

16. Under what case of Master's theorem will the recurrence relation of stooge sort fall?

Answer & Solution

17. Which of the following is not an application of topological sorting?

Answer & Solution

18. Which graph has a size of minimum vertex cover equal to maximum matching?

Answer & Solution

19. Consider the given page reference string 6, 1, 0, 3, 1, 2, 1, 5, 3, 2, 0, 1, 3. How many page faults will occur if the program has 4-page frames available to it and it uses the least recently used algorithm?

Answer & Solution

20. What is the rule for encryption in playfair cipher if the letters in a pair appear in same row?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

11.
How many printable characters does the ASCII character set consists of?

12.
Which algorithm is the most efficient numerical algorithm to obtain lcm?

13.
From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?

14.
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 = 1; int ans = fact(n); printf("%d",ans); return 0; }`

15.
Which among the following is the eulerian tour for the graph given below?

16.
Under what case of Master's theorem will the recurrence relation of stooge sort fall?

17.
Which of the following is not an application of topological sorting?

18.
Which graph has a size of minimum vertex cover equal to maximum matching?

19.
Consider the given page reference string 6, 1, 0, 3, 1, 2, 1, 5, 3, 2, 0, 1, 3. How many page faults will occur if the program has 4-page frames available to it and it uses the least recently used algorithm?

20.
What is the rule for encryption in playfair cipher if the letters in a pair appear in same row?