Computer Programming 2 - 3: Question Preview (ID: 18064)


Below is a preview of the questions contained within the game titled COMPUTER PROGRAMMING 2 - 3: Computer Programming 2 - Part 3 .To play games using this data set, follow the directions below. Good luck and have fun. Enjoy! [print these questions]


Play games to reveal the correct answers. Click here to play a game and get the answers.

A data structure that follows FILO is:
a) Stack b) Array c) Queue d) Structure
A data structure that follows FIFO is:
a) Queue b) Stack c) Array d) Structure
The function to take an item off a stack is called:
a) pop b) push c) top d) remove
The function that adds an item to the end of a queue is called
a) push b) pop c) front d) remove
A function that can easily change types as needed by a program without the need to overload the function is called:
a) Template function b) Dynamic function c) Polymorphic function d) Virtual functions
An example of a real life queue is:
a) The checkout line in a grocery store b) A pile of books c) The spray of shotgun bullets d) A character's movement in a video game
An example of a real life stack is:
a) A pile of books b) The checkout line in a grocery store c) The spray of shotgun bullets d) A character's movement in a video game
Which of these is not a data structure?
a) Class b) Stack c) Array d) Queue
Stacks and Queues are able to change their size.
a) True b) False c) d)
Templates have the advantage of:
a) Not needing to write overloaded functions b) Not needing to write code at all c) Not needing to be defined d) Not needing to be programmed
Play Games with the Questions above at ReviewGameZone.com
To play games using the questions from the data set above, visit ReviewGameZone.com and enter game ID number: 18064 in the upper right hand corner at ReviewGameZone.com or simply click on the link above this text.

TEACHERS / EDUCATORS
Log In
| Sign Up / Register