GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

613.

Let G = ({S},{a,b},R,S) be a context free grammar where the rule set R is S ->
a S b | S S | ∈
Which of the following statements is true? [2 marks]
(A) G is not ambiguous
(B) There exist x, y ∈ L(G) such that xy∉ L(G)
(C) There is a deterministic pushdown automaton that accepts L(G)
(D) We can find a deterministic finite state automaton that accepts L(G)

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
614.

Consider the following deterministic finite state automaton M.

Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is [2 marks]
(A) 1
(B) 5
(C) 7
(D) 8

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]

615.

Consider the following assembly language program for a hypothetical processor A, B, and C are 8 bit registers. The meanings of various instructions are shown as comments.
MOV B, #0 ; B <- 0
MOV C, #8 ; C <- 8

[1]	If the initial value of register A is A₀ the value of register B after the program execution will be [2 marks] (A) the number of 0 bits in A₀ (B) the number of 1 bits in A₀ (C) A₀ (D) 8

[2]	Which of the following instructions when inserted at location X will ensure that the value of register A after program execution is the same as its initial value? [2 marks] (A) RRC A, #1 (B) NOP ; no operation (C) LRC A, #1 ; left rotate A through carry flag by one bit (D) ADD A, #1

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]

616.

Consider the following circuit composed of XOR gates and non-inverting buffers.

The non-inverting buffers have delays δ₁ = 2 ns and δ₂ = 4 ns as shown in the figure. Both XOR gates and all wires have zero delay. Assume that all gate inputs, outputs and wires are stable at logic level 0 at time 0. If the following waveform is applied at input A, how many transition(s) (change of logic levels) occur(s) at B during the interval from 0 to 10 ns? [2 marks]

(A) 1
(B) 2
(C) 3
(D) 4

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
617.

Consider the ALU shown below.

If the operands are in 2’s complement representation, which of the following operations can be performed by suitably setting the control lines K and C₀ only (+ and - denote addition and subtraction respectively)? [2 marks]
(A) A + B, and A - B, but not A + 1
(B) A + B, and A + 1, but not A - B
(C) A + B, but not A – B or A + 1
(D) A + B, and A - B, and A + 1

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
618.

The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of (xy + xz') is 4. What are the minimum possible literal counts of the product-of-sum and sum-ofproduct representations respectively of the function given by the following Karnaugh map? Here, X denotes “don’t care”

[2 marks]
(A) (11, 9)
(B) (9, 13)
(C) (9, 10)
(D) (11, 11)

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]

801 1 ...‹‹101 102103 104 105 ›› ... 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