Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

What is the main difference between queue and FIFO

Status
Not open for further replies.

pkoti83

Newbie level 5
Joined
Oct 22, 2013
Messages
10
Helped
0
Reputation
0
Reaction score
0
Trophy points
1
Activity points
94
May I know Both Queue and FIFO are same?

If yes, Why Queue has more methods than FIFO?

shall i replace a FIFO with Queue?

If i want to buffer the transaction which one is most preferable?
 

fifo means first in first out the data which entered first will come out first
 

Yes. Queue is basically a data structure that uses the FIFO mechanism to store & retrieve data.
Actually, it is the other way around. A FIFO uses a Queue data structure. A queue is just a data structure that allows easy access (insertion and deletion) to the head or tail of a queue. And you can access the n-th element of a queue. A FIFO enforces first-in-first-out access to the queue.
 

I read many article related to this topic. There definition is different but process is same.
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top