Разделы презентаций
- Разное
- Английский язык
- Астрономия
- Алгебра
- Биология
- География
- Геометрия
- Детские презентации
- Информатика
- История
- Литература
- Математика
- Медицина
- Менеджмент
- Музыка
- МХК
- Немецкий язык
- ОБЖ
- Обществознание
- Окружающий мир
- Педагогика
- Русский язык
- Технология
- Физика
- Философия
- Химия
- Шаблоны, картинки для презентаций
- Экология
- Экономика
- Юриспруденция
Stacks
Содержание
- 1. Stacks
- 2. A stack is an ADT that might
- 3. A real life example is a stack
- 4. Let's take a look at a computer
- 5. Слайд 5
- 6. Stacks have several uses: Reversing queues (as
- 7. Exercise: StacksDraw the stack after each of
- 8. Give the set of instructions required to
- 9. Give the set of instructions required to
- 10. https://en.wikibooks.org/wiki/A-level_Computing/AQA/Paper_1/Fundamentals_of_data_structures/StacksExercise: Stacks
- 11. https://en.wikibooks.org/wiki/A-level_Computing/AQA/Paper_1/Fundamentals_of_data_structures/Stackshttps://upload.wikimedia.org/wikipedia/commons/thumb/f/f5/CPT-ADT-stacks-real-life.svg/632px-CPT-ADT-stacks-real-life.svg.pnginformation from the site:
- 12. Скачать презентанцию
A stack is an ADT that might involve a dynamic or static implementation. A stack is a last-in-first-out (LIFO) or first-in-last-out (FILO) ADT. Implementations should include two operations, pushing and popping,
Слайды и текст этой презентации
Слайд 2A stack is an ADT that might involve a dynamic
or static implementation. A stack is a last-in-first-out (LIFO) or
first-in-last-out (FILO) ADT. Implementations should include two operations, pushing and popping, and a pointer to the top of the stack.
Слайд 3
A real life example is a stack of books you
might have on your desk:
CPT-ADT-stacks-real-life.svg
In this example we keep adding
(pushing) books to the stack. If we want to get at the bottom book about Cars, we must first remove (pop) all the books above it. Hence First In Last Out (FILO)
Слайд 4Let's take a look at a computer implementation of a
stack:
Pushing: Adds a new specified item to the top of
the stackPopping: Removes the item from the top of the stack.
Слайд 6Stacks have several uses:
Reversing queues (as seen above with the
Alphabetised names)
Performing Reverse Polish Calculations (see ....)
Holding return addresses and
syste states for recursive function calls
Слайд 7Exercise: Stacks
Draw the stack after each of the following commands,
starting with an empty stack. What does the stack achieve:
Push
'Annabelle'Push 'Chris'
Push 'Hemingway'
Push 'James'
Pop
Pop
Pop
Pop
Слайд 8Give the set of instructions required to get from State
1 to State 2 as shown below:
Exercise: Stacks
Слайд 9Give the set of instructions required to get from State
1 to State 2 as shown below:
Exercise: Stacks
Answer:
Pop
Pop
Push 'Sand'
Push 'Witches'
Слайд 10https://en.wikibooks.org/wiki/A-level_Computing/AQA/Paper_1/Fundamentals_of_data_structures/Stacks
Exercise: Stacks
Слайд 11https://en.wikibooks.org/wiki/A-level_Computing/AQA/Paper_1/Fundamentals_of_data_structures/Stacks
https://upload.wikimedia.org/wikipedia/commons/thumb/f/f5/CPT-ADT-stacks-real-life.svg/632px-CPT-ADT-stacks-real-life.svg.png
information from the site:
