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
FA 3 - Algorithms
| Question | Answer |
|---|---|
| The searching phase in quick search algorithm has good practical behaviour. Group of answer choices No answer text provided. No answer text provided. False True | True |
| It refers to the general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution Greedy Divide and Conquer Brute force Dynamic Programming | Brute force |
| It’s a sorting algorithm that sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning Group of answer choices Selection Merge Quick Bubble | Selection |
| Complete the code snippet below, pseudocode of brute force string for i ← to n-m do j ← 0 while j<m and P[j} = T[i+j] do _________ if j=m return i return -1 Group of answer choices J <- j +1 J <- j / 1 J <- j * 1 J<- j - 1 | J <- j +1 |
| Given input string = “THIS IS A TEST TEXT” and pattern string = “TEST”. Find the first index of the pattern match using quick search algorithm Group of answer choices 11 9 12 10 | 10 |
| ______ is an algorithm compares the pattern to the text, one character at a time, until un-matching characters are found: Group of answer choices Dynamic programming Divide and conquer Brute force Transform and conquer | Brute force |
| There are how many steps in writing the brute force string matching algorithm Group of answer choices 4 5 3 6 | 3 |
| How many sub-arrays does selection sort maintains? Group of answer choices 4 5 2 3 | 2 |
| It refers to the general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution Exhaustive Search Greedy Dynamic Programming Divide and Conquer | Exhaustive Search |
| Who was the mathematician who have done works on the knapsack problem Group of answer choices Tobby Dantzig Tobias Datzig Tobias Dantzig Tom Dantzig | Tobias Dantzig |
| This approach is used in real-world decision-making processes in a wide variety of fields, such as finding the least wasteful way to cut raw materials Dynamic programming Brute force Traveling Salesman Knapsack problem | Knapsack problem |
| This approach is an example of combinatorial optimization. Group of answer choices Traveling Salesman Dynamic programming Brute force Knapsack problem | Knapsack problem |
| The Knapsack problem is an example of ____________ Group of answer choices Greedy Brute Force Transform and conquer Divide and Conquer | Brute Force |
| The main challenge of the traveling salesman is? Group of answer choices tour cities maximize the cost minimize travel None | minimize travel |
| It derives its name from the problem faced by someone who is constrained by a fixed-size backpack and must fill it with the most valuable items. Group of answer choices Knapsack problem Brute force Traveling Salesman Dynamic programming | Knapsack problem |
| Which is an advantage of using brute force from the following list? Sоmе brute-fоrсе algorithms are unacceptably slow It is neither as соnѕtruсtіvе nоr as сrеаtіvе It hаѕ wide applicability аnd is known for іtѕ ѕіmрlісіtу | It hаѕ wide applicability аnd is known for іtѕ ѕіmрlісіtу |
| Given input string = “ABCDABCATRYCARCABCSRT” and pattern string = “CAT”. Find the first index of the pattern match using quick search algorithm Group of answer choices 11 6 14 2 | 6 |
| Which is an advantage of using a brute force: Sоmе brute-fоrсе algorithms are slow It yields ѕtаndаrd аlgоrіthmѕ fоr simple соmрutаtіоnаl tasks, such аѕ sum аnd рrоduсt оf n numbеrѕ, It is neither as соnѕtruсtіvе nоr as сrеаtіvе | It yields ѕtаndаrd аlgоrіthmѕ fоr simple соmрutаtіоnаl tasks, such аѕ sum аnd рrоduсt оf n numbеrѕ, аnd finding the mаxіmum оr mіnіmum іn a lіѕt |
| Complete the code snippet below, pseudocode of brute force string for i ← to n-m do j ← 0 while j<m and P[j} = T[i+j] do _________ if j=m return i __________ Group of answer choices return i return -n return m return -1 | return -1 |
| An algorithm that calculate the total distance for every possible route and then select the shortest one. Group of answer choices Divide and Conquer Greedy Exhaustive Search Dynamic Programming | Exhaustive Search |
| What is the time efficiency of the brute force string match? Group of answer choices O(1) (nm2) O(mn) exponential | O(mn) |
| In the given code snippet below, what does m represents? for i ← to n-m do j ← 0 while j<m and P[j} = T[i+j] do _________ if j=m return i __________ characters representing a pattern value of character first search value none of the above | characters representing a pattern |
| According to the Stony Brook University Algorithm Repository, what is the ranked of the knapsack problem? Group of answer choices 17th 20th 19th 18th | 19th |
| You are given a knapsack that can carry a maximum weight of 60. There are 4 items with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items you can carry 90 160 170 200 | 160 |
| Given input string = “TWO ROADS DIVERGED IN A YELLOW WOOD” and pattern string = “ROADS”. Find the first index of the pattern match using quick search algorithm Group of answer choices 5 4 6 3 | 4 |
| It finds the location of a specific text pattern within a larger body of text? Group of answer choices string search seeking pattern matching Brute force | string search |
| It refers to an algorithm that is an effective method that can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Divide and Conquer Dynamic Programming Brute force Greedy | Brute force |
| What is the time complexity of the brute force solution? Group of answer choices O(n) O(mn) Exponential O(1) | O(mn) |
| A process there it involves searching for an element with a special property, usually among combinatorial objects such as permutations, combinations, or subsets of a set. Brute force Divide and Conquer Dynamic programming Traveling Salesman | Brute force |
| Which of the following methods can be used to solve the Knapsack problem? Group of answer choices brute force, recursion divide and conquer recursion dynamic programming | brute force, recursion |
| In the travelling salesman problem, what do you call the stating point? Group of answer choices Starting point Top Edge Vertex | Vertex |
| It generates a list of all potential solutions to the problem in a systematic manner evaluate potential solutions one by one, disqualifying infeasible ones Divide and Conquer Dynamic programming Exhaustive search Traveling Salesman | Exhaustive search |
| Compares a given pattern with all substrings of a given text. Brute force string matching selection sort Brute force None of the above | Brute force string matching |
| The 0-1 Knapsack problem can be solved using Greedy algorithm Group of answer choices False True | False |
| Refers to a string of M characters to search for | pattern |
| There are how many steps in the selection sort algorithm | 5 |
| Given input string = “THIS IS A TEST TEXT” and pattern string = “TEXT”. Find the first index of the pattern match using quick search algorithm | 15 |
| Which is an advantage of using a brute force from the following list? | It уіеldѕ rеаѕоnаblе аlgоrіthmѕ for some іmроrtаnt problems, such as searching, string mаtсhіng, аnd matrix multiplication |
| It generates a list of all potential solutions to the problem in a systematic manner evaluate potential solutions one by one, disqualifying infeasible ones | brute force |
| A brute force problem that has to visit each one of the cities starting from a certain one (e.g. the hometown) and returning to the same city. | traveling salesman |
| What is the efficiency of knapsack problem? | O(2^n) |
Created by:
jekong