[Solved]-Two Algorithms B Solve Problem Analyzed S Found B S Asymptotic Running Time Greater S B Im Q37255621
Two algorithms, A and B, which solve the same problem, are analyzed, and s found that B’s asymptotic running time is greater than A’s. A and B are then implemented (carefully and correctly) as programs and tested on various data sets. What is the best prediction? a. A will always run faster than B b. B will always run faster than A. c. As the size of the test data increases, A is more and more likely to run faster than B d. As the size of the test data increases, B is more and more likely to run faster than A There are 5 items as follows Items wi tem 5 pounds 30S Item2 10 pounds 20S Item3 20 Item4 30 Item5 40 00S 90S 60S The knapsack can hold 60 pounds find the optimal solution (A) 250S (B) 260 S (C) 270 $ 290S In which sorting technique at every step each element is placed in its proper position? a) Bubble sort c) Quick sort b) Merge sort d) Heap sort Recursive algorithms are based on (a) Divide and conquer approach (b) Top-down approach (c) Bottom-up approach (d) Hierarchical approach (e) Heuristic approach. Which of following algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order? (a) Insertion sort (c) Shell sort (b) Quick sort (d) Bubble sort Show transcribed image text Two algorithms, A and B, which solve the same problem, are analyzed, and s found that B’s asymptotic running time is greater than A’s. A and B are then implemented (carefully and correctly) as programs and tested on various data sets. What is the best prediction? a. A will always run faster than B b. B will always run faster than A. c. As the size of the test data increases, A is more and more likely to run faster than B d. As the size of the test data increases, B is more and more likely to run faster than A There are 5 items as follows Items wi tem 5 pounds 30S Item2 10 pounds 20S Item3 20 Item4 30 Item5 40 00S 90S 60S The knapsack can hold 60 pounds find the optimal solution (A) 250S (B) 260 S (C) 270 $ 290S In which sorting technique at every step each element is placed in its proper position? a) Bubble sort c) Quick sort b) Merge sort d) Heap sort Recursive algorithms are based on (a) Divide and conquer approach (b) Top-down approach (c) Bottom-up approach (d) Hierarchical approach (e) Heuristic approach. Which of following algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order? (a) Insertion sort (c) Shell sort (b) Quick sort (d) Bubble sort
Expert Answer
Answer to Two algorithms, A and B, which solve the same problem, are analyzed, and s found that B’s asymptotic running time is gre… . . .
OR
