# NTA UGC NET Computer Science Paper II Solved July 2018 - Part 5

81.       E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by:
(1) O (Ef)
(2) O (E2f)
(3) O (Ef2)
(4) O (E2f2)
82.       Which of the following statements is false about convex minimization problem?
(1) If a local minimum exists, then it is a global minimum
(2) The set of all global minima is convex set
(3) The set of all global minima is concave set
(4) For each strictly convex function, if the function has a minimum, then the minimum is unique
83.       The following LPP
Maximize z = 100x1+2x2+5x3
Subject to
14x1+x2−6x3+3x4 = 7
32x1+x2−12x3 ≤ 10
3x1−x2−x3 ≤ 0
x1, x2, x3, x4 ≥ 0
has
(1) Solution: x1=100, x2=0, x3=0
(2) Unbounded solution
(3) No solution
(4) Solution: x1=50, x2=70, x3=60
84.       Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be S={0, 1, 2, .........., 32} where the sample j denote that j of the buffers are full and
p(i) =1/561 (33 - i). Let A denote the event that the even number of buffers are full. Then p(A) is:
(1) 0.515
(2) 0.785
(3) 0.758
(4) 0.485
85.       The equivalence of
¬ x Q(x) is:
(1) x ¬ Q(x)
(2) x ¬ Q(x)
(3) ¬ x ¬ Q(x)
(4) x Q(x)
86.       If Ai = {−i, ... −2,−1, 0, 1, 2, . . . . . i}
(1) Z
(2) Q
(3) R
(4) C
87.       Match the following in List - I and List - II, for a function f:
List - I
(a) ∀x ∀y (f (x)=f (y) → x=y)
(b) ∀y x (f (x)=y)
(c) ∀x f (x)=k
List - II
(i) Constant
(ii) Injective
(iii) Surjective
Code:
(a)  (b)  (c)
(1) (i)   (ii)  (iii)
(2) (iii) (ii)   (i)
(3) (ii)  (i)   (iii)
(4) (ii)  (iii)  (i)
88.       Which of the relations on {0, 1, 2, 3} is an equivalence relation?
(1) { (0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3) }
(2) { (0, 0) (1, 1) (2, 2) (3, 3) }
(3) { (0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0) }
(4) { (0, 0) (0, 2) (2, 3) (1, 1) (2, 2) }
89.       Which of the following is an equivalence relation on the set of all functions from Z to Z?
(1) { (f, g) | f(x)−g(x)=1 x e Z }
(2) { (f, g) | f(0)=g(0) or f (1)=g(1) }
(3) { (f, g) | f(0)=g(1) and f (1)=g(0) }
(4) { (f, g) | f(x)−g(x)=k for some k Z }
90.    Which of the following statements is true?
(1) (Z, ≤ ) is not totally ordered
(2) The set inclusion relation is a partial ordering on the power set of a set S
(3) (Z, ≠ ) is a poset
(4) The directed graph
is not a partial order
91.    CMOS is a Computer Chip on the motherboard, which is:
(1) RAM
(2) ROM
(3) EPROM
(4) Auxillary storage
92.    In RS flip-flop, the output of the flip-flop at time (t+1) is same as the output at time t, after the occurance of a clock pulse if:
(1) S=R=1
(2) S=0, R=1
(3) S=1, R=0
(4) S=R=0
93.    Match the terms in List - I with the options given in List - II :
List - I
(a) Decoder
(b) Multiplexer
(c) De multiplexer
List - II
(i) 1 line to 2n lines
(ii) n lines to 2n lines
(iii) 2n lines to 1 line
(iv) 2n lines to 2n−1 lines
Code:
(a)  (b)  (c)
(1) (ii)  (i)   (iii)
(2) (ii)  (iii)  (i)
(3) (ii)  (i)   (iv)
(4) (iv) (ii)  (i)
94.    What does the following logic diagram represent?
(1) Synchronous Counter
(2) Ripple Counter
(3) Combinational Circuit
(4) Mod 2 Counter
95.    The hexadecimal equivalent of the binary integer number 110101101 is:
(1) D 2 4
(2) 1 B D
(3) 1 A E
(4) 1 A D
96.    Perform the following operation for the binary equivalent of the decimal numbers
(−14)10 + (−15)10
The solution in 8 bit representation is:
(1) 11100011
(2) 00011101
(3) 10011101
(4) 11110011
97.    Match the items in List - I and List - II :
List - I
(a) Interrupts which can be delayed when a much highest priority interrupt has occurred
(b) Unplanned interrupts which occur while executing a program
(c) Source of interrupt is in phase with the system clock
List - II
(i) Normal
(ii) Synchronous
(iv) Exception
Code:
(a)   (b)   (c)
(1) (ii)   (i)    (iv)
(2) (ii)   (iv)  (iii)
(3) (iii)  (i)    (ii)
(4) (iii)  (iv)  (ii)
98.    Which of the following mapping is not used for mapping process in cache memory?
(1) Associative mapping
(2) Direct mapping
(3) Set-Associative mapping
(4) Segmented - page mapping
99.    Simplify the following using K-map:
F (A, B, C, D) = Î£ (0, 1, 2, 8, 9, 12, 13)
d (A, B, C, D) = Î£ (10, 11, 14, 15)
d stands for don’t care condition.
(1) A+B’ D’ + BC
(2) A+B’ D’ + B’ C’
(3) A’+B’ C’
(4) A’+B’ C’+B’ D’
100.    In 8085 microprocessor, what is the output of following program?
LDA 8000H
MVI B, 30H