Reason: u(1) is the negation of sum of all profits so long as the weights as whole can be taken. Reason: In the algorithm there is only one for loop which runs from 1 to n. Reason: The value to define reachable is “sum of less(i) + x”, where i takes the values from 1 to 15, and ‘x’ is value defined in question(4). Reason: less( x ) is the number of all js, such that j position(x). Reason: position( x ) = the square number with in which value ‘x’ is there. In this question it is there in shaded square. Reason: ‘x’ takes the value 0 if it is there in shaded position which starts from second square and goes across every alternative square in the initial arrangement, otherwise it takes one.
#MSCIT EXAM QUESTION FULL#
Reason: If we create a full binary tree then the non existing nodes will have the corresponding node values to zero. Reason: If we create a full binary tree then the non existing nodes will have the corresponding edge values to zero. Reason: As we have to calculate c(i,j), w(i,j) and r(i,j). Set 1 Set 2 Set 3 Set 4 Set 5 Set 6 Set 7 Set 8 Set 9 Set 10 Set 11 Set 12 Set 13 Set 14 Set 15 Set 16 Set 17 Set 18 Set 19 Set 20 Set 21 Set 22 Set 23 Set 24 Set 25 Set 26 The worst case time complexity of the nondeterministic dynamic knapsack algorithm isġ0.ğor the LCBB solution of knapsack problem with the data (p1–p4) = (10,10,12,18) and (w1–w4) = (2, 4, 6, 9) and m = 18, then the values of u(1) and ĉ(1) respectively are The upper bound on the time complexity of the nondeterministic sorting algorithm isĩ. What is the value to find the reachability of the problem with which you can say the solution is reachable or not?Ĩ. The values for less(i), less(j) where i =5, j =7 areħ. The values for the position(i), position(j) where i = 14 and j =11, areĦ.
What is the value of ‘x’ used to find the reachability of the solution?ĥ. What are the entries of the array TREE for the above weighted binary tree for the TVS problem.Ĥ.ğor a 15-puzzle problem let the initial arrangement be the following one, then answer the questions 4 – 7 with the following arrangement. The following is a weighted binary tree, then what is the weighted array for the TVS problem?
If all c(i, j )’s and r(i, j)’s are calculated, then OBST algorithm in worst case takes one of the following time.Ģ. You can use this question paper in your studies and it will provide you basic information about the paper pattern.ġ.
#MSCIT EXAM QUESTION PDF#
For practice provide me some MSCIT Object Questions.Īs you required for the MSCIT objective types of the question paper, here I am uploading a PDF file having the same.
0 kommentar(er)
