Stack and queue, Computer Engineering

Describe queue?

Ans:  It is a type of data structure in which the data are stored in and retrieved on a First in first out (FIFO) basis. It grows in the direction of increasing addresses in the memory. New data are added at the back of the queue (High-address end) and retrieved from the front (low-address end) of the queue.

Illustrate difference between Stack and Queue?

STACK: One end of stack is remain fixed ( the bottom) whereas the other end rises and falls as data are popped  and pushed Single Pointer is required to point to the top of the stack

QUEUE: Both of the ends of a queue move to higher addresses .2 pointers are required to keep track of the two ends of the queue.

 

Posted Date: 10/13/2012 8:06:39 AM | Location : United States







Related Discussions:- Stack and queue, Assignment Help, Ask Question on Stack and queue, Get Answer, Expert's Help, Stack and queue Discussions

Write discussion on Stack and queue
Your posts are moderated
Related Questions
By using XNOR gate if the signals are similar then only the output will be one otherwise not.

Explain the working of Dynamic RAM? A plain piece of hardware called a DRAM controller can be used to make DRAM behave more like SRAM and the job of the DRAM controller is to p

How would you kill a process? The "kill" command takes the PID as one argument; this signifies which process to terminate. The PID of a process can be got using "ps" command

algorithm for deleteing a node

State how Shared Memory is used for inter process communication. Define how ptrace is used by debuggers.  What are modules? Explain how data mapping takes place among modules

Op code mnemonics: Instructions  (statements)  in  assembly  language  are  usually  very  simple,  unlike  those that in  high-level languages. Usually, an opcode is a symbol

Visibility. Controls should be clearly visible, so users can see the controls that are available to them. Visual feedback should also be clearly visible, so users can understand wh

If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms?

What is parallel adder? Draw and explain block diagram for 4 bit parallel adder. Ans: By using full adder circuit, any two bits can be added along with third input like a ca

Specifying Research Problems: In our agent terminology or in technique history, a problem to be solved is a specific and justified manner where the agent has starts with the b