Implementation of queue using stack
Describe the process how to implement the queue by using stack.
Expert
The queue can be implemented by using two stacks as:
a) The element is inserted in the queue by pushing it into the stack 1.
b) Element is extracted from the queue by popping it from the stack 2.
c) If the stack 2 is empty then all the elements presently in stack 1 are transferred to stack 2 however in the reverse order.
d) If the stack 2 is not empty simply pop the value from the stack 2.
Explain the difference between a stack and a Queue.
What is Black box testing?
What are the dvantages of single linked list over doubly linked list?
What is minimum number of queues required to implementing the priority queue?
Explain whether the fact table is in normal form or not?
Does the minimum spanning tree of graph provide the shortest distance between any two specified nodes?
How is the front of the queue computed?
Define the term Arrays in brief?
Explain about the term database Trigger.
Define the types of an algorithm.
18,76,764
1947468 Asked
3,689
Active Tutors
1411865
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!