Data Structures Algorithms-II MCQs

Page No. 100

Which of the following problems is NOT solved using dynamic programming?


a0/1 knapsack problem

✖


bMatrix chain multiplication problem

✖


cEdit distance problem

✖


dFractional knapsack problem

✓



When a top-down approach of dynamic programming is applied to a problem, it usually _____________


aDecreases both, the time complexity and the space complexity

✖


bDecreases the time complexity and increases the space complexity

✓


cIncreases the time complexity and decreases the space complexity

✖


dIncreases both, the time complexity and the space complexity

✖



In dynamic programming, the technique of storing the previously calculated values is called ___________


aSaving value property

✖


bStoring value property

✖


cMemoization

✓


dMapping

✖


View Answer Memoization

A greedy algorithm can be used to solve all the dynamic programming problems.


aTrue

✖


bFalse

✓


cA & B

✖


d None of the above

✖


View Answer False

When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don’t take advantage of overlapping subproblems.


aTrue

✓


bFalse

✖


cA & B

✖


d None of the above

✖


View Answer True

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________


aDynamic programming

✖


b Greedy

✖


cDivide and conquer

✓


dRecursion

✖


View Answer Divide and conquer

If a problem can be broken into subproblems which are reused several times, the problem possesses ____________ property.


aOverlapping subproblems

✓


b Optimal substructure

✖


cMemoization

✖


dGreedy

✖



If an optimal solution can be created for a problem by constructing optimal solutions for its subproblems, the problem possesses ____________ property.


aOverlapping subproblems

✖


bOptimal substructure

✓


c Memoization

✖


dGreedy

✖


View Answer Optimal substructure

Which of the following is/are property/properties of a dynamic programming problem?


aOptimal substructure

✖


bOverlapping subproblems

✖


cGreedy approach

✖


dBoth optimal substructure and overlapping subproblems

✓



What will be the output when the following code is executed?


a34

✖


b 55

✖


cCompile error

✖


d21

✓


View Answer 21

Goto Page No.

Page 100 of 149

Alphabetical MCQs Categories
—

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"
—

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan