- Option : A
- Explanation :

A TM is recursive iff it halts for every input string (either in accept or reject state). Here, a computable function is defined in a similar way.

You must be logged in to post a comment.

- Option : A
- Explanation :

Shortest path from B to C are two B-A-C and B-C both of weight '3'

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : C
- Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : D
- Explanation : (p → q) → r is contradiction only when

And now for the above combination, the expression is always true when q is true. When q is false in the above combination (third one) will be false.P q r T T F F T F F F F

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.