U.G.C. NET Exam. December 2023 Paper II (COMPUTER SCIENCE)

Total Questions: 100

61. The work done by UDP is/are:

(A) Congestion control
(B) Flow control
(C) Retransmission
(D) Segment transmission
Choose the correct answer from the options given below:

(a) (A) and (D) Only
(b) (C) Only
(c) (D) Only
(d) (B) and (C) Only

Correct Answer: (c) (D) Only

Solution:

UDP (User Datagram Protocol) is a connectionless protocol that operates at the Transport Layer of the a network without the need for establishing a connection. UDP does not provide features like congestion control, Flow control or retransmission of lost packets. It simply encapsulates the data into datagram's (segments) and transmits them without any guarantee of delivery or ordering.

62. Which of the following statement/s is/are NOT CORRECT?

(A) OSPF is based on distance-vector routing protocol.
(B) Both link-state and distance-vector routing are based on the least cost goal.
(C) BGP4 is based on the path-vector algorithm.
(D) The three-node instability can be avoided using split horizon combined with poison reverse.
(E) RIP is based on link state algorithm.
Choose the correct answer from the options given below:

(a) (A), (D) and (E) Only
(b) (A) and (B) Only
(c) (B) and (C) Only
(d) (B), (C) and (E) Only

Correct Answer: (a) (A), (D) and (E) Only

Solution:

QSPF is based on distance- vector routing protocol. This statement is incorrect. OSPE (Open shortest path first) is a link- state routing protocol, not distance- vector.
The three node instability can be avoided using split horizon combined with poison reverse. This statement is incorrect split horizon and poison reverse are techniques used to avoid the count to infinity problem in distance vector routing protocols. RIP is based on link state algorithm. This statement is also incorrect. RIP (Routing Information Protocol) is a distance vector routing protocol, not a link state.

63. Which of the following statement/s are CORRECT?

(A) NRZ is a bipolar scheme in which the positive voltage define bit is 0 (zero).
(B) NRZ-L and NRZ-I both have an average signal rate of N/2
(C) The idea of RZ and NRZ-L are combined into Manchester scheme.
(D) NRZ-L and NRZ-I both have DC component problems.
(E) The minimum bandwidth of Manchester and differential Manchester is 3 times that of NRZ
Choose the correct answer from the options given below :

(a) (A), (B) and (C) Only
(b) (A), (C), (D) and (E) Only
(c) (B), (C) and (D) Only
(d) (A), (B), (C) and (E) Only

Correct Answer: (c) (B), (C) and (D) Only

Solution:

All correct explanation.
(A) NRZ is a bipolar scheme in which the positive voltage define bit 1, not 0.
(B) NRZ-L and NRZ-I both have an average signal rate of N/2.
(C) The idea of RZ and NRZ-L are combined into Manchester scheme.
(D) Both NRZ-L and NRZ-I have DC component problems.
(E) The minimum bandwidth of Manchester and differential Manchester is 3 times that of NRZ, not 3 time.
So correct answer is (c) (B) (C) and (D) only.

64. Which of the following are commonly used parsing techniques in NLP (Natural Language Processing) for syntactic analysis.

(A) Top down parsing
(B) Bottom Up parsing
(C) Dependency parsing
(D) Statistical machine translation
(E) Early parsing
Choose the correct answer from the options given below :

(a) (A), (C), (D), (E) Only
(b) (B), (C), (D), (E) Only
(c) (A), (B), (C), (E) Only
(d) (A) and (B) Only

Correct Answer: (c) (A), (B), (C), (E) Only

Solution:

The commonly used parsing techniques in LNP. for syntactic analysis are-
(1) Top-down parsing
(2) Bottom-up parsing
(3) Dependency parsing
(5) Early parsing
(4) Statistical machine translation is not a parsing technique.It is a method used for translation form on language to another statistical models.

65. In the content of Alpha Beta pruning in game trees which of the following statements are correct regarding cut off procedures?

(A) Alpha Beta pruning can eliminate sub trees with certainly when certainly when the value of a node exceeds both the alpha and beta bonds.
(B) The primarily purpose of Alpha-Beta pruning is to save computation time by searching fewer nodes in the same tree.
(C) Alpha Beta pruning guarantees the optimal solution in all cases by exploring the entire game tree.
(D) Alpha and Beta bonds are initialized to negative and positive infinity respectively at the root note.
Choose the correct answer from the options given below :

(a) (A), (C), (D) Only
(b) (B), (C), (D) Only
(c) (A), (B), (D) Only
(d) (C), (B) Only

Correct Answer: (c) (A), (B), (D) Only

Solution:

The correct statement regarding cutoff procedures in Alpha Beta pruning are.
(A) Alpha Beta pruning can eliminate subtrees with certainty when the value of a node exceeds both the alpha and beta bounds.
(B) The primary purpose of Alpha Beta pruning is to save computation time by searching fewer nodes in the same tree.
(C) Alpha and Berta bounds are initialized to negative and positive infinity respectively at the root node.
So the correct answer would be - (A), (B) and (D).