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

41.         Consider that a process has been allocated 3 frames and has a sequence of page referencing as : 1, 2, 1, 3, 7, 4, 5, 6, 3, 1
What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string?
(a) 2                (b) 0
(c) 1                (d) 3
Answer: (a)
42.         There are many sorting algorithms based on comparison. The running time of heapsort algorithm is O(n log n). Like P, but unlike Q, heapsort sorts in place where (P, Q) is equal to
(a) Merge sort, Quick sort               (b) Quick sort, Insertion sort
(c) Insertion sort, Quick sort           (d) Insertion sort, Merge sort
Answer: (d)
43.         Which of the following has same expressive power with regard to relational query language ?
(1) Relational algebra and domain relational calculus.
(2) Relational algebra and tuples relational calculus.
(3) Relational algebra and domain relational calculus restricted to safe expression.
(4) Relational algebra and tuples relational calculus restricted to safe expression.

(a) (1) and (2) only               (b) (3) and (4) only
(c) (1) and (3) only               (d) (2) and (4) only
Answer: (b)
44.         Consider the equation (146)b + (313)b-2 = (246)8 . Which of the following is the value of b?
(a) 8                (b) 7
(c) 10              (d) 16
Answer: (b)
45.         How many bit strings of length ten either start with a 1 bit or end with two bits 00 ?
(a) 320            (b) 480
(c) 640             (d) 768
Answer: (c)
46.         In the context of software testing, which of the following statements is/are NOT correct?
P : A minimal test set that achieves 100% path coverage will also achieve 100% statement coverage.
Q: A minimal test set that achieves 100% path coverage will generally detect more faults than one that achieves 100% statement coverage.
R: A minimal test set that achieves 100% statement coverage will generally detect more faults than one that achieves 100 % branch coverage.
(a) R only                   (b) Q only
(c) P and Q only         (d) Q and R only
Answer: (a)
47.         Following table has two attributes Employee_id and Manager_id, where Employee_id is a primary key and manager_id is a foreign key referencing Employee_id with on delete cascade:
On deleting the table (20, 40), the set of other tuples that must be deleted to maintain the referential integrity of table is
(a) (30, 35) only                   (b) (30, 35) and (35, 20) only
(c) (35, 20) only                   (d) (40, 45) and (25, 40) only
Answer: (b)
48.         K-mean clustering algorithm has clustered the given 8 observations into 3 clusters after 1st iterations as follows:
C1 : {(3, 3), (5, 5), (7, 7)}
C2 : {(0, 6), (6, 0), (3, 0)}
C3 : {(8, 8), (4, 4)}

What will be the Manhattan distance for observation (4, 4) from cluster centroid C1 in second iteration?
(a) 2                (b) √2
(c) 0                (d) 18
Answer: (a)
49.         Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine M?
(1) G is a CFG with L(G)=Ф
(2) There exist two TMs M1 and M2 such that L(M) {L(M1) L(M2)} = language of all TMs.
(3) M is a TM that accepts ω using at most 2|ω| cells of tape

(a) (1) and (2) only               (b) (1) only
(c) (1), (2) and (3)                (d) (3) only
Answer: (c)
50.     In the TCP/IP model, encryption and decryption are functions of ………….. layer.
(a) data link                (b) network
(c) transport               (d) application
Answer: (d)
51.     Which type of addressing mode, less number of memory references are required ?
(a) Immediate           (b) Implied
(c) Register                (d) Indexed
Answer: Marks to all
52.     Which of the following statements is/are true with regard to various layers in the Internet stack?
P : At the link layer, a packet of transmitted information is called a frame.
Q : At the network layer, a packet of transmitted information is called a segment.
(a) P only                   (b) Q only
(c) P and Q                (d) Neither P nor Q
Answer: (a)
53.     Which of the following statements are DML statements?
(1) Update [tablename]
Set [columnname] = VALUE
(2) Delete [tablename]
(3) Select * from [tablename]

(a) (1) and (2)            (b) (1) and (4)
(c) (1), (2) and (3)      (d) (2) and (3)
Answer: (c)
54.     Match List-I with List-II:
where    L1 : Regular language
L2 : Context-free language
L3 : Recursive language
L4 : Recursively enumerable language
Choose the correct option from those given below:
(a) A-2, B-1, C-3                  (b) A-2, B-3, C-1
(c) A-3, B-1, C-2                  (d) A-1, B-2, C-3
Answer: (b)
55.     A computer has six tape drives with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
(a) 5                (b) 4
(c) 3                (d) 6
Answer: (a)
56.     Software products need adaptive maintenance for which of the following reasons?
(a) To rectify bugs observed while the system is in use.
(b) When the customers need the product to run on new platforms.
(c) To support the new features that users want it to support.
(d) To overcome wear and tear caused by the repeated use of the software.
Answer: (b)
57.     Which of the following terms best describes Git?
(a) Issue Tracking System
(b) Integrated Development Environment
(c) Distributed Version Control System
(d) Web-based Repository Hosting Service
Answer: (c)
58.     Reinforcement learning can be formalized in terms of …………… in which the agent initially only knows the set of possible ……………. and the set of possible actions.
(a) Markov decision processes, objects
(b) Hidden states, objects
(c) Markov decision processes, states
(d) objects, states
Answer: (c)
59.     Which of the following is principal conjunctive normal form for [(p v q) ˄ ¬p → ¬q]?
(a) p v ¬q                   (b) p v q
(c) ¬p v q                   (d) ¬p v ¬q
Answer: (a)
60.     Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:
4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Assuming that the head is currently 50, what is the time taken to satisfy all requests if it takes 1 ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?
(a) 357 ms       (b) 238 ms
(c) 276 ms       (d) 119 ms
Answer: (d)

Post a comment

0 Comments