recategorized by
1,283 views
10 votes
10 votes

Given finite alphabet S = {A, B, C} and stack S of size 100. There are only three stack operations we can perform as mentioned below.

Stack is initially empty and we do not perform pop ( ) on empty stack. Assume that only emit ( ) can print output and stack may or may not be empty finally. The minimum number of stack operations to get “A B C A C B A” as output are ______.

I am getting 15 but it is given 14. Please help.

recategorized by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
0 answers
2
MiNiPanda asked Jan 17, 2018
440 views
Not able to understand the question. Kindly elaborate along with an explanation. Thank you.
2 votes
2 votes
2 answers
4
jatin khachane 1 asked Dec 1, 2018
1,221 views
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation