ISCP 04 Monday slot 1 (10:30 - 12:00) CSE D&H
Authored by CCC info@ccc.training
English
Professional Development
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
20 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Longest increasing subsequence problem can be optimally solved by
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Given items as {value, weight} pairs {{60,20},{50,25},{20,5}}. The capacity of the knapsack=40. Find the maximum value output assuming items to be divisible and non-divisible respectively.
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The time complexity of fractional knapsack problem is?
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following statement is correct about 0/1 knapsack?
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following problem must not be solved using dynamic programming?
6.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The property in which optimal solution is found by constructing optimal solution for the subproblems.
7.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Time complexity of coin change problem solved using greedy technique is
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
