1 for specific request mail
CS 111 Quiz 1 Questions and Correct Answers |
Latest Update
Array Ans: 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 Ans: Variable sized structure which maintains items in first-in
first-out order.
© 2026 Assignment
Stack Ans: Variable sized structure which maintains items in last-in
first-out order.
Tree Ans: Hierarchical structure of items. There is one item at the top of
Guru01 - Stuvia
Expert
the hierarchy. Each item has one directly above it in the hierarchy and
zero or more items directly below it.
Heap Ans: Partially sorted structure. Quick access to the smallest item
in the structure.
Linked List Ans: 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 Ans: Split the array in half, recursively sort each half, then
combine the sorted halves together.
Selection Sort Ans: 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 Ans: 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.
CS 111 Quiz 1 Questions and Correct Answers |
Latest Update
Array Ans: 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 Ans: Variable sized structure which maintains items in first-in
first-out order.
© 2026 Assignment
Stack Ans: Variable sized structure which maintains items in last-in
first-out order.
Tree Ans: Hierarchical structure of items. There is one item at the top of
Guru01 - Stuvia
Expert
the hierarchy. Each item has one directly above it in the hierarchy and
zero or more items directly below it.
Heap Ans: Partially sorted structure. Quick access to the smallest item
in the structure.
Linked List Ans: 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 Ans: Split the array in half, recursively sort each half, then
combine the sorted halves together.
Selection Sort Ans: 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 Ans: 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.
