NTA UGC NET Computer Science Solved Paper II June 2019 - Part 4

61.         A processor can support a maximum memory of 4 GB where memory is word addressable and a word is 2 bytes. What will be the size of the address bus of the processor?
(a) At least 28 bits                (b) At least 2 bytes
(c) At least 31 bits                (d) Minimum 4 bytes
Answer: (c)
62.         Match List-I with List-II:
List-I               List-II
A. Disk             1. Thread
B. CPU            2. Signal
C. Memory       3. File system
D. Interrupt      4. Virtual address space

Choose the correct option from those given below:
(a) A-1, B-2, C-3, D-4                     (b) A-3, B-1, C-4, D-2
(c) A-2, B-1, C-4, D-3                     (d) A-2, B-4, C-3, D-1
Answer: (b)
63.         The RSA encryption algorithm also works in reverse, that is, you can encrypt a message with the private key and decrypt it using the public key. This property is used in
(a) intrusion detection systems
(b) digital signatures
(c) data compression
(d) certification
Answer: (b)
64.         What is the name of the protocol that allows a client to send a broadcast message with its MAC address and receive an IP address in reply ?
(a) ARP           (b) DNS
(c) RARP         (d) ICMP
Answer: (c)
65.         How many ways are there to place 8 indistinguishable balls into four distinguishable bins?
(a) 70              (b) 165
(c) 8C4             (d) 8P4
Answer: (b)
66.         Hadoop (a big data tool) works with number of related tools. Choose from the following, the common tools included into Hadoop:
(a) MySQL, Google API and Map reduce
(b) Map reduce, Scala and Hummer
(c) Map reduce, H Base and Hive
(d) Map reduce, Hummer and Heron
Answer: (c)
67.         At a particular time of computation, the value of a counting semaphore is 7. Then 20 P (wait) operations and 15V (signal) operations are completed on this semaphore. What is the resulting value of the semaphore?
(a) 28              (b) 12
(c) 2                (d) 42
Answer: (c)
68.         What is the output of the following JAVA program?
public class Good {
private int m;
public Good (int m) {this·m = m;}
public Boolean equals (Good n) {return n·m==m;}
public static void main (string args[ ]){
Good m1 = new Good (22);
Good m2 = new Good (22);
Object s1 = new Good (22);
Object s2 = new Good (22);
System·out·println (m1·equals (m2));
System·out·println (s1·equals (s2));
System·out·println (m1·equals (s2));
System·out·println (s1·equals (m2));
}
}
(a) True, True, False, False            (b) True, False, True, False
(c) True, True, False, True              (d) True, False, False, False
Answer: Marks to all
69.         Consider the poset ({3, 5, 9, 15, 24, 45}, | ). Which of the following is correct for the given poset?
(a) There exists a greatest element and a least element.
(b) There exists a greatest element but not a least element.
(c) There exists a least element but not a greatest element.
(d) There does not exist a greatest element and a least element.
Answer: (d)
70.     Consider the complexity class CO – NP as the set of languages L such that
and the following two statements:
S1 : P CO – NP
S2 : If NP ≠ CO – NP, then P ≠ NP
Which of the following is/are correct?
(a) Only S1                (b) Only S2
(c) Both S1 and S2     (d) Neither S1 nor S2
Answer: (c)
71.     Consider three CPU intensive processes, which require 10, 20 and 30 units of time and arrive at times 0, 2 and 6 respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.
(a) 4                (b) 2
(c) 3                (d) 1
Answer: (b)
72.     The value of the derivative of Sigmoid function given by
at x = 0 is
(a) 0                (b) 1/2
(c) 1/4             (d) ∞
Answer: (b)
73.     Find the zero-one matrix of the transitive closure of the relation given by the matrix A :
Answer: (a)
74.     Match List-I with List-II:
List-I                                             List-II
A. Prim’s algorithm                         1. O(V3 log V)
B. Dijkstra’s algorithm                     2. O(VE2)
C. Faster all-pairs shortest path      3. O(E log V)
D. Edmonds-Karp algorithm            4. O(V2)
Choose the correct option from those given below:
(a) A-2, B-4, C-1, D-3                     (b) A-3, B-4, C-1, D-2
(c) A-2, B-1, C-4, D-3                     (d) A-3, B-1, C-4, D-2
Answer: (b)
75.     In relational databases, if relation R is in BCNF, then which of the following is true about relation R?
(a) R is in 4 NF
(b) R is not in 1 NF
(c) R is in 2 NF and not in 3 NF
(d) R is in 2 NF and 3 NF
Answer: (d)
76.     What percentage (%) of the IPv4, IP address space do all class C addresses consume?
(a) 12.5 %                 (b) 25 %
(c) 37.5 %                  (d) 50 %
Answer: (a)
77.     How many states are there in a minimum state automata equivalent to regular expression given below?
Regular expression is a*b(a+b).
(a) 1                (b) 2
(c) 3                (d) 4
Answer: (c)
78.     Which of the following are NOT shared by the threads of the same process?
(1) Stack                    (2) Registers
(3) Address space      (4) Message queue

(a) (1) and (4)            (b) (2) and (3)
(c) (1) and (2)            (d) (1), (2) and (3)
Answer: (c)
79.     Which of the following is application of depth-first-search?
(a) Only topological sort
(b) Only strongly connected components
(c) Both topological sort and strongly connected components
(d) Neither topological sort nor strongly connected components
Answer: (c)
80.     Consider the following statements regarding 2D transforms in computer graphics:
What can you say about the statements S1 and S2 ?
(a) Both S1 and S2 are true
(b) Only S1 is true
(c) Only S2 is true
(d) Both S1 and S2 are false
Answer: (b)

Post a comment

0 Comments