GATE Solved Paper 2017-19 - GATE 2018

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.
Cancel reply
Cancel reply

14. Consider the following processor design characteristics:
I. Register-to-register arithmetic operations only.
II. Fixed-length instruction format.
III. Hardwired control unit.
Which of the characteristics above are used in the design of a RISC processor?

  • 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.
Cancel reply
Cancel reply

15. Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?

  • 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.
Cancel reply
Cancel reply