ISCP 04 Tuesday slot 1 (09:00 - 11:00) CSE A&C
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
In dynamic programming, the technique of storing the previously calculated values is called ___________
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The following sequence is a fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,….. Which technique can be used to get the nth fibonacci term?
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Find the length of the longest increasing subsequence for the given sequence: {-10, 24, -9, 35, -21, 55, -41, 76, 84}
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
What is the worst case for linear search?
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Longest increasing subsequence problem can be optimally solved by
6.
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.
7.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Consider the below table for Jobs given with profit and deadline. Job J1 J2 J3 J4 J5 J6 J7 J8 J9 Profit 20 25 35 23 23 15 28 21 30 Deadline 7 2 5 3 4 5 2 7 3 Find the maximum profit earned?
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?
