LIFO (computing) | Wikipedia audio article
Channel: wikipedia tts
Date: 17/01/2019

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Stack_(abstract_data_type)


00:01:27 1 History
00:02:40 2 Non-essential operations
00:03:31 3 Software stacks
00:03:41 3.1 Implementation
00:04:15 3.1.1 Array
00:06:49 3.1.2 Linked list
00:08:27 3.2 Stacks and programming languages
00:09:47 4 Hardware stack
00:10:04 4.1 Basic architecture of a stack
00:15:46 4.1.1 Stack in main memory
00:16:44 4.1.2 Stack in registers or dedicated memory
00:18:45 5 Applications of stacks
00:18:55 5.1 Expression evaluation and syntax parsing
00:19:41 5.2 Backtracking
00:21:18 5.3 Compile time memory management
00:23:20 5.4 Efficient algorithms
00:24:56 6 Security



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.8636525564173209
Voice name: en-AU-Wavenet-A


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
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 (last in, first out). Additionally, a peek operation may give access to the top without modifying the stack. The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack, while getting to an item deeper in the stack may require taking off multiple other items first.Considered as a linear data structure, or more abstractly a sequential collection, the push and pop operations occur only at one end of the structure, referred to as the top of the stack.  This makes it possible to implement a stack as a singly linked list and a pointer to the top element. A stack may be implemented to have a bounded capacity. If the stack is full and does not contain enough space to accept an entity to be pushed, the stack is then considered to be in an overflow state. The pop operation removes an item from the top of the stack.