Davinder Singh - 4 years ago in Data Structure

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,1,2
[B] 3,4,5,2,1
[C] 1,5,2,3,4
[D] 5,4,3,1,2
Loading...

Answers

Guest
shengqiushuang - 1 year ago

I agree with the answer is 54321

Comments (0)
Nitesh Patel - 1 year ago

Some one who have posted this answer has misguided us

Comments (0)
Suthar Bhanwar Mlm - 1 year ago

http://www.emis.de/journals/EJC/Volume_13/PDF/v13i1r68.pdf

Comments (0)
Suthar Bhanwar Mlm - 1 year ago

52314 is the correct ans. for using permutations rules

Comments (0)
Lalit Kumar - 2 years ago

this is correct answer first push 5,4,3 in the stack and then pop them ns we get 3,4,5 and then push 2,1 and we get 1,2 so answer is 3,4,5,1,2

Comments (0)
Ajaysing Rajput - 2 years ago

yup R8 54321

Comments (0)
Ayush Rathi - 2 years ago

i think there is something wrong

Comments (0)
Ayush Rathi - 2 years ago

how it can be?

Comments (0)
Zaheer Abbas - 2 years ago

correct answer is 5,4,3,2,1 because stact is a LIFO device

Comments (0)

Related Questions

Davinder Singh - 4 years ago in Data Structure
Linked list are not suitable data structure of which one of the following problems ?
  • [A] Insertion sort
  • [B] Binary search
  • [C] Radix sort
  • [D] Polynomial manipulation
Submit Answer
Davinder Singh - 4 years ago in Data Structure
Which of the following is useful in implementing quick sort?
  • [A] Stack
  • [B] Set
  • [C] List
  • [D] Queue
Submit Answer
Davinder Singh - 4 years ago in Data Structure
Queue can be used to implement ?
  • [A] quick sort
  • [B] merge sort
  • [C] heap sort
  • [D] insertion sort
View Answers
Davinder Singh - 4 years ago in Data Structure
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
  • [A] 11
  • [B] 12
  • [C] 13
  • [D] 14
Submit Answer
Davinder Singh - 4 years ago in Data Structure
Which of the following algorithm design technique is used in the quick sort algorithm?
  • [A] Dynamic programming
  • [B] Backtracking
  • [C] Divide and conquer
  • [D] Greedy method
Submit Answer