PREVIOUS YEAR SOLVED PAPERS - GATE 2018
11. Which one of the following statements is FALSE?
- Option : B
- Explanation : Type checking is done before parsing is clearly false because in compiler type checking is done after parsing phase.
- Option : B
- Explanation : For Enqueue operation, performs in a constant amount of time (i.e., Θ(1)) So, the options B is correct.
13. The set of all recursively enumerable languages is
- Option : B
- Explanation : The Set of RE languages is closed under intersection, not closed under complementation, is not a subset of set of REC language, and is a countable set.
- Option : D
- Explanation : RISC processor characteristics: 1. It supports mode registers, so ALU operations are performed only on register data. 2. It supports fixed-length instructions. 3. It uses a hard-wired control unit.
- Option : D
- Explanation : n is a number of state of given nfa (may not be minimal) k is a number of states of equivalent min dfa. First, we have to convert nfa to dfa using a subset construction algorithm and we get an equivalent dfa which will have atmost 2n states. Then we can convert this dfa to a minimal dfa and get a minimal dfa with k states where k ≤ 2n.
