121 Week 8 - Stack and Linked Lists

Question 1

Stack

Answer 1

An abstract data type which holds a collection of items in the order in which they were added. It is a Last in First out data type meaning items are added to and removed from the top of the stack.

Question 2

Stack functions

Answer 2

Push - add an item to the top of the stack
pop - remove the item on top of the stack and return its value.
Empty - return true if the stack has no items, else return false

Question 3

Underflow

Answer 3

Trying to pop from an empty stack

Question 4

Overflow

Answer 4

In bounded stacks, trying to push an item when the stack is full

Question 5

Applications of a stack

Answer 5

Call stack for program execution
Syntax and semantics of programming languages
Depth first searching algorithms

Question 6

List

Answer 6

An abstract data type that stores a set of items in a linear order. It cannot have duplicates

Question 7

Singly linked list

Answer 7

A list where elements contain a value and a pointer to the next item in the list

Question 8

Doubly linked list

Answer 8

A list where elements contain a value and a pointer to the next item in the list and previous item in the list.