# NTA UGC NET Computer Science Solved Paper II December 2019 - Part 3

41.         Match List-I with List-II:
List-I                                   List-II
(a) Frame attribute               (i) to create link in HTML
(b) <tr> tag                          (ii) for vertical alignment of content in cell
(c) valign attribute                (iii) to enclose each row in table
(d) <a> tag                          (iv) to specify the side of the table frame that display
border
Choose the correct option from those given below:
(1) (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)               (2) (a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)
(3) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)               (4) (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
42.         The time complexity to multiply two polynomials of degree n using Fast Fourier transform method is:
(1) θ(n lg n)                          (2) θ(n2)
(3) θ(n)                                (4) θ(lg n )
43.         Let Wij represents weight between node i at layer k and node j at layer (k – 1) of a given multilayer perceptron. The weight updation using gradient descent method is given by
Where α and E represents learning rate and Error in the output respectively.
44.         A clique in an undirected graph G = (V, E) is a subset V’ V of vertices, such that
(1) If (u, v) E then u V’ and v V’
(2) If (u, v) E then u V’ or v V’
(3) Each pair of vertices in V’ is connected by an edge
(4) All pairs of vertices in V’ are not connected by an edge
45.         What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all insertions can be accommodated.
(1) θ(1), θ(n)                        (2) θ(n), θ(1)
(3) θ(1), θ(1)                        (4) θ(n), θ(n)
46.         Match List-I and List-II:
List-I                                             List-II
(a) Isolated I/O                               (i) same set of control signal for I/O and memory
communication
(b) Memory mapped I/O                 (ii) separate instructions for I/O and memory
communication
(c) I/O interface                                        (iii) requires control signals to be transmitted
between the communicating units
(d) Asynchronous data trandfer       (iv) resolve the differences in central computer and
peripherals
Choose the correct option from those given below:
(1) (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)               (2) (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
(3) (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)               (4) (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
47.         A network with a bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network?
(1) 1,000,000 bps                 (2) 2,000,000 bps
(3) 12,000,000 bps               (4) 1,200,00,000 bps
48.         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*,/)?
(1) A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)
(2) A(GLB – 3, LUB – 12); B(GLB –1, LUB – 10)
(3) A(GLB –1, LUB – 36); B(GLB – 2, LUB – 20)
(4) A(GLB – 1, LUB – 12); B (GLB – 2, LUB – 10)
49.         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.
(1) m+n+1, independent                 (2) m+n-1, independent
(3) m+n-1, appropriate                   (4) m-n+1, independent
50.     Consider the following language families:
L1 = The context – free languages
L2 = The context – sensitive languages
L3 = The recursively enumerable languages
L4 = The recursive languages
Which one of the following options is correct?
(1) L1 L2 L3 L4                              (2) L2 L1 L3 L4
(3) L1 L2 L4 L3                              (4) L2 L1 L4 L3
51.     Identify the circumstances under which pre-emptive CPU scheduling is used:
(a) A process switches from Running state to Ready state
(b) A process switches from Waiting state to Ready state
(c) A process completes its execution
(d) A process switches from Ready to Waiting state
Choose the correct option:
(1) (a) and (b) only               (2) (a) and (d) only
(3) (c) and (d) only               (4) (a), (b), (c) only
52.     Consider the game tree given below
(1) 14              (2) 17                     (3) 111                   (4) 112
53.     Consider a subnet with 720 routers. If a three-level hierarchy is chosen, with eight clusters, each containing 9 regions of 10 routers, then total number of entries in hierarchical table of each router is
(1) 25              (2) 27                     (3) 53                     (4) 72
54.     An …………… chart is a project schedule representation that presents project plan as a directed graph. The critical path is the …………….. sequence of ……………. tasks and it defines project …………...
(1) Activity, Shortest, Independent, Cost
(2) Activity, Longest, Dependent, Duration
(3) Activity, Longest, Independent, Duration
(4) Activity, Shortest, Dependent, Duration
55.     Piconet is a basic unit of a Bluetooth system consisting of ………….. master node and up to ………….. active salve nodes.
(1) one, five                         (2) one, seven
(3) two, eight                        (4) one, eight
56.     Which of the following interprocess communication model is used to exchange messages among co-operative processes?
(1) Shared memory model
(2) Message passing model
(3) Shared memory and message passing model.
(4) Queues
57.     Consider the following statements:
S1:        If a group (G,*) is of order n, and a G is such that am = e for some integer m≤n, then m must divide n.
S2:        If a group (G,*) is of even order, then there must be an element and a G is such that a ≠ e and a * a = e.
Which of the statements is (are) correct?
(1) Only S1                          (2) Only S2
(3) Both S1 and S2               (4) Neither S1 nor S2
58.     Consider Σ={w,x} and T={x,y,z}. Define homomorphism h by:
h(x)=xzy
h(w)=zxyy
If L is the regular language denoted by r = (w + x*)(ww)*, then the regular language h(L) is given by
(1) (zxyy + xzy)(zxyy)                     (2) (zxyy + (xzy)*)(zxyy zxyy)*
(3) (zxyy + xzy)(zxyy)*                              (4) (zxyy + (xzy)* (zxyy zxyy)
59.     Consider a paging system where translation look aside buffer (TLB) a special type of associative memory is used with hit ratio of 80%.
Assume that memory reference takes 80 nanoseconds and reference time to TLB is 20 nanoseconds. What will be the effective memory access time given 80% hit ratio?
(1) 110 nanoseconds                      (2) 116 nanoseconds
(3) 200 nanoseconds                      (4) 100 nanoseconds