Font size
WorksheetsCommon Algorithms
Total questions: 25
Worksheet time: 18mins
A linear search does not need your data set to be (a) .
When is a linear search a good algorithm to use?
If your data set is very large
If your data set is sorted in order
If your data set is small
If your data set is made up of irrational numbers
When would you get a best case scenario for a linear search?
When your data set is small
When your data set is large
When your search item is near the beginning of the list
When the search item is in the middle of the list
When would you get the best case scenario for a binary search?
When your list is small
When your list is unsorted
When your search item is in the beginning of the list
When your search item is exactly in the middle of the list
Which of these statements is true for binary search?
It looks at each data item in order sequentially
It is very good if your data set is very small
It requires your data set to be sorted
It only works if your data set is made out of 0s and 1s
Which of these is a disadvantage of linear search?
It does not work on unsorted data sets
It is very inefficient on large data sets
It is very time consuming on small data sets
It requires twice as much memory as binary search
What is the worst case scenario for a linear search?
When the data set is large and your search item is in the middle of the list
When the data set is small and the search item is at the beginning of the list
When the data set is made up of curved geometric shapes
-OWEN D
When the data set is large and the search item is at the end of the list
Linear search will work on (a) lists.
Which of these is true for binary search algorithms
It can be used to traverse a binary tree graph
It works only on sorted data
It is efficient for large data sets
It is a divide and conquer algorithm
Linear search algorithm
is inefficient on large data sets
can be used on unsorted data
Requires the data set to be already sorted
Does not work quadratic equations
Which of the following is/ are common algorithms?
Merge cells
Merge search
Merge sort
Merge lanes
Which of these sorting algorithms is the least efficient?
Bubble Sort
Binary Sort
Merge Sort
Motivational Sort
Which of these sorting algorithms is the most efficient on large data sets?
Bubble Sort
Linear Sort
Merge Sort
Allsorts
Which algorithm has a similar time efficiency as merge sort?
Bubble Sort
Quick Sort
Insertion sort
Exertion sort
Which sorting algorithm has a similar time efficiency as Bubble sort?
Quick Sort
Merge Sort
Insertion Sort
Exertion Sort
Insertion sort is most useful for
Inserting items into a large sorted data set
inserting items into a large unsorted data set
inserting items into a small unsorted data set
inserting items into a small sorted data set
Which algorithm requires extra memory?
Bubble sort
Quick sort
Merge sort
Insertion sort
Which algorithm first splits a list up into smaller sub-lists?
Bubble Sort
Quick Sort
Merge Sort
Insertion Sort
Which algorithm can make use of effciencies provided by having multiple cores?
Binary Search
Linear Search
Merge Sort
Bubble Sort
Which of these data structures can be traversed by a binary search?
Hash Table
Stack
Queue
Tree
The time complexity of merge sort is (a)
What is the space complexity of Merge sort?
O(n)
O(1)
O(n!)
O(nlogn)
Bubble sort has a time complexity of (a)
Which of these algorithms has a time complexity of O(n squared)?
Bubble Sort
Linear Search
Binary Search
Merge Sort
Draw the symbol for a NAND Logic Gate.
