DSBS-AN-31.01.2024
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
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Consider two strings A = "qpqrr" and B = "pqprqrp". Let x be the length of the longest common subsequence (not necessarily contiguous) between A and B and let y be the number of such longest common subsequences between A and B. Then x + 10y = ___.
2.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Let A1, A2, A3, and A4 be four matrices of dimensions 10 x 5, 5 x 20, 20 x 10, and 10 x 5, respectively. The minimum number of scalar multiplications required to find the product A1A2A3A4 using the basic matrix multiplication method is
3.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
What happens when a top-down approach of dynamic programming is applied to any problem?
4.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
The Fibonacci sequence is often used to illustrate dynamic programming concepts. What is the time complexity of a naive recursive implementation of Fibonacci numbers?
5.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
time_to_reach[2][3] = {{17, 2, 7}, {19, 4, 9}} time_spent[2][4] = {{6, 5, 15, 7}, {5, 10, 11, 4}} entry_time[2] = {8, 10} exit_time[2] = {10, 7} num_of_stations = 4 For the optimal solution which should be the starting assembly line?
6.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6} What is the minimum number of jumps required to reach the end of the array?
7.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Find the longest increasing subsequence for the given sequence: {10, -10, 12, 9, 10, 15, 13, 14}
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?
