8/7/22, 1:30 AM
CS 3303-01 - AY2022-T5: Discussion Forum-Unit 3
CS 3303-01 Data Structures - AY2022-T5
Dashboard / My courses / CS 3303-01 - AY2022-T5 / 30 June - 6 July / _Discussion Forum Unit 3 /_Discussion Forum-Unit 3
0
Search forums
Discussion Forum Unit 3
Discussion Forum-Unit 3
# Settings
Display replies in nested form
The cut-off date for posting to this forum is reached so you can no longer post to it.
Discussion Forum-Unit 3 by Rupali Memane (Instructor) - Tuesday, 14 June 2022, 10:29 AM
Discussion Assignment
In your own words, describe the structure and function of both the stack and queue data structure and discuss how they are different from the perspective of how they are used
33 words
Permalink
Re: Discussion Forum-Unit 3 by Victor Ezekiel - Thursday, 30 June 2022, 6:04 PM
In your own words, describe the structure and function of both the stack and queue data structure and discuss how they a different from the perspective of how they are used. STACK FUNCTION AND STRUCTURE
have a broader understanding than you can imagine because those are the concept that is literally at work as a computing concept. Referencing the reading resources for this unit, Stack is defined as a list-like structure, in which its elements may be removed or inserted from only one end. (Shaffer, 2011, p.124). Popularly known as LIFO, (Last In First Out), it allows the information stacked up in a way that allows the last information to be the first one to be used. Assuming the computation is 1 delete a certain element in the stack, the last element to be inserted is automatically the first one to be deleted.
From my research about this data structure, I got to find out that it allows two main major options to be performed on it, and they include Push and Pop operations, where Push operation allows the insertion of items or elements into the stack (right ai the top), and Pop operation deletes an element of the stack right from the top and necessarily the last item to be added and most cases return it in its function (or hold unto the value for future purposes). I believe the best thing to bear in mind about this data structure is that it has been around for more than a century (even before the invention of computers), and whenever an element is added, it goes on top of the stack making it the first one amongst already existing elements, and likewise wher an element is to be removed, the first one on top of the stack which is the last to be added is the one to be popped.
https://my.uopeople.edu/mod/forum/discuss.php?d=808733
1/25
8/7/22, 1:30 AM
CS 3303-01 - AY2022-T5: Discussion Forum-Unit 3
QUEUE FUNCTION AND STRUCTURE
Just like above, If anyone reading this is familiar with how queues are being formed and maintained in a gas station, at Starbucks coffee shops, and movie centers, then such fellow must know more than he