KSU CSE 1321 FINAL EXAM QUESTIONS AND
ANSWERS KENNESAW STATE UNIVERSITY
PRACTICE TEST SCRIPT 2026 DETAILED
ANSWERS GRADED A+
⩥ 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. Answer: 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. Answer: Binary
⩥ Sorting a collection makes searching for a value faster. Answer: True,
using binary search
⩥ We can use this notation to analyze an algorithm's efficiency. Answer:
Big O
⩥ Of the algorithms that we have studied in this module, which is the
most efficient in practice? Answer: 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.
Answer: True
⩥ 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. Answer: Bubble
⩥ This search scans one item at a time, without jumping to any item.
Answer: Linear
⩥ What does the following statement do?
Create array grades[10] Answer: 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. Answer: True
, ⩥ What do you call the number that is used to pinpoint a specific
element within an array? Answer: index or subscript
⩥ Array indexes always starts at what value? Answer: 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
y ← y + 10
ENDFOR Answer: 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]
ANSWERS KENNESAW STATE UNIVERSITY
PRACTICE TEST SCRIPT 2026 DETAILED
ANSWERS GRADED A+
⩥ 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. Answer: 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. Answer: Binary
⩥ Sorting a collection makes searching for a value faster. Answer: True,
using binary search
⩥ We can use this notation to analyze an algorithm's efficiency. Answer:
Big O
⩥ Of the algorithms that we have studied in this module, which is the
most efficient in practice? Answer: 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.
Answer: True
⩥ 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. Answer: Bubble
⩥ This search scans one item at a time, without jumping to any item.
Answer: Linear
⩥ What does the following statement do?
Create array grades[10] Answer: 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. Answer: True
, ⩥ What do you call the number that is used to pinpoint a specific
element within an array? Answer: index or subscript
⩥ Array indexes always starts at what value? Answer: 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
y ← y + 10
ENDFOR Answer: 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]
