Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
M4
| Question | Answer |
|---|---|
| What is the time complexity of binary search? | O (n log) |
| Describe an advantage of a binary search algorithm | Performs well over large ordered lists. |
| Merge Sort can be categorized into which of the following? | Divide and Conquer |
| It is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays | Quick Sort |
| Binary search is similar to that methodology? | Divide and Conquer |
| In this searching algorithm, it is mandatory for the target array to be sorted | Binary |
| What is the average-case time complexity of Merge sort? | O (n log n) |
| Quick Sort can be categorized into which of the following? | Divide and Conquer |
| Which of the following sorting algorithms has the lowest worst-case complexity? | Merge Sort |
| Select the best description to explain what a binary search algorithm is | Put the elements in order, compare with the middle value, split the list in order and repeat |
| When computing for p1 what is the exact formula? | p1=a(f-h) |
| What is the best time complexity of Strassen algorithm | O (1) |
| What is the space complexity of Strassen algorithm | A O (log n) |
| What is the time complexity of closest pair | O(n log n) |
| How many recursive calls it will take to solve the Strassen Algorithm? | 7 |
| When computing for p4 what the exact formula? | p4=d(g-e) |
| The Strassen algorithm is named after? | Volker Strassen |
| When computing for p7 what the exact formula? | p7=(a-c)(e+f) |
| What is the running time of naïve matrix multiplication algorithm? | O(n^3) |
| What is the worse time complexity of Strassen algorithm | O(n^2.8074) |
| What is the auxiliary space complexity of merge sort? | O(n) |
| What is the space complexity of quick sort? | O (1) |
| What do you call the step in the Divide and conquer approach that involves breaking the problem into smaller sub-problems? | break |
| What is the time complexity of quick sort for average case? | O (n log n) |
| What do you call the step that receives a lot of smaller sub-problems to be solved. | solve |
| What is the time complexity of quick sort for worse case? | O (n^2) |
| Sorting Algorithm that looks for a particular item by comparing the middle most item of the collection | Binary |
| Strassen’s matrix multiplication algorithm follows ___________ technique. | Divide and Conquer |
| What was the algorithm that Strassen algorithm was compared which resulted to a faster matrix multiplication? | Coppersmith-Winograd algorithm |
| What is the optimal time required for solving the closest pair problem using divide and conquer approach? | O(n log n) |
| A method that easily modified to find the points with the smallest distance | Closest Pair |
| Using brute force algorithm in solving Strassen algorithm how many multiplication and addition are required? | 8 multiplication 4 addition |
| What is the running time of Strassen’s algorithm for matrix multiplication? | O(n^2.8074) |
| What year did Strassen published his algorithm that proves the n3 general matrix multiplication was not optimal? | 1969 |
| What do you call the step or stage in the divide and conquer method that recursively combines them until they formulate a solution of the original problem? | Combine |
| A binary search is to be performed on the list: 3 5 9 10 123 How many comparisons would it take to find number 9? | 0 -1 |
| What do you call a sorting algorithm that partitions an array and then calls itself recursively twice to sort the two resulting subarrays. | Quick Sort |
| What is the formula use in the binary search if a new mid value needs to be set. | low = mid + 1 mid = low + (high - low) / 2 |
| There are how many steps in the closest pair algorithm? | 7 |
| Strassen’s Matrix Algorithm was proposed by _____________ | Volker Strassen |
| There are a total of _______ sub-matrices in solving for the Strassen algorithm | 8 |
| What is the basic operation of closest pair algorithm using brute force technique? | Euclidean distance |
| A binary search is to be performed on the list: 1 5 10 13 48 68 100 101 How many comparisons would it take to find number 101? | 3 - 4 |
| What do you call the sorting technique that divides the array into equal halves and then combines them in a sorted manner? | Merge Sort |
| Which of the following method is used for sorting in merge sort? | merging |
| What do you call the step in the divide and conquer that generally takes a recursive approach to divide the problem until no sub-problem is further divisible? | break |
| Strassen’s algorithm is a/an_____________ algorithm. | Recursive |
| What is the space complexity of Strassen algorithm | O(n^2) |
Created by:
cornus