- Option : D
- Explanation :

Option D.

(∼p)⇒(∼q)

∼(∼p)∨(∼q)

p∨(∼q)

(∼q)∨p ----------------> III is True

q⇒p -----------------> II is True

You must be logged in to post a comment.

12. Consider the following table:

Algorithms | Design Paradigms | ||

P. | Kruskal | i. | Divide and conquer |

Q. | Quicksort | ii. | Greedy |

R. | Floyd-Warshall | iii | Dynamic Programming |

- Option : C
- Explanation :

Kruskal’s algorithm follows greedy approach in order to find MST of a connected graph. Quick sort follows divide and conquer strategy. Floyd Warshal algorithm is used to find the shortest path between every pair of vertices and it follows dynamic programming strategy.

You must be logged in to post a comment.

You must be logged in to post a comment.

14. Consider the following grammar.

P → QRS |

Q → yz|z |

R → w|ε |

S → y |

- Option : C
- Explanation :

FOLLOW(Q) is FIRST(R) hence

FIRST (R)={w,ε}

We add ‘w’ in FOLLOW(Q) and for ϵ we calculate FIRST(S)

FIRST(S) ={y}

FOLLOW(Q) is {w,y}

You must be logged in to post a comment.

You must be logged in to post a comment.

15. Threads of a process share

- Option : D
- Explanation :

Threads of a process can share all resources except stack and register set.

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.