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.
Define the two-dimensional array.
Explain about the direct call to ISR by an interrupting source.
Explain Tree database briefly.
What do you mean by recursive algorithm? Describe in brief.
Write down the major data structures employed in the following areas: RDBMS, Network data model and Hierarchical data model?
Explain about the threaded binary tree and its common uses.
Define the pre-order and in-order tree traversal.
When using a declaration statement how memory is reserved?
Define when we should use plain list.
18,76,764
1960280 Asked
3,689
Active Tutors
1412409
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!