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
What is sector sparing? Low-level formatting also sets aside spare sectors not visible to the operating system. The controller can be told to change each bad sector logically w

I need help to create test cases for the MIPS Instruction set architecture

Q. Explain Direct Addressing Mode with example? Direct Addressing Mode A direct operand signifies to contents of memory at an address referred by the name of the variable.

Logic manufactures have produced 'large scale' logic (LSI) blocks to achieve complex functions; a typical set of logic functions is that of data storage. There are two main types o

DUPLICATING PROCESSES : As we mentioned earlier duplicating is a process whereby a master copy is prepared from which a large number of other copies are obtained with the help of

What is secondary list? It permits you to enhance the information presented in the basic list.  The user can, for example, select a line of the basic list for which he require

What is Race-around problem? How can you rectify this? The clock pulse which remains into the 1 state whereas both J and K are equal to 1 will reason the output to complement a

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t

This branch of AI is concerned with incorporating knowledge from varied disciplines such as biolog neurology psychology mathematics and several linked disciplines. It is typic

(a) What is Grid computing? (b) What are the key distinctions between conventional distributed computing and Grid computing? (b) Describe how five features of Grid Computi