PREVIOUS YEAR SOLVED PAPERS - November 2017 Paper 3
21. Finite state machine can recognize language generated by __________.
- Option : C
- Explanation : Finite state machine can recognize language generated by regular grammar only. For detailed information Refer:Designing Finite Automata from Regular Expression So, option (C) is correct option.
22. Which of the following problems is undecidable?
- Option : D
- Explanation : Refer:Undecidability Ambiguity problem for context free grammar is undecidable. So, option (D) is correct.
23. Pumping lemma for regular language is generally used for proving:
- Option : D
- Explanation : Pumping lemma is used to prove a language is regular or not. For more information on pumping lemma Refer:Pumping_lemma So, option (D) is correct.
24. The language L = {aib ci │ i >= 0} over the alphabet {a, b, c} is:
- Option : C
- Explanation : For a launguage to be recursive it can be decided by Turing machine which means it will enter into final state and reject the rest and for DCFL it must decidable that- for a particular language, next character is going to accepted or not. and for more information Refer:Recursive and Recursive Enumerable Languages So, option (C) is correct.
- Option : D
- Explanation : We have 100 pages, each page is having 24 line and in each line there are 80 character and each character is of 8 bits. Now we have to calculate no of bits can be downloaded: ie. Downloading rate = 100 pages = 100 pages *24 line * 80 character * 8 bits = 1536000 bits per second ie 1.536 Mbps. So, option (D) is correct.
