A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

 21. How many edges are there in a forest of t-trees containing a total of n vertices? a. n + t b. n -t c. n * t d. n^t

 22. Let f and g be the functions from the set of integers to the set integers defined byf(x) = 2x + 3 and g(x) = 3x + 2Then the composition  of f and g and g and f is given as a. 6x+7,  6x+11 b. 6x + 11, 6x + 7 c. 5x + 5, 5x + 5 d. None of the above

 23. A graph is non-planar if and only if it contains a subgraph homomorphic to a. K3, 2 or K5 b. K3,3 and K6 c. K3,3 or K5 d. k2,3 and K5

 24. If the primal Linear Programming problem has unbounded  solution, then it's dual problem will  have a. feasible solution b. alternative solution c. no feasible solution at all d. no bounded solution at all

 25. Given the problem to maximize            f(x), X =(x1, x2 ,..... .xn)subject to m number of inequality constraints  gi(x) ≤ bi  , i = 1, 2 ...... mincluding the non-negativity constraints x ≥ 0 Which of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at x  ? a. ∂L(X ' , λ' , S') / ∂xj = 0 , j= 1,2.....m b. λ[gi(X') -bi]= 0, i =1,2,3...m c. gi (X ') ≤ bi , i = 1,2....m d. All of these

 26. The following Linear Programming problem has :Max                                   Z =x1 +x2Subject to                         = x1-x2 ≥ 0                                                                               3x1 -x2 ≤ -3                                      and                              xI , x2  ≥ 0 a. Feasible solution b. No feasible solution c. Unbounded solution d. Single point as solution

 27. Given a flow graph with 10 nodes,13 edges and one connected components, the number of regions and the number  of predicate (decision) nodes in the flow graph will be a. 4, 5 b. 5, 4 c. 3, 1 d. 13, 8