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. Two main measures for the efficiency of an algorithm are
  2. ……………. Is a pile in which items are added at one end and removed from…
  3. The situation when in a linked list START=NULL is
  4. When new data are to be inserted into a data structure, but there is no available space; this situation…
  5. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  6. The operation of processing each element in the list is known as
  7. Which of the following data structures are indexed structures?
  8. Which data structure is used in breadth first search of a graph to hold nodes?
  9. The number of possible ordered trees with three nodes A,B,C is?
  10. Which of the following is not the required condition for binary search algorithm?
  11. Which of the following statement is true ?
  12. Which of the following data structure is linear type?
  13. The difference between linear array and a record is
  14. The complexity of linear search algorithm is
  15. The complexity of Bubble sort algorithm is
  16. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  17. Arrays are best data structures
  18. Which of the following is two way list?
  19. Which data structure allows deleting data elements from and inserting at rear?
  20. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  21. A variable P is called pointer if
  22. Two dimensional arrays are also called
  23. If the values of a variable in one module is indirectly changed by another module, this situation is…
  24. The memory address of the first element of an array is called
  25. Which of the following data structure store the homogeneous data elements?
  26. Which if the following is/are the levels of implementation of data structure
  27. Which of the following algorithm design technique is used in the quick sort algorithm?
  28. Linked lists are best suited
  29. The elements of an array are stored successively in memory cells because
  30. Which of the following statement is false?