download Mastguru Android App

Question Detail

A linear list from which elements can be added or removed from either end is called

  • stack
  • queue
  • deque
  • tree
Similar Questions :

1. Which sorting method is slowest

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

2. Which data structure is needed to convert infix notations to postfix notations

  • linear list
  • tree
  • stack
  • queue

3. Which is problem oriented language

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

4. ++i is equivalent to

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

5. The complexity of linear search algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment

  • The Woodlands Tree Removal 11 years ago

    deque is the answer of the question,