CBSE UGC NET Computer Science Paper III Solved January 2017

68. With respect to a loop in the transportation table, which one of the following is not correct?
(1) Every loop has an odd no. of cells and at least 5.
(2) Closed loops may or may not b square in shape.
(3) All the cells in the loop that have a plus or minus sign, except the starting cell, must be
occupied cells.
(4) Every loop has an even no. of cells and at least four.
Answer: 1
69. At which of the following stage(s), the degeneracy do not occur in transportation problem?
(m, n represents number of sources and destinations respectively)
(a) While the values of dual variables ui and vj cannot be computed.
(b) While obtaining an initial solution, we may have less than m + n -1 allocations.
(c) At any stage while moving towards optimal solution, when two or more occupied cells with
the same minimum allocation become unoccupied simultaneously.
(d) At a stage when the no. of +ve allocation is exactly m + n - 1.
(1) (a), (b) and (c)
(2) (a), (c) and (d)
(3) (a) and (d)
(4) (a), (b), (c) and (d)
Answer: 3

70. Consider the following LPP:

Min. Z = x1+x2+x3
Subject to 3x1 + 4x3 5
5x1 + x2 + 6x3 =7
8x1 + 9x3 2
x1, x2, x3 0
The standard form of this LPP shall be:
(1) Min. Z = x1 + x2 + x3 + 0x4 + 0x5
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 =7;
8x1 + 9x3 - x5 = 2;
x1, x2, x3, x4, x5 0
(2) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 -1(x6)-1(x7)
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 +x6 = 7;
8x1 + 9x3 - x5 + x7 = 2;
x1 to x7 0
(3) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6
Subject to 3x1 + 4x3 + x4 = 5;
5x1 + x2 + 6x3 = 7;
8x1 + 9x3 - x5 + x6 = 2;
x1 to x6 0
(4) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 + 0x6+ 0x7
Subject to 3x1 + 4x3 + x4 = 5;
 5x1 + x2 + 6x3 + x6 = 7;
8x1 + 9x3 - x5 + x7 = 2;
x1 to x7 0
Answer: 1

UGC NET Computer Science Paper III August 2016

61. Consider the following linear programming problem:
Max. z = 0.50x2 0.10x1
Subject to the constraints
2x1 + 5x2 80
x1 + x2 20
and x1, x2 0
The total maximum profit (z) for the above problem is:
(A) 6 (B) 8
(C) 10 (D) 12
Answer: B
62. Consider the following statements:
(a) If primal (dual) problem has a finite optimal solution, then its dual (primal)
problem has a finite optimal solution.
(b) If primal (dual) problem has an unbounded optimum solution, then its dual
(primal) has no feasible solution at all.
(c) Both primal and dual problems may be infeasible.
Which of the following is correct?
(A) (a) and (b) only (B) (a) and (c) only
(C) (b) and (c) only (D) (a), (b) and (c)
Answer: D
63. Consider the following statements :
(a) Assignment problem can be used to minimize the cost.
(b) Assignment problem is a special case of transportation problem.
(c) Assignment problem requires that only one activity be assigned to each
resource.
Which of the following options is correct?
(A) (a) and (b) only (B) (a) and (c) only
(C) (b) and (c) only (D) (a), (b) and (c)
Answer: D

CBSE UGC NET Computer Science Paper III Solved July 2016

61. The region of feasible solution of a linear programming problem has

a ............... property in geometry, provided the feasible solution of the problem
exists.
(A) concavity (B) convexity
(C) quadratic (D) polyhedron
Answer: B
62. Consider the following statements:
 (a) Revised simplex method requires lesser computations than the simplex
method.
(b) Revised simplex method automatically generates the inverse of the current
basis matrix.
(c) Less number of entries are needed in each table of revised simplex method
than usual simplex method.
Which of these statements are correct?
(A) (a) and (b) only (B) (a) and (c) only
(C) (b) and (c) only (D) (a), (b) and (c)
Answer: D
63. The following transportation problem:

The above solution of a given transportation problem is

(A) infeasible solution (B) optimum solution
(C) non-optimum solution (D) unbounded solution
Answer: B

CBSE UGC NET Computer Science Paper III Solved June 2015
67. In the Hungarian method for solving assignment problem, an optimal
assignment requires that the maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to the number of:
(A) rows or columns (B) rows+columns
(C) rows+columns-1 (D) rows+columns+1
Answer: A
68. Consider the following transportation problem:

The initial basic feasible solution of the above transportation problem using
Vogels Approximation Method(VAM) is given below:
 The solution of the above problem:
(A) is degenerate solution (B) is optimum solution
(C) needs to improve (D) is infeasible solution
Answer: B
69. Given the following statements with respect to linear programming problem:
S1: The dual of the dual linear programming problem is again the primal problem
S2: If either the primal or the dual problem has an unbounded objective function
value, the other problem has no feasible solution
S3: If either the primal or dual problem has a finite optimal solution, the other one
also possesses the same, and the optimal value of the objective functions of the
two problems are equal.
Which of the following is true?
(A) S1 and S2 (B) S1 and S3
(B) S2 and S3 (D) S1, S2 and S2
Answer: D
70. Consider the two class classification task that consists of the following points:
Class C1: [1 1.5] [1 -1.5]
Class C2: [-2 2.5] [-2 -2.5]
The decision boundary between the two classes using single perceptron is given
by:
(A) x1+x2+1.5=0 (B) x1+x2-1.5=0
(C) x1+1.5=0 (D) x1-1.5=0
Answer: C

