M

Mr. Dubey • 100.69K Points
Coach

Q. Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
Share
Explanation by: Mr. Dubey
the recursive solution to set partition problem takes exponential time complexity whereas the dynamic programming solution takes polynomial time complexity. so dynamic programming solution is faster in terms of time complexity.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. When the program is developed, it is to be tested and defects are to be removed from the program.

Q. In the PL/SQL block below, how many rows will be inserted in the messages table? DECLARE v_start_salesNUMBER := 2; v_end_sales NUMBER := 100; BEGIN FO

Q. An RPC application requires _________

Q. ______ provides authentication at the IP level.

Q. "Quality is defined by the customer" is

Q. What is output of following perl program ? My $val='x'; print ref($val);

Q. In the process of decomposition is called as

Q. Which of the following operators cannot be overloaded?

Q. Primitive operations common to all record management system include

Q. Which of the following clustering requires merging approach?

Question analytics