Question 1 |
The Boolean expression A \oplus B \oplus A is equivalent to
AB + \bar {A}\bar B | |
\bar{A}B+A\bar{B} | |
B | |
\bar{A} |
Question 1 Explanation:
Question 2 |
The below figure shows four D-type flip-flops connected as a shift register using a XOR gate. The initial state and three subsequent states for three clock pulses are also given.

\begin{array}{|c|c|c|c|c|} \hline \text{State} & Q_{A} & Q_{B} & Q_{C} & Q_{D} \\\hline \text{Initial} & 1 & 1 & 1 & 1 \\\hline \text{After the first clock} & 0 & 1 & 1 & 1 \\\hline \text{After the second clock} & 0 & 0 & 1 & 1 \\\hline \text{After the third clock} & 0 & 0 & 0 & 1 \\\hline \end{array}
The state Q_{A} Q_{B} Q_{C} Q_{D} after the fourth clock pulse is

\begin{array}{|c|c|c|c|c|} \hline \text{State} & Q_{A} & Q_{B} & Q_{C} & Q_{D} \\\hline \text{Initial} & 1 & 1 & 1 & 1 \\\hline \text{After the first clock} & 0 & 1 & 1 & 1 \\\hline \text{After the second clock} & 0 & 0 & 1 & 1 \\\hline \text{After the third clock} & 0 & 0 & 0 & 1 \\\hline \end{array}
The state Q_{A} Q_{B} Q_{C} Q_{D} after the fourth clock pulse is
0000 | |
1111 | |
1001 | |
1000 |
Question 2 Explanation:
Question 3 |
Fig. below shows the circuit diagram of a wien bridge oscillator using an op-amp.

The frequency of oscillation is given by f= 1/2 \pi CR. To have the system oscillate the ratio R_{2}/R_{1} should be

The frequency of oscillation is given by f= 1/2 \pi CR. To have the system oscillate the ratio R_{2}/R_{1} should be
0.5 | |
29 | |
2 | |
Any value |
Question 3 Explanation:
Question 4 |
A Boolean function f is to be realized only by NOR gates. Its K-map is given below:

The realization is


The realization is

A | |
B | |
C | |
D |
Question 4 Explanation:
Question 5 |
The refreshing rate of dynamic RAMs is in the range of
2 microseconds | |
2 milliseconds. | |
50 milli seconds | |
500 milliseconds |
Question 5 Explanation:
Question 6 |
The data transfer rate of a double-density floppy disk system is about:
5K bits/sec | |
50K bits/sec | |
500K bits/sec | |
5000K bits/sec |
Question 6 Explanation:
Question 7 |
In a compiler the module that checks every character of the source text is called:
The code generator. | |
The code optimiser. | |
The lexical analyser. | |
The syntax analyser. |
Question 7 Explanation:
Question 8 |
A context-free grammar is ambiguous if:
The grammar contains useless non-terminals. | |
It produces more than one parse tree for some sentence. | |
Some production has two non terminals side by side on the right-hand side. | |
None of the above. |
Question 8 Explanation:
Question 9 |
FORTRAN is a:
Regular language. | |
Context-free language. | |
Context-senstive language. | |
None of the above. |
Question 9 Explanation:
Question 10 |
An operator precedence parser is a
Bottom-up parser. | |
Top-down parser. | |
Back tracking parser. | |
None of the above. |
Question 10 Explanation:
There are 10 questions to complete.