Tuesday, 11 April 2017

Assistant Professor (Computer Science and Engineering) Solved Paper 123/2016 - Part 4

61.       61
62.       62
63.       63
64.       64
65.       65
66.       66
67.       67
68.       68
69.       69
70.    70
71.    71
72.    Which of the following is likely to be the most expensive cost of quality in Software Engineering?
(A) External Failure Cost
(B) Appraisal Cost
(C) Internal Failure Cost
(D) Prevention Cost
Answer: A
73.    Which is the correct preorder traversal of the following binary tree?
(A) 14,2,1,3,11,10,7,30,40
(B) 14,2,3,1,11,10,30,7,40
(C) 1,2,3,7,10,11,14,30,40
(D) 40,30,14,11,10,7,3,2,1
Answer: X
74.    Suppose we’re debugging a quicksort implementation that is supposed to sort an array in ascending order. After the first partition step has been completed, the contents of the array are in the following order:
3  9  1  18  19  24  22  20
Which of the following statements is correct about the partition step?
(A) The pivot could have been 18, but could not have been 19
(B) The pivot could have been 19, but could not have been 18
(C) The pivot could have been either 18 or 19
(D) Neither 18 nor 19 could have been the pivot
Answer: C
75.    Suppose you were implementing a data structure to store information about the paintings on display at an art dealer’s showroom. Of the following data structures, which one is the right one to use?
(A) Unordered array
(B) Sorted array
(C) Binary search tree
(D) it depends
Answer: D
76.    What is the running time of the following code fragment?
for(int i=0;i<10;i++)
for(int j=0;j<N;j++)
for(int k = N-2; k<N+2; k++)
(A) O(log N)
(B) O(N)
(C) O(N log N)
(D) O(N2)
Answer: B
77.    Breadth first search
(A) Scans each incident node along with its children
(B) Scans all incident edges before moving to other node
(C) Is same as back tracking
(D) Scans all the nodes in random order
Answer: B
78.    The Knapsack problem where the objective function is to minimize the profit is
(A) Greedy
(B) Dynamic
(C) Back tracking
(D) Branch and Bound
Answer: X
79.    Choose the correct answer for the following statements:
I. NP problem can run in polynomial time on a non-deterministic turing machine.
II. All NP complete problem are NP-Hard.
(A) I is false and II is true
(B) I is true and II is false
(C) Both are false
(D) Both are true
Answer: D
80.    A Hamiltonian cycle in a Hamiltonian graph of order 24 has
(A) 12 edges
(B) 23 edges
(C) 24 edges
(D) None of the above
Answer: C

Pages   2   3   4   5 


Post a Comment