Simple data structures

Question 1

Name 3 Simple Data Structures.

Answer 1

Arrays, Queues, Stacks

Question 2

How does a stack work?

Answer 2

Adding: elements are pushed onto the top of the stack.
Retrieving: elements are popped from the top of the stack.
Elements are pushed and popped from the same end of the data structure.
LIFO

Question 3

How does a queue work?

Answer 3

Adding: elements are enqueued from the tail
Retrieving: elements are dequeued from the head
Elements are enqueued and dequeued from opposite ends of the data structure.
FIFO

Question 4

What methods are required for a Stack data structure?

Answer 4

Push: add an element to the stack
Pop: get the next element from the stack

Question 5

What methods are required for a Queue data structure?

Answer 5

Enqueue: add an element to the queue
Dequeue: get the next element from the queue