Comp 200 Exam Prep 2025
Questions and Answers
selection - ✔✔The ____ sort starts at the first value in the list and then processes each
element looking for the smallest value.
dequeue - ✔✔The ____ operation is used to remove an item from a queue.
nine - ✔✔A two dimensional array declared with size [3] [3] may contain how many
elements?
semicolon - ✔✔In the statement "int[ ] aGrades = new int [5];", the ____ tells the
computer that the end of the statement has been reached.
stack - ✔✔Backtracking is accomplished by using a(n) ____.
pop - ✔✔The ____ operation removes an item from a stack
Arrays - ✔✔____ are an excellent data structure for storing information in memory
because they can be accessed sequentially without any knowledge of the memory cell
contents.
tree - ✔✔A ____ represents a hierarchical structure, similar to that of organizational or
genealogy charts.
three - ✔✔In a binary search tree each node contains ____ components.
COPYRIGHT © 2025 BY OLIVIA WEST, ALL RIGHTS RESERVED 1
, integers - ✔✔What type of data can be stored in an array generated by the statement,
"int[ ] aGrades = new int [5]"?
bubble - ✔✔The ____ sort works by starting with the last element in the list and
comparing its value with that of the item just above it in the list order.
subscript - ✔✔The index or ____ tells the computer which memory cell to access in the
array.
new - ✔✔In the context of the Java programming language, the "____" keyword tells the
computer that a new array is being created.
pointer - ✔✔A(n) ____ is a memory variable containing the address of a memory cell as
its data.
procedures - ✔✔The source code is logically organized into ____, groups of related
commands that perform a task.
algorithm - ✔✔To sort data, you first need to create a(n) ____ that defines the process
for sorting.
cells - ✔✔A computer's memory is organized into ___
pointer - ✔✔A stack ____ keeps track of the top of a stack
root - ✔✔The node that begins the tree is called the ____.
peeking - ✔✔Looking at the top item to inspect it without removing it from the stack is
called ____.
quicksort - ✔✔The ____ routine incorporates the logic that sorting two small lists is
easier and faster than sorting one large list (divide and conquer).
queue - ✔✔A(n) ____ uses a head pointer and a tail pointer.
COPYRIGHT © 2025 BY OLIVIA WEST, ALL RIGHTS RESERVED 2
Questions and Answers
selection - ✔✔The ____ sort starts at the first value in the list and then processes each
element looking for the smallest value.
dequeue - ✔✔The ____ operation is used to remove an item from a queue.
nine - ✔✔A two dimensional array declared with size [3] [3] may contain how many
elements?
semicolon - ✔✔In the statement "int[ ] aGrades = new int [5];", the ____ tells the
computer that the end of the statement has been reached.
stack - ✔✔Backtracking is accomplished by using a(n) ____.
pop - ✔✔The ____ operation removes an item from a stack
Arrays - ✔✔____ are an excellent data structure for storing information in memory
because they can be accessed sequentially without any knowledge of the memory cell
contents.
tree - ✔✔A ____ represents a hierarchical structure, similar to that of organizational or
genealogy charts.
three - ✔✔In a binary search tree each node contains ____ components.
COPYRIGHT © 2025 BY OLIVIA WEST, ALL RIGHTS RESERVED 1
, integers - ✔✔What type of data can be stored in an array generated by the statement,
"int[ ] aGrades = new int [5]"?
bubble - ✔✔The ____ sort works by starting with the last element in the list and
comparing its value with that of the item just above it in the list order.
subscript - ✔✔The index or ____ tells the computer which memory cell to access in the
array.
new - ✔✔In the context of the Java programming language, the "____" keyword tells the
computer that a new array is being created.
pointer - ✔✔A(n) ____ is a memory variable containing the address of a memory cell as
its data.
procedures - ✔✔The source code is logically organized into ____, groups of related
commands that perform a task.
algorithm - ✔✔To sort data, you first need to create a(n) ____ that defines the process
for sorting.
cells - ✔✔A computer's memory is organized into ___
pointer - ✔✔A stack ____ keeps track of the top of a stack
root - ✔✔The node that begins the tree is called the ____.
peeking - ✔✔Looking at the top item to inspect it without removing it from the stack is
called ____.
quicksort - ✔✔The ____ routine incorporates the logic that sorting two small lists is
easier and faster than sorting one large list (divide and conquer).
queue - ✔✔A(n) ____ uses a head pointer and a tail pointer.
COPYRIGHT © 2025 BY OLIVIA WEST, ALL RIGHTS RESERVED 2
