CS 111 QUIZ 1 EXAM QUESTIONS AND ANSWERS
Array - CORRECT ANSWER✅✅Fixed size structure which stores an ordered list of items. It allows for
quick access to each value stored, when given the value's index.
Queue - CORRECT ANSWER✅✅Variable sized structure which maintains items in first-in first-out order.
Stack - CORRECT ANSWER✅✅Variable sized structure which maintains items in last-in first-out order.
Tree - CORRECT ANSWER✅✅Hierarchical structure of items. There is one item at the top of the
hierarchy. Each item has one directly above it in the hierarchy and zero or more items directly below it.
Heap - CORRECT ANSWER✅✅Partially sorted structure. Quick access to the smallest item in the
structure.
Linked List - CORRECT ANSWER✅✅List of objects stored as a sequence of interconnected nodes. Each
node stores an object and points to the node after it in the list. Quick access to the first node in the list.
Merge Sort - CORRECT ANSWER✅✅Split the array in half, recursively sort each half, then combine the
sorted halves together.
Selection Sort - CORRECT ANSWER✅✅Maintain a sorted portion of the array and an unsorted portion.
In each iteration of the algorithm, find the smallest element of the unsorted portion and swap it to the
front of the unsorted portion.
Radix Sort - CORRECT ANSWER✅✅Sort the array digit by digit. For each digit, divide the numbers in the
array into buckets based upon the value of the digit, then combine the buckets back into the array.
Make sure that the items are removed from the buckets in the same order they were put in.
Quick Sort - CORRECT ANSWER✅✅Choose a value in the array to be a pivot. Divide the array into values
smaller than the pivot and values greater than the pivot. Recursively sort each part, then put the sorted
parts together.
Array - CORRECT ANSWER✅✅Fixed size structure which stores an ordered list of items. It allows for
quick access to each value stored, when given the value's index.
Queue - CORRECT ANSWER✅✅Variable sized structure which maintains items in first-in first-out order.
Stack - CORRECT ANSWER✅✅Variable sized structure which maintains items in last-in first-out order.
Tree - CORRECT ANSWER✅✅Hierarchical structure of items. There is one item at the top of the
hierarchy. Each item has one directly above it in the hierarchy and zero or more items directly below it.
Heap - CORRECT ANSWER✅✅Partially sorted structure. Quick access to the smallest item in the
structure.
Linked List - CORRECT ANSWER✅✅List of objects stored as a sequence of interconnected nodes. Each
node stores an object and points to the node after it in the list. Quick access to the first node in the list.
Merge Sort - CORRECT ANSWER✅✅Split the array in half, recursively sort each half, then combine the
sorted halves together.
Selection Sort - CORRECT ANSWER✅✅Maintain a sorted portion of the array and an unsorted portion.
In each iteration of the algorithm, find the smallest element of the unsorted portion and swap it to the
front of the unsorted portion.
Radix Sort - CORRECT ANSWER✅✅Sort the array digit by digit. For each digit, divide the numbers in the
array into buckets based upon the value of the digit, then combine the buckets back into the array.
Make sure that the items are removed from the buckets in the same order they were put in.
Quick Sort - CORRECT ANSWER✅✅Choose a value in the array to be a pivot. Divide the array into values
smaller than the pivot and values greater than the pivot. Recursively sort each part, then put the sorted
parts together.
