download Mastguru Android App

Question Detail

minimum number of stacks of size n required to implement a queue of size n

  • One
  • Two
  • Three
  • Four
Similar Questions :

1. ++i is equivalent to

  • i = i + 2
  • i = i + 1
  • i = i + i
  • i = i - 1

2. Which is problem oriented language

  • BASIC
  • PL/I
  • FORTRAN
  • none of above

3. The complexity of Binary search algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

4. Merge sort uses

  • Divide and conquer strategy
  • Backtracking approach
  • Heuristic search
  • Greedy approach

5. How many divisions are there in COBOL language

  • Two
  • Three
  • Four
  • Five
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment

  • ak 11 years ago

    How? Please explain.

  • usman 11 years ago

    2 stacks

  • Manish K Verma 11 years ago

    Two Stack required