My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

UGC NET COMPUTER DECEMBER (PAPER II) 2019

Review the key details, then start the test when you are ready. You can also open the full package to see related papers.

Questions 100
Duration 180 mins
Package UGC NET & SET - Previous Year Papers

Paper pattern & analysis

Filter this paper by subject, topic or subtopic. Every graph updates from the selected questions.

Explore previous papers
Showing all 100 questions in this paper.

Subject distribution

No subject classification is available.

Topic distribution

No topic classification is available.

Subtopic distribution

No subtopic classification is available.

Difficulty distribution

Medium 68 68%
Hard 31 31%
Easy 1 1%

Question type distribution

Multiple Choices 100 100%

Instructions

Demo Instruction

Syllabus

Sample

Sample questions from this paper

Questions are selected across the paper subjects wherever the paper contains that variety.

1
2019 · Unclassified
UGC NET COMPUTER DECEMBER (PAPER II) 2019
A basic feasible solution of an m x n transportation problem is said to be non-degenerate, if basic feasible solution contains exactly ___________ number of individual allocation in ________ positions.
A
m + n + 1, independent
B
m + n – 1, independent
C
m – n + 1, independent
D
m + n – 1, appropriate
2
2019 · Unclassified
UGC NET COMPUTER DECEMBER (PAPER II) 2019
Consider the following Linear programming problem (LPP):
Maximize z = x1 + x2
Subject to the constraints:
x1 + 2x2≤ 2000
x1 + x2≤ 1500
x2≤ 600
and x1, x2≥ 0
The solution of the above LPP is:
A
x1= 750, x2 = 750, z = 1500
B
x1= 500, x2 = 1000, z = 1500
C
x1= 1000, x2 = 500, z = 1500
D
x1 = 900, x2 = 600, z = 1500
3
2019 · Unclassified
UGC NET COMPUTER DECEMBER (PAPER II) 2019
The Boolean expression AB + AB’ + A’C + AC is unaffected by the value of the Boolean variable _________.
A
A
B
B
C
A, B and C
D
C
4
2019 · Unclassified
UGC NET COMPUTER DECEMBER (PAPER II) 2019
What are the greatest lower bound (GLB) and the least upper bound (LUB) of the sets A = {3, 9, 12} and B = {1, 2, 4, 5, 10} if they exist in poset (z+, /)?
A
A (GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)
B
A (GLB – 1, LUB – 36); B(GLB – 2, LUB – 20)
C
A (GLB – 1, LUB – 12); B(GLB – 2, LUB – 10)
D
A (GLB – 3, LUB – 12); B(GLB – 1, LUB – 10)
5
2019 · Unclassified
UGC NET COMPUTER DECEMBER (PAPER II) 2019
Let P be the set of all people. Let R be a binary relation on P such that (a, b) is in R if a is a brother of b. Is R symmetric transitive, an equivalence relation, a partial order relation?
A
NO, NO, NO, NO
B
NO, NO, YES, NO
C
NO, YES, NO, NO
D
NO, YES, YES, NO
6
2019 · Unclassified
UGC NET COMPUTER DECEMBER (PAPER II) 2019
The weight of minimum spanning tree in graph G, calculated using Kruskal’s algorithm is:
A
14
B
15
C
18
D
17