Question Bank for Grade 14 Computers
Authored by Kimberley Draeger
Computers
Professional Development
Used 3+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
115 questions
Show all answers
1.
MULTIPLE SELECT QUESTION
30 sec • 1 pt
Which of the following are true statements about the binary search process? Check all that apply.
The average case scenario Big O running time is O(log N).
The target value must be contained within the list.
The process checks the middle item for a match, and then looks to the right or to the left if it doesn't match, repeating this process until a match is found, or not.
The precondition is that the list must be sorted.
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is considered an O(N log N) class sort for a worst case scenario?
Insertion Sort
Merge Sort
Selection Sort
Quick Sort
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of these would be considered the worst case scenario for a linear search?
The target value is not found in the list.
The target value is found at the end of the list.
The target value is found at the beginning of the list.
The target value is found somewhere in the middle of the list.
4.
FILL IN THE BLANKS QUESTION
30 sec • 1 pt
Consider a list that contains eight integer values. If the list is sorted using the merge sort, how many total division operations will take place during the entire process?
(a)
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following describes a selection sort?
The "best value for each position" is found and swapped into place with each pass.
The list is partitioned around a pivot point.
Unsorted values are shifted into their "best position" in the list.
Adjacent values are compared and swapped if out of order.
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following descriptions of the Big O analysis categories is NOT correct?
An O(N log N) process is characterized by a divide and conquer process combined with an N based loop.
An O(N2) process is characterized by a nested loop process based on the size of the data set.
An O(1) process only works on a data set of 100 items or less.
An O(N) process is characterized by a loop that spans the entire data set of size N.
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Consider a list:
{ 3, 5, 8, 10, 14, 34, 78, 123, 513, 999 }
If a binary search for the value 34 is performed, how many comparison operations will be required to find it?
3
1
6
5
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
