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

Answer: Option B

Similar Questions :

1. The memory address of the first element of an array is called

  • floor address
  • first address
  • foundation address
  • base address

Answer: Option D

2. The complexity of Bubble sort algorithm is

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

Answer: Option C

3. The complexity of linear search algorithm is

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

Answer: Option A

4. Which sorting method is slowest

  • Quick sort
  • Heap sort
  • Shell sort
  • Bubble sort

Answer: Option D

5. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

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

Mastguru Youtube Channel

Videos @mastguru

Free useful videos - Subscribe Mastguru
 

Get Free Current Affairs and Govt Jobs Alerts in your mailbox

To Appreciate Our Effort, Please Like Us

Quantitative Aptitude
English Aptitude
Reasoning Aptitude
Computer Awareness
General Knowledge
Current Affairs
IT Officer Aptitude
Programming Aptitude
Latest Govt Jobs