CSE 1321 FINAL REVIEW EXAM
2025/2026 QUESTIONS AND ANSWERS
100% PASS.
This algorithm works by selecting the smallest unsorted item in the list and then swapping it
with the item in the next position to be filled. - ANS Selection
This algorithm works using two sets. The sorted part is initially empty. We remove the entries
from the unsorted portion one at a time and insert them in the the sorted part. -
ANS Insertion
This search compares the target value with the middle element in the collection, then ignores
the half of the collection in which the target cannot exist. - ANS Binary
Sorting a collection makes searching for a value faster. - ANS True, using binary search
We can use this notation to analyze an algorithm's efficiency. - ANS Big O
Of the algorithms that we have studied in this module, which is the most efficient in practice? -
ANS Insertion
If an algorithm is described as O(n^2), then the time to process is directly proportional to the
square of the size of the input data set. - ANS True
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
,This algorithm works by comparing each item in the list with the item next to it, and swapping
them if required. This process repeats until the list is fully sorted. - ANS Bubble
This search scans one item at a time, without jumping to any item. - ANS Linear
What does the following statement do?
Create array grades[10] - ANS Declares grades to be a reference to an array
Creates an instance of an array of 10 values
Will allow valid indices in the range of 0 - 9
**All of these
In a language that uses static typing, we are limited to only values of only one data type in the
array. - ANS True
What do you call the number that is used to pinpoint a specific element within an array? -
ANS index or subscript
Array indexes always starts at what value? - ANS 0
What will be the value of x[3] after the following code has been executed?
Create array x [5]
y←0
FOR (i = 0, i < 5, i++)
x[i] ← y
2 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
, y ← y + 10
ENDFOR - ANS x = [0,10,20,30,40]
x[3] is 30
Answer: 30
What will be the results of the following code?
ARRAY_SIZE ← 5
Create array x [ARRAY_SIZE]
FOR (int i = 0, i < length of x, i++)
x[i] ← 10
ENDFOR - ANS All the values in the array are initialized to 10
What would be the results of the following code?
Create array1 ← [33, 88, 11, 44, 99, 55]
value ← array1[0]
FOR (int i = 0, i < length of array1, i++)
IF(array1[i] < value) THEN
value ← array1[i]ENDIFENDFOR - ANS Value contains the lowest value in array1.
What would be the value of x[1] after the following code is executed?
Create array x [22, 33, 44]
CALL ARRAY_PROCESS with x
...
METHOD ARRAY_PROCESS(parameter [] a)
BEGIN
3 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
2025/2026 QUESTIONS AND ANSWERS
100% PASS.
This algorithm works by selecting the smallest unsorted item in the list and then swapping it
with the item in the next position to be filled. - ANS Selection
This algorithm works using two sets. The sorted part is initially empty. We remove the entries
from the unsorted portion one at a time and insert them in the the sorted part. -
ANS Insertion
This search compares the target value with the middle element in the collection, then ignores
the half of the collection in which the target cannot exist. - ANS Binary
Sorting a collection makes searching for a value faster. - ANS True, using binary search
We can use this notation to analyze an algorithm's efficiency. - ANS Big O
Of the algorithms that we have studied in this module, which is the most efficient in practice? -
ANS Insertion
If an algorithm is described as O(n^2), then the time to process is directly proportional to the
square of the size of the input data set. - ANS True
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
,This algorithm works by comparing each item in the list with the item next to it, and swapping
them if required. This process repeats until the list is fully sorted. - ANS Bubble
This search scans one item at a time, without jumping to any item. - ANS Linear
What does the following statement do?
Create array grades[10] - ANS Declares grades to be a reference to an array
Creates an instance of an array of 10 values
Will allow valid indices in the range of 0 - 9
**All of these
In a language that uses static typing, we are limited to only values of only one data type in the
array. - ANS True
What do you call the number that is used to pinpoint a specific element within an array? -
ANS index or subscript
Array indexes always starts at what value? - ANS 0
What will be the value of x[3] after the following code has been executed?
Create array x [5]
y←0
FOR (i = 0, i < 5, i++)
x[i] ← y
2 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
, y ← y + 10
ENDFOR - ANS x = [0,10,20,30,40]
x[3] is 30
Answer: 30
What will be the results of the following code?
ARRAY_SIZE ← 5
Create array x [ARRAY_SIZE]
FOR (int i = 0, i < length of x, i++)
x[i] ← 10
ENDFOR - ANS All the values in the array are initialized to 10
What would be the results of the following code?
Create array1 ← [33, 88, 11, 44, 99, 55]
value ← array1[0]
FOR (int i = 0, i < length of array1, i++)
IF(array1[i] < value) THEN
value ← array1[i]ENDIFENDFOR - ANS Value contains the lowest value in array1.
What would be the value of x[1] after the following code is executed?
Create array x [22, 33, 44]
CALL ARRAY_PROCESS with x
...
METHOD ARRAY_PROCESS(parameter [] a)
BEGIN
3 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
