ALGORITHMS

Are stacks FIFO or FILO?

Answer explanation

FILO

What is the significance of the back pointer in the array representation of a queue?

Answer explanation

Holds the location of the next available space in the queue

Which function returns the item at the front of a queue without removing it?

Answer explanation

Peek

What is the purpose of the front pointer in the array representation of a queue?

Answer explanation

Points to the space containing the first item in the queue

What value is the top pointer initialised to in the array representation of a stack?

Answer explanation

-1

Give pseudocode for the two functions which add new elements to stacks and queues

Answer explanation

What two pieces of information allow you to analyse an algorithm?

Answer explanation

● Time Complexity

● Space Complexity

What is meant by the time complexity of an algorithm?

Answer explanation

The amount of time required to solve a particular problem

How do you measure of the time complexity?

Answer explanation

Big-O notation

What does the Big-O notation show?

Answer explanation

The effectiveness of an algorithm