QUESTION22. Which of the following is not true about backtracking algorithms? Ba

Question

QUESTION22. Which of the following is not true about backtracking algorithms? Backtracking algorithms are a type of brute force algorithms B, Backtracking algorithms are equivalent to a depth first search on a solution space that can be viewed as (or simulated by) a graph c. Complete backtracking algorithms can produce approximate solutions D. Backtracking algorithms performed on a solution space represented by a tree are equivalerit to a order traversal of that free. E. Backtracking algorithms on Np hard problems must require at least exponential time complexity UESTION23, which of the following algorithms does not have worst-case powerin,2 runtime complexey? E. (Quicksort D. Selection sort A. Bubblesort B, insertion sort C. Mergesort QUESTION24. Consider a dynamic programming approach to solving Karp's Job sequencing problem (with profits). what does schetiuielillirepresent? B. A schedule for tasks accomplished during times i through j C. The potential profit obtained for tasks i A schedule for tasks i through j. D. The potential profit obtained for tasks during times i through i. E. The potential profit obtained for tasks 1 through i given deadline through j UESTION25. Consider the dynamic programming formula related to solving Karp's Partition problem on weights w1 through wn. SUM means which of the following A. The sum of numbers Wi through W B. The sum of numbers having index i to index j. c. Whether the sum of numbers through wi equals the sum of numbers through Wj. D. Whether the sum of numbers W1 through Wi equals the value j E. Whether the sum of numbers W1 through Wi equ the sum of numbers from Wj through Wn.

Explanation / Answer

The answer for the Question 1 : Option D because not always does the preoder traversal of the tree

Question 2 : The answer is option B - insertion sort does not have the worst case power(n,2) runtime complexity

Question 3 : The answer is option D

Question 4 : The answer is option C

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---