ANALYSIS OF ALGORITHMS FINAL PART1 SESTION30, which ot the tollowing is a NP har

Question

ANALYSIS OF ALGORITHMS FINAL PART1 SESTION30, which ot the tollowing is a NP hard problem primarily involving sets and not graphs? Tree D. Steiner E. 3-Dimensional Matching A wit eget programming B. Min Cut C. Max Cut on OUESTIONel which ot the following is a NP hard problem primarily involving graphs and not sets? D. SAT E. 3-Dimensional Matching A integer programming B. Min cut c. Max cut GIVEN: PowER(x,Y) a x'. quESTION22. How many graphs are there over a set of n vertices? E. power(npower(n.2)) a power 2n) powerin 2) c power(2,n) power(n.2) D, power(2,power(n.2) quESTON:3 Consider a rare implementation of the PowER function that uses ONLY assignment and the successOR function within three nested Rorabogs, each of the form similar to "for Gaotie number; i r. what is the time complexity of this code? E. none of the above D. exponential power(n.3) powerin 2) QUESTION24 weich of the following concepts is least related to the activation stack? E. loops method calls D. direct recursion indirect recursion A heap QUESTAON25 Which of the following words is used in conjunction with some sorting algorithm and also with the technology of recursion? E. Stack A heap object. array B. node

Explanation / Answer

20.A 0/1 integer programming
21.D SAT
22.C power(2,n)*power(n,2)
23.D. Exopnential
24loops
25.E. stack

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.