Home

A data structure where elements can be added or removed at either end but not in the middle

A. Linked lists

B. Stacks

C. Queues

D. Deque

Related Questions

  1. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  2. For an algorithm the complexity of the average case is
  3. Which of the following data structure cant store the non-homogeneous data elements?
  4. The situation when in a linked list START=NULL is
  5. Which of the following is not the required condition for binary search algorithm?
  6. In linear search algorithm the Worst case occurs when
  7. _______ level is where the model becomes compatible executable code
  8. Which of the following data structures are indexed structures?
  9. Which of the following name does not relate to stacks?
  10. Herder node is used as sentinel in ____
  11. Which one of the following permutations can be obtained the output using stack assuming that the input…
  12. Linked lists are best suited
  13. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  14. The difference between linear array and a record is
  15. Stack is also called as
  16. Which data structure is used in breadth first search of a graph to hold nodes?
  17. If the values of a variable in one module is indirectly changed by another module, this situation is…
  18. The term push and pop is related to the
  19. Which of the following algorithm design technique is used in the quick sort algorithm?
  20. Which of the following data structure is linear type?
  21. The complexity of merge sort algorithm is
  22. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  23. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  24. When new data are to be inserted into a data structure, but there is no available space; this situation…
  25. A data structure where elements can be added or removed at either end but not in the middle
  26. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  27. Which of the following data structure can't store the non-homogeneous data elements?
  28. When determining the efficiency of algorithm, the space factor is measured by
  29. Merge sort uses ?
  30. The operation of processing each element in the list is known as

Please do not use chat terms. Example: avoid using "grt" instead of "great".