Register

MadeEasy Test Series 2018: Programming & DS - Stack
closed

• closed by
747 views
2 2 votes
closed as a duplicate of: MadeEasy Test Series: Programming & DS - Stack

Not able to understand the question. Kindly elaborate along with an explanation. Thank you.

Voting & Accepting an answer helps improve the community
← Previous · CompilerNext → · I node
← Previous in category · BST01Next in category → · MadeEasy Test Series...
Position:
Show:

Related questions

10 10 votes
0 0 answers
2.2k
2.2k views
MiNiPanda asked Jan 25, 2018
2,150 views
MadeEasy Test Series 2018: Programming & DS - Stack
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 no...
3 3 votes
5 5 answers
5.3k
5.3k views
Rishabh Gupta 2 asked Jan 23, 2018
5,292 views
MadeEasy Test Series 2018: Programming & DS - Stack
Consider the following statements:S1: If stack is implemented as an array, all the operation push, pop, is_empty stack ( ), delete stack ( ) can be performed in constant ...
2 2 votes
1 1 answer
2.7k
2.7k views
Gupta731 asked Dec 7, 2018
2,714 views
MadeEasy Test Series: Programming & DS - Stack
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown.The number of elements that will remain in the stack a...
2 2 votes
2 2 answers
3.2k
3.2k views
jatin khachane 1 asked Dec 1, 2018
3,249 views
MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation