(11-29-2016, 11:14 PM)bitm0de Wrote:

(11-29-2016, 10:10 PM)insidious Wrote:

(11-29-2016, 09:50 PM)bitm0de Wrote: I think you only read the first 4 words of my post so you could attempt to correct me by saying exactly what I've already said in the last part of my previous post about FIFO vs LIFO.

He didn't understand what a queue was therefore relating it to the stack and explaining the difference between the two should've been fine for an explanation that leads to his understanding IMO. And the fact that implementation in comparison can be almost 90% similar except for how the dequeue process works makes it an acceptable comparison too. There IS a reason why they were given similar acronyms.

You're saying I can't use similes or metaphors to help someone learn? Now you're just being a pessimist. :/ That's like saying the antonym of some word can't be used to explain the meaning of the opposite word.

Simile:
a figure of speech involving the comparison of one thing with another thing of a different kind, used to make a description more emphatic or vivid (e.g., as brave as a lion, crazy like a fox ).
"A Queue is a stack" does not qualify as simile. When you say something IS something else, that does not mean it is like something else.

Metaphor:
a figure of speech in which a word or phrase is applied to an object or action to which it is not literally applicable.
"“I had fallen through a trapdoor of depression,” said Mark, who was fond of theatrical metaphors"

Yeee doesn't work.


Listen, i'm not trying to kill your vibe here (maybe a bit), but I don't think it's right to even leave the possibility of leading people in the wrong direction. It can lead to complications down the line.

Quote:And the fact that implementation in comparison can be almost 90% similar except for how the dequeue process works makes it an acceptable comparison too. There IS a reason why they were given similar acronyms.

I didn't say it was an unnaceptable comparison. If you had read my previous posts, I did compare them, and even admit their similarity.
Sure, Queue's and Stacks are very similar. They are, I never denied that. But they are not each other.


Sure, implementation is the same. But that's like saying insertion sort is selection sort because the concept is fundamentally the same. But they aren't, their implementation is totally different and so are their use cases.

Quote:I think you only read the first 4 words of my post so you could attempt to correct me by saying exactly what I've already said in the last part of my previous post about FIFO vs LIFO.

tsk tsk, why would you assume that? I hope you are not taking this personally, and I certainly do not mean it that way. We're talking about abstract concepts here not what we think the other person read in order to shoot shade at the other.

It looks like you know your data structures; good, cool, I'm happy you commented in this thread to help other people out. I'm just trying to provide the clearest possible explanation.

On a test, if @"TotallyRandUser128372139" was asked: "What is a Queue?" and they put: A Queue is a Stack, but FIFO instead of LIFO, they would only get half points. Because a Queue isn't a stack. The correct phrasing would be A Queue is LIKE a stack, but FIFO instead of LIFO that is a perfectly well written simile and absolutely acceptable.


TL;DR I'm being a grammar Nazi but hopefully you glean something from this

[video=youtube]http://https://youtu.be/2E0RfaUyQvE[/video]

>> "A Queue is a stack" does not qualify as simile.

Yeah, next time quote my entire sentence rather than parts of it that allow for making your argument valid. Explain how a queue cannot a FIFO-based stack? I can give you more reasons why it is than you've managed to provide over your last two posts thus far.

So rather than bashing my words based on out of context snippets that you cherry pick from my post to suit your invalid argument, how about some relevant proof now?

A queue is a reversed stack, that's what I said, I never said it was a stack, again you're deliberately and ignorantly choosing to ignore the second half of my post, neglecting the key relevant parts. You JUST finished stating that there are similarities. I'm essentially calling a queue a modified stack; a FIFO stack. How are you this blind to see that?

Quote:A queue is a reversed stack, that's what I said, I never said it was a stack

Quote:Queue is a stack but FIFO rather than LIFO.

Quote:Queue is a stack

Quote:So rather than bashing my words based on out of context snippets that you cherry pick from my post to suit your invalid argument, how about some relevant proof now?

Quote:Yeah, next time quote my entire sentence rather than parts of it that allow for making your argument valid. Explain how a queue cannot a FIFO-based stack? I can give you more reasons why it is than you've managed to provide over your last two posts thus far.

Quote:Queue is a stack but FIFO rather than LIFO.

Quote:You JUST finished stating that there are similarities. I'm essentially calling a queue a modified stack; a FIFO stack. How are you this blind to see that?

Quote:In computer science, a queue (/ˈkjuː/ KYEW) is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed.

Quote:In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed. The order in which elements come off a stack gives rise to its alternative name, LIFO (for last in, first out).