Hello everyone,
What is the most distinct differences between a FIFO queue and and a link list.
This my first post ever, so thank you in advance for your help.
-DeeMan
Printable View
Hello everyone,
What is the most distinct differences between a FIFO queue and and a link list.
This my first post ever, so thank you in advance for your help.
-DeeMan
Welcome to the forum DeeMan!
A FIFO and a linked list aren't necessarily different. I think it would be best if you took some time to read a few articles on each data structure, and see what you can glean yourself. Then, if you still don't understand something, ask again. Start with these:
FIFO - Wikipedia, the free encyclopedia
Linked list - Wikipedia, the free encyclopedia
Welcome DeeMan! :D
I believe you know that FIFO stands for First In First Out. Only from this, you can imagine some differences (you have to know how a simply link list looks like).
So, what do you think that are the differences? :)
Thanks too you both.
I just finished reading both Wikipedia articles. The FIFO only allows data to be moved and deleted from the top of the array, and data can only be add to the array from the rear. Whereas the link list allows data to be removed, inserted, and delete from anywhere in the array. Is this a correct interpretation. Thanks again for the pleasant experience.
One could say that:
A FIFO Queue is a description of the external properties of a container, whereas a linked-list is a description of the internal implementation details of a container.
They are talking about different aspects of what could be the same thing.
It's sort of like the difference between a forest and a bunch of trees.Quote:
Originally Posted by DeeMan
Are you then saying that the FIFO is a description of how the queue as a whole works, and the link list is the method in which the internal parts are connected? Therefore meaning that a link list can be a FIFO queue, and a FIFO can be a link list? Moreover, a FIFO queue does not have to be linked and a link list does not have to be a FIFO, but they can be one in the same, but not the same at all. Is this where GOD comes from LOL. Just playing, I think it makes a lot more since. When discussing the the queue, its possible to be talking about different aspects of the same thing.
Thanks all
-DeeMan
I think you more or less get it. A queue and a FIFO are generally synonymous when it comes to programming. They describe the order you process/access/add/delete elements. A linked list describes how those elements are connected, i.e. how the internal order is maintained. You are correct, a FIFO/queue may be implemented as a linked list. It may also be implemented as an array. You could even implement it, if you wanted, using a database like MySQL/PostgreSQL. You are also correct, a linked list may be the basis for a FIFO/queue, it may also be the basis for a LIFO/stack, or a plain old list that allows random access/insertion/deletion.
That's basically correct. Fundamentally, there is a distinction between interface and implementation when talking about code. FIFO describes the interface - it describes how other components of the system may interact with this component. A linked list describes the implementation - it describes how the single component works internally.Quote:
Originally Posted by DeeMan
Another way to think about this - the interface describes WHAT the code will do, the implementation describes HOW the code will do it. Of course certain implementations work better or worse for different interfaces, but the two concepts are distinct yet complementary.