……………. Is a pile in which items are added at one end and removed from the other.

A. Queue

B. Stack

C. List

D. None of the above

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

You can do it
  1. Which of the following name does not relate to stacks?
  2. Which data structure is used in breadth first search of a graph to hold nodes?
  3. The complexity of Bubble sort algorithm is
  4. Which of the following case does not exist in complexity theory
  5. When determining the efficiency of algorithm, the space factor is measured by
  6. Which of the following is not the required condition for binary search algorithm?
  7. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  8. Which of the following algorithm design technique is used in the quick sort algorithm?
  9. Which of the following is not a limitation of binary search algorithm?
  10. Which of the following is non-liner data structure?
  11. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  12. The memory address of the first element of an array is called
  13. _______ level is where the model becomes compatible executable code
  14. A variable P is called pointer if
  15. For an algorithm the complexity of the average case is
  16. Which of the following is not the part of ADT description?
  17. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  18. Which one of the following permutations can be obtained the output using stack assuming that the input…
  19. The complexity of Binary search algorithm is
  20. The complexity of linear search algorithm is
  21. Stack is also called as
  22. Which if the following is/are the levels of implementation of data structure
  23. Which data structure allows deleting data elements from and inserting at rear?
  24. The elements of an array are stored successively in memory cells because
  25. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  26. Linked lists are best suited
  27. Finding the location of the element with a given value is:
  28. Linked list are not suitable data structure of which one of the following problems ?
  29. _____ is not the component of data structure.
  30. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return