Stack is also called as

A. Last in first out

B. First in last out

C. Last in last out

D. First in first out

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

You can do it
  1. Each array declaration need not give, implicitly or explicitly, the information about
  2. Which of the following statement is true ?
  3. Which of the following data structure is non linear type?
  4. Linked lists are best suited
  5. The complexity of merge sort algorithm is
  6. When determining the efficiency of algorithm, the space factor is measured by
  7. The term push and pop is related to the
  8. Which of the following data structure is linear type?
  9. Which of the following case does not exist in complexity theory
  10. Which of the following is two way list?
  11. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  12. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  13. Merge sort uses ?
  14. Which of the following data structures are indexed structures?
  15. A variable P is called pointer if
  16. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  17. To represent hierarchical relationship between elements, Which data structure is suitable?
  18. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  19. Linked list are not suitable data structure of which one of the following problems ?
  20. Two dimensional arrays are also called
  21. Which of the following data structure is not linear data structure?
  22. ……………. Is a pile in which items are added at one end and removed from…
  23. Which of the following is not a limitation of binary search algorithm?
  24. Which of the following is non-liner data structure?
  25. Binary search algorithm can not be applied to
  26. Which of the following data structure is linear data structure?
  27. _____ is not the component of data structure.
  28. Which data structure is used in breadth first search of a graph to hold nodes?
  29. In linear search algorithm the Worst case occurs when
  30. The complexity of linear search algorithm is