June 2015 - Paper 3

21:  

The clausal form of the disjunctive normal form ¬ A ˅ ¬ B ˅ ¬ C ˅ D is :

A.

A ˄ B ˄ C ⇒ D

B.

A ˅ B ˅ C ˅ D ⇒ true

C.

A ˄ B ˄ C ˄ D ⇒ true

D.

A ˄ B ˄ C ˄ D ⇒ false

 
 

Option: A

Explanation :

Click on Discuss to view users comments.

Write your comments here:



22:  

Which of the following is false for the programming language PROLOG?

A.

A PROLOG variable can only be assigned to a value once

B.

PROLOG is a strongly typed language

C.

The scope of a variable in PROLOG is a single clause or rule

D.

The scope of a variable in PROLOG is a single query

 
 

Option: B

Explanation :

Prolog is not a strongly typed language, and in fact variables in predicates are not type-restricted in any way. This means that there is a danger of procedures being called with unsuitable parameter values. With a strongly typed language (Pascal, for example) if a procedure is called with too many or the wrong type of argument values, the implementation would automatically flag a type mismatch at or before run-time, and the user would be aware of and could pin-point the error. In Prolog the run-time behavior in this case would be unpredictable, and the error would be difficult to detect and fix.

Click on Discuss to view users comments.

Write your comments here:



23:  

Which one of the following is true?

A.

The resolvent of two Horn clauses is not a Horn clause

B.

The resolvent of two Horn clauses is a Horn clause

C.

If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or non-null goal

D.

If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal

 
 

Option: B

Explanation :

A Horn clause is a clause (a disjunction of literals) with at most one positive, i.e. unnegated, literal.
Conversely, a disjunction of literals with at most one negated literal is called a dual-Horn clause.
A Horn clause with exactly one positive literal is a definite clause; a definite clause with no negative literals is sometimes called a fact; and a Horn clause without a positive literal is sometimes called a goal clause (note that the empty clause consisting of no literals is a goal clause).
Now, if resolution is restricted to Horn clauses, some interesting properties appear. Some of these are evident; others I will just state and you can take on faith.
I. If you resolve Horn clauses A and B to get clause C, then the positive literal of A will resolve against a negative literal in B, so the only positive literal left in C is the one from B (if any). Thus, the resolvent of two Horn clauses is a Horn clause.
II. If you resolve a negated goal G against a fact or rule A to get clause C, the positive literal in A resolves against a negative literal in G. Thus C has no positive literal, and thus is either a negated goal or the null clause.
III. Therefore: Suppose you are trying to prove Phi from Gamma, where ~Phi is a negated goal, and Gamma is a knowledge base of facts and rules. Suppose you use the set of support strategy, in which no resolution ever involves resolving two clauses from Gamma together. Then, inductively, every resolution combines a negated goal with a fact or rule from Gamma and generates a new negated goal.

Click on Discuss to view users comments.

Write your comments here:



24:  

Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender?

A.

Broadcasting

B.

Unicasting

C.

Packet switching

D.

Circuit switching

 
 

Option: D

Explanation :

Circuit switching is a methodology of implementing a telecommunications network in which two network nodes establish a dedicated communications channel (circuit) through the network before the nodes may communicate. The circuit guarantees the full bandwidth of the channel and remains connected for the duration of the communication session.

Click on Discuss to view users comments.

Write your comments here:



25:  

Which of the following control fields in TCP header is used to specify whether the sender has no more data to transmit?

A.

FIN

B.

RST

C.

SYN

D.

PSH

 
 

Option: A

Explanation :

FIN: No more data from the sender. Receiving a TCP segment with the FIN flag does not mean that transferring data in the opposite direction is not possible.
RST: Reset the connection. The RST bit is used to RESET the TCP connection due to unrecoverable errors.
SYN: This flag means synchronize sequence numbers. Source is beginning a new counting sequence.
PSH: This flag means Push function. Using this flag, TCP allows a sending application to specify that the data must be pushed immediately.

Click on Discuss to view users comments.

Write your comments here: