Explanation : It is not raining (~p) and it is pleasent (r) : (¬p ∧ r)
It is raining (p) and it is cold (q) : (p∧q)
it is not pleasant (¬r) only if it is raining and it is cold : ¬r → (p∧q)
So the answer should be- (¬ p ∧ r) ∧ ((¬ r → (p ∧ q))
So, option (A) is true.
Explanation : BFS: Start at root (some arbitrary node of a graph, sometimes referred to as “search key”) and explore the neighbor nodes first, before and moving to the next level neighbors.
by using this we have different :
POQNMR or PQOMNR
So only D is correct answer
Explanation : A process with a connected UDP socket can call connect again for that socket for one of two reasons:
(1) To specify a new IP address and port.
(2) To unconnect the socket.