PREVIOUS YEAR SOLVED PAPERS - November 2017 Paper 3

Avatto > > UGC NET COMPUTER SCIENCE > > PREVIOUS YEAR SOLVED PAPERS > > November 2017 Paper 3

66. For any binary (n, h) linear code with minimum distance (2t+1) or greater

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

67. Which of the following is a valid reason for causing degeneracy in a transportation problem?
Here m is no. of rows and n is no. of columns in transportation table.

Answer
Comment
Array

Option : C
Explanation :
When the number of allocations is less than m+n−1, it causes degeneracy in transportation problem. So, option (C) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

68. Consider the following LPP :
Max Z = 15x₁ + 10x₂
Subject to the constraints
4x₁ + 6x₂ ≤ 360
3x₁ + 0x₂ ≤ 180
0x₁ + 5x₂ ≤ 200
x₁, x₂ / 0
The solution of the LPP using Graphical solution technique is :

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

69. Consider the following LPP :
Min Z = 2x₁ + x₂ + 3x₃
Subject to :
x₁ − 2x₂ + x₃ ≥ 4
2x₁ + x₂ + x₃ ≤ 8
x₁ − x₃ ≥ 0
x₁, x₂, x₃ ≥ 0
The solution of this LPP using Dual Simplex Method is :

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

70. Consider a Takagi - Sugeno - Kang (TSK) Model consisting rules of the form: If X_i is A_i1 and... and x_r is A_ir THEN y = f_i(x₁, x₂,.... x_r) = b_i0 + b_i1x₁ + b_irx_r assume, a_i is the matching degree of rule i, then the total output of the model is given by:

A
B
C
D

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
November 2017 Paper 3

Forgot your password?

I agree with the Terms.