CBSE UGC NET Computer Science Paper III Solved December 2015

52. A basic feasible solution of a linear programming problem is said to

be ............... if at least one of the basic variable is zero.
(A) degenerate (B) non-degenerate
(C) infeasible (D) unbounded
Answer: A
53. Consider the following conditions :
(a) The solution must be feasible, i.e. it must satisfy all the supply and demand
constraints.
(b) The number of positive allocations must be equal to m+n-1, where m is the
number
of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.
The initial solution of a transportation problem is said to be non-degenerate basic
feasible solution if it satisfies :
Codes :
 (A) (a) and (b) only (B) (a) and (c) only
(C) (b) and (c) only (D) (a), (b) and (c)
Answer: D
54. Consider the following transportation problem :

The transportation cost in the initial basic feasible solution of the above
transportation problem using Vogels Approximation method is :
(A) 1450 (B) 1465
(C) 1480 (D) 1520
Answer: B

CBSE UGC NET Computer Science Paper II Solved December 2015

41. Loop unrolling is a code optimization technique:
(A) that avoids tests at every iteration of the loop
(B) that improves performance by decreasing the number of instructions in a basic
block.
(C) that exchanges inner loops with outer loops
(D) that reorders operations to allow multiple computations to happen in parallel.
Answer: A

UGC NET December 2013 question paper -III

1. 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

2. Given the problem to maximize

f(x), X = (xl,x2,.......xn) subject to m number of inequality constraints.
g(X)<bi, i= 1,2.....m
including the non-negativity constraints x > 0.
Which of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at x' ?

Ans: (D)
did not understand

3. The following Linear Programming problem has :

Max Z = x1 + X2
Subject to x1 -x2 >0
3x1 - x2 > 0
and x1,x2 > 0
(A) Feasible solution
(B) No feasible solution
(C) Unbounded solution
(D) Single point as solution
did not understand

4. 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
Cyclomatic complexity has a foundation in graph theory and provides us with an
extremely useful software metric. Complexity is computed in one of three ways:
1. The number of regions of the flow graph correspond to the cyclomatic complexity.
2.Cyclomatic complexity, V(G), for a flow graph,G,is defined asV(G) =E-N+ 2
where E is the number of flow graph edges,
N is the number of flow graph nodes.
3.Cyclomatic complexity, V (G), for a flow graph, G, is also defined as
V(G) =P+ 1
where P is the number of predicate nodes contained in the flow graph G.
v(g)= 13-1+2=4
v(g)= P+1
P=4+1=5

ugc net june 2013 p3

23. At any iteration of simplex method, if j (Zj - Cj) corresponding to any nonbasic variable Xj is
obtained as zero, the solution under the test is
(A) Degenerate solution
(B) Unbounded solution
(C) Alternative solution
(D) Optimal solution

24. A basic feasible solution to a m-origin, n-destination transportation problem is said to be _______ if
the number of positive allocations are less than m + n - 1.
(A) degenerate
(B) non-degenerate
(C) unbounded
(D) unbalanced

25. The total transportation cost in an initial basic feasible solution to the following transportation
problem
using Vogel's Approximation method is

W1 W2 W3 W4 W5 Supply
F1 4 2 3 2 6 8
F2 5 4 5 2 1 12
 F3 6 5 4 7 3 14
Demand 4 4 6 8 8
(A) 76 (B) 80 (C) 90 (D) 96

net 12 p3
12. Let V1 = 2I - J + K and V2 = I + J - K, then the angle between V1 & V2 and a vector
perpendicular to both V1 & V2 shall be
(A) 90and(-2I + J-3K)
(B) 60and(2I + J + 3K)
(C) 90and(2I + J-3K)
(D) 90and(-2I-J + 3K)
Note: Both A & C are correct answers
did not understand

18. In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables,
then the possible number of basic solutions are
(A) 6
(B) 8
(C) 10
(D) 12
did not understand

24. If dual has an unbounded solution, then its corresponding primal has
(A) no feasible solution
(B) unbounded solution
(C) feasible solution
(D) none of these

74. A* algorithm is guaranteed to find an optimal solution if

(A) h' is always 0.
(B) g is always 1.
(C) h' never overestimates h.
(D) h' never underestimates h.

ugc net june 2012 p3

2. In Delta Rule for error minimization
(A) weights are adjusted w.r.to change in the output
(B) weights are adjusted w.r.to difference between desired output and actual output
(C) weights are adjusted w.r.to difference between input and output
(D) none of the above

46. The feasible region represented by the constraints

x1- x2 1, x1 + x2 3, x1 0, x2 0 of the objective function
Max Z = 3x1+ 2x2 is
(A) A polygon
(B) Unbounded feasible region
(C) A point
(D) None of these

49. In any simplex table, if corresponding to any negative j, all elements of the column are negative or
zero, the solution under the test is
(A) degenerate solution
(B) unbounded solution
(C) alternative solution
(D) non-existing solution

51. The strategy used to reduce the number of tree branches and the number of static evaluations
applied in case of a game tree is
(A) Minmax strategy
(B) Alpha-beta pruning strategy
(C) Constraint satisfaction strategy
(D) Static max strategy

62. The optimal solution of the following assignment problem using Hungarian method is

(A) (B) (C) (D)

(A) (I) (II) (III) (IV)
(B) (I) (III) (II) (IV)
(C) (I) (III) (IV) (II)
(D) (I) (IV) (II) (III)
Explanation:

ugc net dec 2011 p2