Stack and queue, Computer Engineering

Assignment Help:

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.

 


Related Discussions:- Stack and queue

Define colspan and rowspan, Q. Define Colspan and Rowspan? Now let's se...

Q. Define Colspan and Rowspan? Now let's see how to work with COLSPAN (Column Span) and ROWSPAN (Row Span). If we want cell containing Ajay in Figure to be extended to the next

What are the properties of electronic cash, What are the properties of elec...

What are the properties of electronic cash? Properties: 1. Monetary Value: Monetary value should be backed by bank certified cashier’s cheque or cash, bank authorized cred

Binary tree can be converted in to its mirror image, A binary tree can be c...

A binary tree can be converted in to its mirror image By traversing it in Preorder

Authentication system differ from a firewall in functioning, How does an au...

How does an authentication system differ from a firewall in functioning?   Authentication vs. firewall User Authentication and Authorization A significant advanced fi

Show the divide and conquer approach, Q. Show the Divide and Conquer approa...

Q. Show the Divide and Conquer approach? Divide and Conquer approach is the way of making a complicated problem easier.  In this approach larger problem (System) is divided int

Why is catch almost always a bad idea, Why is catch (Exception) almost alwa...

Why is catch (Exception) almost always a bad idea?  Well, if at that point you know that an error has happened, then why not write the proper code to handle that error instead

Define linear probing with respect to hashing technique, Define Linear Pro...

Define Linear Probing Linear Probing:  The easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty location.

Explain the t flip flop, Explain the T Flip Flop? The toggle, or T, fli...

Explain the T Flip Flop? The toggle, or T, flip-flop is the bistable device that changes state on command from a common input terminal.   Truth Table

Components of flash, A piece of art can be looked at as having 3 main compo...

A piece of art can be looked at as having 3 main components, the subject, the composition and the content. Subject The subject of an artwork is, in simple terms, the object

Pipeline processing-parallel computer architecture , Pipeline Processing ...

Pipeline Processing Pipelining is a process to realize, overlapped parallelism in the proposed answer of a problem, on a digital computer in an economical way. To understand th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd