U.G.C. NET Exam. June, 2020 Paper II (COMPUTER SCIENCE & APPLICATIONS)

Arrange one below the other the XOR operations.
for correcting the d-bit error hamming distance should be 2d + 1.
So, 2d + 1 = 5
d = 2. It means the hamming distance b/w the code word 0000000111 and given options should be 2-bits only options 1 match.

Sender side - Rule-1 Sender sends one data packet at a time. Rule-2 Sender sends the next packet only when it receives the acknowledgment of the pervious packet. Receiver side -

Rules- 1 Receive and then consume the data packet.
Rule-2 When the data packet is consumed receiver sends the acknowledgment to the sender.

• The idea of stop and wait protocol in the receivers side is also very simple consumed the acknowledgment is sent this know as a flow control mechanism

The "process of removing detail" from a given state representation is called an abstraction.
• Abstraction is a type artificial Intelligence problem formulation and problem solving process.

Every all program has to do the process of searching for the solution steps that are not explicit in nature.
• Knowledge plays a vital role in intelligence as well as creating artificial intelligence.
• Hence the incorrect statements. it work on or implements a repetition mechanism.

f(x) = x is my friend

In Boolean logic conjunctive normal or CNF means the product of sums (POS) which clearly states that is a product of clauses which in turn are the sum of literals.
Ex. y' = (A + B)(A' + B)
y is in the form of conjunctive normal form it is a product of (A + B) and (A' + B) which are sums of A and B, A' and B.

If a binary relation R over a set X relates every element of x to itself. It is said to be reflexive since (c. e) and (a, d) is not given in the given question it is not reflexive.
• A binary relation is anti symmetric is there is no pair of distinct elements of X each of which is related by R to the other. The given relation R is anti symmetric because for (c, d), (d, c) is not present in R. Similarly for (c, g) and (d, g).
A binary relation is a type of binary relation An example is the relation is equal to because it a = b is true then b = a is also true.
Here since (c, d) is pair in a given relations R for which (d, c) is not present in it. So it violates the symmetric property of the relation, Hence it is not symmetric.

For C and E to be true should be P(c)∩Q(c). Hence, this is not a correct inference.
• In predicate logic universal generalization states that if ... p(x) has been derived then...∀xP(x) can be derived.