PREVIOUS YEAR SOLVED PAPERS MCQ - GATE 2018

11 Which one of the following statements is FALSE?

Type checking is done before parsing is clearly false because in compiler type checking is done after parsing phase.

12 A queue is implemented using a non-circular singly linked list. The queue has a head pointer and tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by interesting a new node at the head and dequeue be implemented by deletion of a node from the tail.

Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?

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

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.

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?

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.

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?

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 2ⁿ states. Then we can convert this dfa to a minimal dfa and get a minimal dfa with k states where k ≤ 2ⁿ.

PREVIOUS YEAR SOLVED PAPERS MCQ - GATE 2018

Follow Us :