Comp 200 2025/2026 Exam Questions and Detailed
Answers | Get it 100% Correct Answers
1.selection: The ____ sort starts at the first value in the list and then processes each
element looking for the smallest value.
2.dequeue: The ____ operation is used to remove an item from a queue.
3.nine: A two dimensional array declared with size [3] [3] may contain how many elements?
4.semicolon: In the statement "int[ ] aGrades = new int [5];", the ____ tells the computer
that the end of the statement has been reached.
5.stack: Backtracking is accomplished by using a(n) ____.
6.pop: The ____ operation removes an item from a stack
7.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.
8. tree: A ____ represents a hierarchical structure, similar to that of organizational or genealogy charts.
9.three: In a binary search tree each node contains ____ components.
10. integers: What type of data can be stored in an array generated by the statement, "int[ ] aGrades
= new int [5]"?
11. 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.
12.subscript: The index or ____ tells the computer which memory cell to access in the array.
13. new: In the context of the Java programming language, the "____" keyword tells the computer
that a new array is being created.
14.pointer: A(n) ____ is a memory variable containing the address of a memory cell as its data.
15. procedures: The source code is logically organized into ____, groups of related commands that
perform a task.
16.algorithm: To sort data, you first need to create a(n) ____ that defines the process for sorting.
17.cells: A computer's memory is organized into ___
18.pointer: A stack ____ keeps track of the top of a stack
19.root: The node that begins the tree is called the ____.
20.peeking: Looking at the top item to inspect it without removing it from the stack is called ____.
21. quicksort: The ____ routine incorporates the logic that sorting two small lists is easier and faster
than sorting one large list (divide and conquer).
22.queue: A(n) ____ uses a head pointer and a tail pointer.
Answers | Get it 100% Correct Answers
1.selection: The ____ sort starts at the first value in the list and then processes each
element looking for the smallest value.
2.dequeue: The ____ operation is used to remove an item from a queue.
3.nine: A two dimensional array declared with size [3] [3] may contain how many elements?
4.semicolon: In the statement "int[ ] aGrades = new int [5];", the ____ tells the computer
that the end of the statement has been reached.
5.stack: Backtracking is accomplished by using a(n) ____.
6.pop: The ____ operation removes an item from a stack
7.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.
8. tree: A ____ represents a hierarchical structure, similar to that of organizational or genealogy charts.
9.three: In a binary search tree each node contains ____ components.
10. integers: What type of data can be stored in an array generated by the statement, "int[ ] aGrades
= new int [5]"?
11. 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.
12.subscript: The index or ____ tells the computer which memory cell to access in the array.
13. new: In the context of the Java programming language, the "____" keyword tells the computer
that a new array is being created.
14.pointer: A(n) ____ is a memory variable containing the address of a memory cell as its data.
15. procedures: The source code is logically organized into ____, groups of related commands that
perform a task.
16.algorithm: To sort data, you first need to create a(n) ____ that defines the process for sorting.
17.cells: A computer's memory is organized into ___
18.pointer: A stack ____ keeps track of the top of a stack
19.root: The node that begins the tree is called the ____.
20.peeking: Looking at the top item to inspect it without removing it from the stack is called ____.
21. quicksort: The ____ routine incorporates the logic that sorting two small lists is easier and faster
than sorting one large list (divide and conquer).
22.queue: A(n) ____ uses a head pointer and a tail pointer.
