2.3.2. Algorithms for the Main Data Structures

Are stacks FIFO or FILO?

• FILO
• FIFO
• LIFO
• LILO

Which function adds an item to a stack?

• Push
• Pop
• Ollie
• Nollie

Which function removes an element from a stack?

• Pop
• Kickflip
• Backflip
• Stick Shift

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

• Holds the location of the next available space in the queue
• Last item in the list
• Used for backtracking
• First item in the list

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

• Peek
• Snoop
• Glance
• Show

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

• Points to the space containing the first item in the queue
• Points to the last item
• Points to open register
• Holds the location of the next available<br />space in the queue

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

• -1
• 1
• 0
• 9B

Are queues FIFO or FILO?

• FIFO
• FILO
• LIFO
• LILO