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
FA5 FA6 ALGO
FA5 ALGO
| Question | Answer |
|---|---|
| Binary search uses Decrease and conquer approach | TRUE |
| Sorting mechanism where the sorted array is built having one item at a time. | Insertion |
| Merge sort uses Divide and Conquer approach | TRUE |
| Incremental approach uses a bottom-up variation is usually implemented iteratively, starting with a solution to the smallest instance of the problem. | TRUE |
| Decrease is a method that reduce problem instance to smaller instance of the same problem and extend solution | TRUE |
| There are 3 variation in solving decrease and conquer | t |
| What is the time complexity of BFS | O(V+E) |
| Divide is a method that solve problem into a number of subproblems that are smaller instances of the same problem. | t |
| Binary search uses 1 approach in solving it’s problem | t |
| Decrease by variable is not included in the variations of decrease and conquer | t |
| Decrease and Conquer is a technique is based on exploiting the relationship between a solution to a given instance of a problem and a solution to its smaller instance. | t |
| An algorithm traverses a graph in a depth ward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration | DFS |
| There are 3 approaches in solving Divide and Conquer | t |
| What is the time complexity analysis in the Best-case merge sort | O(n) |
| Combine is a method use in solving sub problems that merge it to the original problem. | t |
| An algorithm traverses a graph in a breadth ward motion and uses a queue to remember to get the next vertex to start a search, when a dead end occurs in any iteration. | BFS |
| Conquer method of is a way of solving smaller instance of the problem | t |
| Conquer is a method of solving problem using recursive approach. | t |
| There are 3 approaches in solving Decrease and Conquer | f |
| Quick sort uses Divide and Conquer approach in solving problems. | t |
| What is the time complexity analysis in the Best-case scenario using merge sort | O(n) |
| Extend is a method used by decrease and conquer where solution of smaller instance to obtain solution to original problem. | t |
| Quick sort uses 2 sub problem approach in solving | t |
| Merge sort uses 2 sub problem approach in solving | t |
| What is the time complexity analysis in the worst-case scenario using merge sort | o(n^2) |
| The time complexity of BFS is O(V+E) | t |
| " Inductive approach is a technique that is based on exploiting the relationship between a solution to a given instance of a problem and a solution to its smaller instance." | t |
| Conquer method of is a way of solving smaller instance of the problem | t |
| " Extend is a method used by decrease and conquer where solution of smaller instance to obtain solution to original problem." | t |
| " Merge sort uses 2 sub problem approach in solving" | t |
| " The time complexity of BFS is O(V+E)" | t |
| " Decrease by a constant factor is a technique that suggests reducing a problem instance by the same constant factor on each iteration of the algorithm" | t |
| Decrease by a constant factor is a technique that suggests reducing a problem instance by the same constant factor on each iteration of the algorithm | t |
| "It refers to the heights of the two child subtrees of any node differ by at most one. | tree |
| Change representation represent the same instance in the transform and conquer strategies. | t |
| "What year is the reference for the book rectangular array " | 179 CE |
| Who was the mathematician how used uses the procedure in reduced echelon form | Wilhelm Jordan |
| " In Presorting activities it computes the median" | t |
| " There are how many rotation of AVL" | 4 |
| The time complexity of merge sort and quick sort under transform and conquer is O(n). | t |
| The AVL paper was published in 1962? | t |
| "In searching for the K in A[0..n-1] problem the efficiency is Θ(nlog n) + O(log n) = Θ(nlog n) " | t |
| "There are 2 stages under the transform and conquer approach when solving problems " | t |
| "Presorting uses unique elements in sorting of trees " | t |
| "Who was the mathematician how used uses the procedure in reduced echelon form " | Wilhelm Jordan |
| What does the Decrease and Conquer algorithm primarily exploit The relationship between unrelated problems The combination of subproblem solutions The division of a problem into equal parts The relationship between a problem and its smaller instance | The relationship between a problem and its smaller instance |
| Which of the following best describes the Divide and Conquer technique? Solving a problem by reducing it by a constant factor Dividing a problem into multiple subproblems and solving them recursively Solving a problem iteratively without recursion R |
Created by:
crystallll