Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?

A. 3,4,5,2,1

B. 3,4,5,1,2

C. 5,4,3,1,2

D. 1,5,2,3,4

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

You can do it
  1. Herder node is used as sentinel in ____
  2. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  3. _____ is not the component of data structure.
  4. The complexity of merge sort algorithm is
  5. The complexity of linear search algorithm is
  6. When determining the efficiency of algorithm the time factor is measured by
  7. Merge sort uses ?
  8. The memory address of the first element of an array is called
  9. ……………. Is a pile in which items are added at one end and removed from…
  10. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  11. Which data structure allows deleting data elements from and inserting at rear?
  12. Two dimensional arrays are also called
  13. A variable P is called pointer if
  14. A data structure where elements can be added or removed at either end but not in the middle
  15. Linked lists are best suited
  16. Which of the following data structure is not linear data structure?
  17. Which of the following data structure is non linear type?
  18. The memory address of fifth element of an array can be calculated by the formula
  19. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  20. The term push and pop is related to the
  21. Which of the following statement is false?
  22. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  23. The complexity of Binary search algorithm is
  24. Which of the following is not the required condition for binary search algorithm?
  25. Which of the following algorithm design technique is used in the quick sort algorithm?
  26. Which of the following is not the part of ADT description?
  27. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  28. Which if the following is/are the levels of implementation of data structure
  29. Which of the following statement is true ?
  30. The complexity of Bubble sort algorithm is