profile-img
Eduncle posted an MCQ
February 22, 2020 • 19:23 pm 0 points
  • UGC NET
  • Computer Science & Applications

Consider the following statements : 

Choose Your Answer:
0 Attempts Submit Now
  • 0 Likes
  • 1 Comments
  • 0 Shares
  • comment-profile-img>
    Eduncle Best Answer

    FALSE : The running time of a dynamic program is the number of subproblems times the time per subproblem. This would only be true if the time per subproblem is O(1).
    TRUE : Cyclic dependency is a relation between two or more modules which either directly or indirectly depend on each other to function properly. Such modules are also known as mutually recursive. So, we can't get correct solution when we are using dynamic programming.
    FALSE : A bottom up implementation must go through all of the sub-problems and spend the time per subproblem for each. Using recursion and memoization only spends time on the subproblems that it needs. In fact, the reverse may be true: using recursion and memoization may be asymptotically faster then a bottom-up implementation.
    FALSE : If a problem X can be reduced to a known NP-hard problem, then X must be NP-Complete.

whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers