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

21.         Consider the following two statements with respect to IPv4 in computer networking:
P: The loopback (IP) address is a member of class B network.
Q: The loopback (IP) address is used to send a packet from host to itself.
What can you say about the statements P and Q?
(a) P-True, Q-False    (b) P-False, Q-True
(c) P-True, Q-True     (d) P-False, Q-False
Answer: (b)
22.         Which of the following is best running time to sort n integers in the range 0 to n2 – 1 ?
(a) O(log n)                (b) O(n)
(c) O(n log n)             (d) O(n2)
Answer: (b)
23.         How many address lines and data lines are required to provide a memory capacity of 16K × 16 ?
(a) 10, 4          (b) 16, 16
(c) 14, 16         (d) 4, 16
Answer: (c)
24.         You are designing a link layer protocol for a link with bandwidth of 1 Gbps (109 bits/second) over a fiber link with length of 800 km. Assume the speed of light in this medium is 200000 km/second. What is the propagation delay in this link?
(a) 1 millisecond         (b) 2 milliseconds
(c) 3 milliseconds       (d) 4 milliseconds
Answer: (d)
25.         Which of the following is an example of unsupervised neural network?
(a) Back-propagation network
(b) Hebb network
(c) Associative memory network
(d) Self-organizing feature map
Answer: (d)
26.         In the context of 3D computer graphics, which of the following statements is/are true ?
P: Orthographic transformations keep parallel lines parallel.
Q: Orthographic transformations are affine transformations.
Select the correct answer from the options given below:
(a) Both P and Q        (b) Neither P nor Q
(c) Only P                  (d) Only Q
Answer: (a)
27.         How many different Boolean functions of degree n are there?
(a) 22^n
(b) (22)n
(c) 22^n -1
(d) 2n
Answer: (a)
28.         Which of the following key constraints is required for functioning of foreign key in the context of relational databases?
(a) Unique key           (b) Primary key
(c) Candidate key       (d) Check key
Answer: (b)
29.         On translating the expression given below into quadruple representation, how many operations are required?
(i * j) + (e + f) * (a * b + c)
(a) 5      (b) 6
(c) 3      (d) 7
Answer: (b)
30.     Consider the game tree given below:

   represents Min and Max nodes respectively. The value of 
        the root node of the game tree is
(a) 4                (b) 7
(c) 11              (d) 12
Answer: (b)
31.     Which of the following statements is/are TRUE ?
P : In a scripting language like JavaScript, types are typically associated with values, not variables.
Q : It is not possible to show images on a web page without the <img> tag of HTML.
Select the correct answer from the options given below:
(a) P only                   (b) Q only
(c) Both P and Q        (d) Neither P nor Q
Answer: (a)
32.     Consider the following steps:
S1 : Characterize the structure of an optimal solution.
S2 : Compute the value of an optimal solution in bottom-up fashion.
Which of the step(s) is/are common to both dynamic programming and greedy algorithms?
(a) Only S1                (b) Only S2
(c) Both S1 and S2     (d) Neither S1 nor S2
Answer: (a)
33.     The STRIPS representation is
(a) a feature-centric representation.
(b) an action-centric representation.
(c) a combination of feature-centric and action-centric representations.
(d) a hierarchical feature-centric representation.
Answer: (b)
34.     How can the decision algorithm be constructed for deciding whether context-free language L is finite ?
(1) By constructing redundant CFG G in CNF generating language L.
(2) By constructing non-redundant CFG G in CNF generating language L.
(3) By constructing non-redundant CFG G in CNF generating language L – {˄} (˄ stands for null)
Which of the following is correct?
(a) (1) only       (b) (2) only
(c) (3) only       (d) None of (1), (2) and (3)
Answer: (c)
35.     In relational database management, which of the following is/are property/properties of candidate key ?
P : Uniqueness
Q : Irreducibility
(a) P only                   (b) Q only
(c) Both P and Q        (d) Neither P nor Q
Answer: (c)
36.     A fully connected network topology is a topology in which there is a direct link between all pairs of nodes. Given a fully connected network with n nodes, the number of direct links as a function of n can be expressed as
(a) n(n+1)/2
(b) (n+1)/2
(c) n/2
(d) n(n-1)/2
Answer: (d)
37.     Match List-I with List-II:
List-I                      List-II
A. Greedy best-first    1. Minimal cost (p) + h(p)
B. Lowest cost-first     2. Minimal h(p)
C. A* algorithm           3. Minimal cost (p)

Choose the correct option from those given below:
(a) A-1, B-2, C-3        (b) A-3, B-2, C-1
(c) A-1, B-3, C-2        (d) A-2, B-3, C-1
Answer: (d)
38.     Replacing the expression 4 * 2.14 by 8.56 is known as
(a) constant folding               (b) induction variable
(c) strength reduction           (d) code reduction
Answer: (a)
39.     A Web application and its support environment has not been fully fortified against attack. Web engineers estimate that the likelihood of repelling an attack is only 30 percent. The application does not contain sensitive or controversial information, so the threat probability is 25 percent. What is the integrity of the web application?
(a) 0.625          (b) 0.725
(c) 0.775          (d) 0.825
Answer: (d)
40.     Consider the following properties with respect to a flow network G = (V, E) in which a flow is a real-valued function f : V x V → R :
Which one of the following is/are correct?
(a) Only P1                (b) Only P2
(c) Both P1 and P2     (d) Neither P1 nor P2
Answer: (a)

Post a comment

0 Comments