Question

1.In stack both push and pop operation can be done at both the side is known as ______ *
a.Queue
b.Stack
c.Circular stack
d.Circular queue
2.Which is not an application of stack from following?
a.Recursion
b.Stack machine
c.Pop
d.Polish representation

3.When particular solution algorithm takes minimum amount of time for compilation is known as______
a.space complexity
b.average time complexity
c.best time complexity
d.worse time complexity
4.___________ stores the address of the variable which directly refers the physical storage in memory.
a.Stack
b.Pointer
c.Structure
d.Array​

Answer 1

Answer:

hsodgowhdo2vdi2bdeihdie