A data structure that follows FILO is:

A data structure that follows FIFO is:

The function to take an item off a stack is called:

The function that adds an item to the end of a queue is called

A function that can easily change types as needed by a program without the need to overload the function is called:

An example of a real life queue is:

An example of a real life stack is:

Which of these is not a data structure?

Stacks and Queues are able to change their size.

Templates have the advantage of:

Teachers: Create FREE classroom games with your questions Click for more info!
©2007-2024 Review Game Zone | About | Privacy | Contact | Terms | Site Map