GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

427.

Consider the following circuit.

The flip-flops are positive edge triggered D FFs. Each state is designated as a two-bit string Q₀Q₁. Let the initial state be 00. the state transition sequence is [2 marks]

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
428.

The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.

Which one of the following is TRUE? [2 marks]
(a) It computes 1’s complement of the input number
(b) It computes 2’s complement of the input number
(c) It increments the input number
(d) It decrements the input number

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
429.

Consider the following circuit involving a positive edge triggered D FF.

Consider the following timing diagram. Let Ai represent the logic level on the line a in the i-th clock period.

Let A' represent the complement of A. the correct output sequence on Y over the clock periods 1 through 5 is: [2 marks]
(a) A₀ A₁ A₁^' A₃ A₄
(b) A₀ A₁A'₂ A₃A₄
(c) A₁A₂A'₂A₃A₄
(d) A₁A'₂A₃A₄A'₅

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
430.

Consider line number 3 of the following C-program.
int min ( ) { /* Line 1 */
int I, N; /* Line 2 */
for (I =0, I<N, I++); /* Line 3 */
}
Identify the compiler’s response about this line while creating the object-module:
[2 marks]
(a) No compilation error
(b) Only a lexical error
(c) Only syntactic errors
(d) Both lexical and syntactic errors

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
431.

Consider the grammar:
S → (S) | a
Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be n₁, n₂ and n₃ respectively. The following relationship holds good: [2 marks]
(a) n₁ < n₂ < n₃
(b) n₁ = n₂ < n₃
(c) n₁ = n₂ = n₃
(d) n₁ ≥ n₂ ≥ n₃

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
432.

Consider the grammar:
E → E + n | E × n | n
For a sentence n + n × n, the handles in the right-sentential form of the reduction are:
[2 marks]
(a) n, E + n and E + n × n
(b) n, E + n and E + E × n
(c) n, n + n and n + n × n
(d) n, E + n and E × n

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]

801 1 ...‹‹70 7172 73 74 ›› ... 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