12/9/22, 3:19 PM
Teaching Assesment
Teaching Assesment
agrawalks_5@rknec.edu Switch account
Draft saved
Your email will be recorded when you submit this form
* Required
IN greedy method we have one optimal and multiple feasible solution
True
False
Clear selection
Dynamic programming is not used to solve
Matrix chain multiplication
fractional Kanpsack
O/1 Kanpsack
NOne o fthe above
Clear selection
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
1/11
12/9/22, 3:19 PM
Teaching Assesment
How many bits are required to represent string “Computer-Science-V/Sem” using
ASCII
140
151
133
None of the above
Which of the following is not an application of Depth First Search?
For generating topological sort of a graph
For generating Strongly Connected Components of a directed graph
Detecting cycles in the graph
Peer to Peer Networks
Clear selection
Among the given properties ,which is been used for dynamic programming
problem?
Optimal substructure
Overlapping subproblems
Greedy approach
Both optimal substructure and overlapping subproblems
Clear selection
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
2/11
12/9/22, 3:19 PM
Teaching Assesment
Given Recurrence Relation for Quicksort denotes _______case complexity : T(n) =
T(n/10) + T(9n/10) + O(n)
Worst
Best
Average
Clear selection
Dynamic Programming top-down approach increases the space and decrease the
time complexity
Yes
No
Clear selection
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
3/11
12/9/22, 3:19 PM
Teaching Assesment
In the given graph, how many intermediate vertices are required to travel from node
a to node e at a minimum cost?
2
0
1
3
Clear selection
Consider two strings A = “YpYTT” and B = “pYpTYTp”. What will be the Length of
Longest common subsequence (not necessarily contiguous) between A and B
3
2
4
5
Clear selection
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
4/11
12/9/22, 3:19 PM
Teaching Assesment
Name *
Karan Agrawal
Name the strategy in which a problem can be solved by combining optimal
solutions to non-overlapping problems.
Dynamic programming
Greedy
Divide and conquer
Recursion
Clear selection
Number of unique colors will be required for proper vertex coloring of an empty
graph having n vertices
0
1
2
n
Clear selection
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
5/11
12/9/22, 3:19 PM
Teaching Assesment
In LCS c[i][j]=c[i-1][j-1] if
i,j>0
xi=yi
Both a and b
i,j=0 and xi=yi
Clear selection
Find out the path giving the optimized cost
A-B-C-D-E-A
A-B-C-E-D-A
A-C-B-D-E-A
None of Above
Clear selection
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
6/11
12/9/22, 3:19 PM
Teaching Assesment
State-space tree for a backtracking algorithm is constructed using _______________
Depth-first search
Breadth-first search
Clear selection
Chromatic number for given graph
1
2
3
4
Clear selection
LCS for input Sequences “MGGTMN” and “GXTXMYN”
MGMT
MTGN
GMNT
GTMN
Clear selection
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
7/11
12/9/22, 3:19 PM
Teaching Assesment
Find the cost of TSP tour
75
95
80
60
Clear selection
Roll no *
39
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
8/11
12/9/22, 3:19 PM
Teaching Assesment
Which of the following problems is similar to that of a Hamiltonian path problem?
knapsack problem
closest pair problem
travelling salesman problem
assignment problem
Clear selection
In dynamic programming, the technique of storing the previously calculated values
is called ___________
Saving value property
Storing value property
Memoization
Mapping
Clear selection
LCS can be solved using recursive and DP approach
True
False
Clear selection
Page 1 of 1
Submit
Clear form
Never submit passwords through Google Forms.
This form was created inside of RKNEC. Report Abuse
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHEh…
9/11
12/9/22, 3:19 PM
Teaching Assesment
Forms
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHE…
10/11
12/9/22, 3:19 PM
Teaching Assesment
https://docs.google.com/forms/d/e/1FAIpQLScikv9HThfvEf4w4XAJwtbYr9gIATwqE_fJfXYeoYqx_Hqdhg/viewform?hr_submission=ChkIppu7-OMHE…
11/11