- Option : A
- Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

19. The logic of pumping lemma is an example of __________.

- Option : D
- Explanation :

Pigeon-hole principle states that if there are n pigeons fly into m hole and n > m then atleast one hole must contain more then one pigeons. And logic of pumping lemma states that- finite state automaton can assume only a finite number of states and because there are infintely many input sequence, by the pigeon hole principle , there must be atleast one state to which the automata returns over and over again. So, option (D) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

20. Heap allocation is required for languages that

- Option : B
- Explanation :

Heap allocation is required for the languages which support dynamic data structure. So, option (B) is correct.

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.