U.G.C. NET Exam. December 2022 Paper II (COMPUTER SCIENCE) And Applicatation.

Total Questions: 100

81. Given below are two statements: one is labeled as Assertion A and the other is labelled as Reason R.

Assertion A : Cohesion is a qualitative indication of the degree to which a module can be written more compactly and is able to complete its function in a timely manner.
Reason R : Cohesion is a qualitative indication of the degree to which a module is connected to other modules and the outside world.
In the light of the above statements, choose the most appropriate answer from the options givens given below.

Correct Answer: (c) A is correct but R is not correct.
Solution:

Assertion A : Cohesion is a qualitative indication of the degree to which a module can be written more compactly and is able to complete its function in a timely manner. Coupling between modules/components is their degree of mutual under dependence. So A is correct but R is not correct.

82. Given the graph below which one of the following edges cannot be added in that order to find a minimum spanning tree algorithm.

Correct Answer: (c) B, A, C, E, D
Solution:

Given graph using minimum spanning tree algorithms.

d – f, a – b, b – f, d – e, d – c
So option (c) is correct answer.

83. What is the safest order while simplifying context Free Grammar?

Correct Answer: (a) Elimination of ε-productions, Unit productions and then Useless symbols & productions.
Solution:

Simplifying Context Free Grammar We remove all these redundant productions from a grammar, while keeping the transformed grammars equivalent to the original grammar simplifying CFGs is necessary to later convert them into normal form. Types of redundant production and the procedure of removing them into mentioned below.

84. Rearrange the following sequence in the context of OSI Layers:

A. Transforming the raw bits in the form of frame for transmission
B. Transmission of raw bits over communication channel
C. Handling user interfaces
D. Control and monitoring of subnet
E. Transmission data through connection oriented or connection less using datagrams
Choose the correct answer from the options given below : 

Correct Answer: (c) B-A-D-E-C
Solution:

Sequence in the context of OSI layers–

85. Choose the correct option describing the features of Artificial neural network

A. It is essentially machine learning algorithm.
B. It is useful when solving the problems for which the data set is very large.
C. They are able to extract features without input from the programmer.
D. These are systems modeled on the human brain and nervous system
Choose the correct answer from the options given below :

Correct Answer: (a) All the statements are correct.
Solution:

Features of Neural Network

86. Four persons: P, Q, R and S are in police custody and one of them has committed a crime. They confess as follows:

A. Person P: Q did it.
B. Person Q: S did it.
C. Person R: I did not do it.
D. Person S: Q lied.
If exactly one of the statements is false, which of the following is the guilty person.

Correct Answer: (b) Q
Solution:

Given statement
A. Person P : Q did it
B. Person Q : S did it
C. Person R : I did not do it
D. Person S : Q lied
So guilty person is S and false statement is Q.
So option (b) is correct answer.

87. Assertion A : A Raster scan device is a CRT graphic device and can use a television monitor for display

Reason R : In Raster scan display the picture is composed of a series of dots. These dots are traced out as a series of horizontal lines.
Television words in a similar fashion.
In the light of the above statements, choose the correct answer from the options given below:

Correct Answer: (a) Both A and R are true and R is the correct explanation of A
Solution:

Raster Scan Displays are most common type of graphics monitor which employs CRT. It is based on television technology.
So option (a) is correct answer.

88. An OS follows Round-Robin Scheduling with time quantum of 4ms. Assuming that the CPU is free now and there are 20 processes waiting in the ready queue, the maximum amount of time that a process waits before getting into the CPU is __________.

Correct Answer: (b) 76ms
Solution:

89. Statement 1: Given a graph G = (V, E) in which each vertex v ∈V has an associated positive weight w(v), we can use linear programming to find the lower bound on the weight of the minimum-weight vertex cover.

Correct Answer: (c) Statement I is correct but Statement II is incorrect
Solution:

Given that

90. A TCP Server application is programmed to listen on port on port P on Host S. A TCP Client is connected to the TCP Server over the network. Considered that while TCP Connection is active the server is crashed and rebooted. Assume that the client does not use TCP keepalive timer. Which of the following behaviors is/are possible?

Statement I : If client is waiting to receive a packet, it may wait indefinitely
Statement II : If the client sends a packet after the server reboot, it will receive the FIN segment.
In the light of the above statements, choose the correct answer from the options given below

Correct Answer: (c) Statement I is true but Statement II is false
Solution:

A Keepalive timer is used to prevent a long idle connection between two TCPs So, in absence of TCP Keepaline timer, Statement I is correct. But statement(II) is false.
So option (c) is correct answer.