GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

607.

Consider the translation scheme shown below.
S -> T R
R -> + T {print('+');} R|e
T -> num {print(num.val);}
Here num is a token that represents an integer and num.val represents the corresponding integer value. For an input string ‘9 + 5 + 2’, this translation scheme will print [2 marks]
(A) 9 + 5 + 2
(B) 9 5 + 2 +
(C) 9 5 2 + +
(D) + + 9 5 2

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
608.

Consider the grammar shown below.
S -> C C
C -> c C | d
This grammar is [2 marks]
(A) LL(1)
(B) SLR(1) but not LL(1)
(C) LALR(1) but not SLR(1)
(D) LR(1) but not LALR(1)

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
609.

Consider the NFA M shown below.

Let the language accepted by M be L. Let L₁ be the language accepted by the NFA M₁ obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting states of M to accepting states. Which of the following statements is true? [2 marks]
(A) L₁ = {0,1}* - L
(B) L₁ = {0,1}*
(C) L₁ ⊆ L
(D) L₁ = L

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
610.

Define languages L₀ and L₁ as follows:
L₀ = {<M, w, 0> | M halts on w}
L₁ = {<M, w, 1> | M does not halt on w}
Here <M, w, i> is a triplet, whose first component, M, is an encoding of a Turing Machine, second component, w, is a string, and third component, i, is a bit.
Let L = L₀∪L₁. Which of the following is true? [2 marks]
(A) L is recursively enumerable, but L is not
(B) L is recursively enumerable, but L is not
(C) Both L and L are recursive
(D) Neither L nor L is recursively enumerable

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
611.

A single tape Turing Machine M has two states q0 and q1, of which q0 is the starting state. The tape alphabet of M is {0, 1, B} and its input alphabet is {0, 1}. The symbol B is the blank symbol used to indicate end of an input string. The transition function of M is described in the following table.

The table is interpreted as illustrated below.
The entry (q1, 1, R) in row q0 and column 1 signifies that if M is in state q0 and reads 1 on the current tape square, then it writes 1 on the same tape square, moves its tape head one position to the right and transitions to state q1.
Which of the following statements is true about M? [2 marks]
(A) M does not halt on any string in (0+1)+
(B) M does not halt on any string in (00+1)*
(C) M halts on all strings ending in a 0
(D) M halts on all strings ending in a 1

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
612.

Consider two languages L₁ and L₂, each on the alphabet ∑. Let f: ∑ -> ∑ be a
polynomial time computable bijection such that (∀x)[x∈L₁ iff f(x)∈L₂]. Further, let f^-1 be also polynomial time computable.
Which of the following CANNOT be true? [2 marks]
(A) L₁ ∈ P and L₂ is finite
(B) L₁ ∈ NP and L₂ ∈ P
(C) L₁ is undecidable and L₂ is decidable
(D) L₁ is recursively enumerable and L₂ is recursive

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]

801 1 ...‹‹100 101102 103 104 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now