U.G.C. NET Exam. December 2022 Paper-II (COMPUTER SCIENCE) and Applicatations.

Total Questions: 100

31. While processing a string by an LR parser, the reading of the given string by the parser is .......

Correct Answer: (b) From left to right
Solution:

The leading of a given string by an LR parser is from left to right. LR (Left-to-right, right most derivation) parser is a type of shift reduce parser used in parsing computer languages. It starts from the leftmost end of the input string and builds the parse tree in a bottom up manner by repeatedly applying shift and reduce operations until the input is completely parsed.
So option (b) is correct.

32. What is the minimum and maximum number of initial, dead, unreachable and final states in a valid 'n' state finite automaton, where the language accepted is not 'ϕ'?

Correct Answer: (d) Minimum : 1, 0, 0, 1; Maximum: 1, (n-1), (n1), n
Solution:

The minimum and maximum number of initial, dead, unreachable, and final state can be defined as follows.

33. Which protocol is used to acquire the MAC address of a host whose IP address is known?

Correct Answer: (b) Address Resolution Protocol
Solution:

Address Resolution Protocol (ARP) is a procedure for mapping a dynamic IP address to permanent physical machine address in a local area network (LAN). The physical machine address is also know as a media access control (MAC) address.

34. In CRC coding if the data word is 111111, divisor is 1010 and the remainder is 110. Which of the following code is true?

Correct Answer: (c) 111111110
Solution:

35. Answer the following question

Correct Answer: (b) 7
Solution:

36. What is the minimum Hamming Distance in a block code if we want to be able to detect up to S errors?

Correct Answer: (b) S+1
Solution:

Hamming distance between two words of the same size is the number of differences between the corresponding bits. It can be calculated by applying the XOR operation.
Formula
To guarantee the detection of up to S errors in all cases the hamming distance in a block code must be d ≥ S + 1
hamming distance be minimum
∴ dmin = S + 1
So option (b) is correct

37. Which search technique is complete and optimal, when h(n) is consitent?

Correct Answer: (c) A* Search
Solution:

When the heuristic function h(n) is consistent (also know as "admissible" or "monotonic", the A* search algorithm becomes both complete and optional.
So option (c) is correct

38. What is the process of capturing inference process as a single inference rule?

Correct Answer: (c) Generalized modus ponens
Solution:

All kinds of inference process can be captured as a single inference rule that can be called as generalized modus ponens.

39. Fuzzy logic is a form of ____

Correct Answer: (d) Many valued logic
Solution:

Fuzzy logic is a form of many-valued logic in which the truth many-valued logic in which the truth value of variable may be any real number between 0 and 1. It is employed to handle the concept of partial truth. Where the truth value may range between completely true and completely false.

40. The 4Ws problem canvas helps in identifying the key elements related to the problem 4Ws problem canvas is a part of ______

Correct Answer: (a) Problem scoping
Solution:

Problem Scoping : Problem scoping means selecting a problem which we might want to solve using our AI knowledge.
Problem scoping is the process of indentifying the scope the problem (like cause, nature or solution of a problem) that you wish to solve with the help of your project. Who What > Where > Why 4Ws problem canvas is a part of problem scoping.
So option (a) is correct.