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 term stack operation. Also write some of its operations.
Write a brief note on the term data structure? And also write down the types of data structures?
What is minimum number of queues required to implementing the priority queue?
Define the term process?
Define the term a spanning Tree.
Briefly describe the term priority queues?
Define does the minimum spanning tree of a graph provide the shortest distance among any two given nodes.
What are the categories of software?
Define the Armstrong rules.
What is meant by the data design?
18,76,764
1953233 Asked
3,689
Active Tutors
1452465
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!