Register

Normal difficulty questions. These questions require correct understanding of the topic and the application of it. Those who have prepared must be able to do these questions with in 3 minutes.

Recent questions tagged normal

16 votes
3 answers
2341
GATE CSE 1992 | Question: 4-a
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overflow in two's complement arithmetic.
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overf...
User Avatar
23 votes
4 answers
2343
GATE CSE 1992 | Question: 02,xix
Context-free languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
Context-free languages are:closed under unionclosed under complementationclosed under intersectionclosed under Kleene closure
User Avatar
24 votes
4 answers
2346
GATE CSE 1992 | Question: 02-xi
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is: $2$ $3$ $4$ $1$
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guarant...
User Avatar
9 votes
4 answers
2347
GATE CSE 1992 | Question: 02,viii
A non-planar graph with minimum number of vertices has $9$ edges, $6$ vertices $6$ edges, $4$ vertices $10$ edges, $5$ vertices $9$ edges, $5$ vertices
A non-planar graph with minimum number of vertices has$9$ edges, $6$ vertices$6$ edges, $4$ vertices$10$ edges, $5$ vertices$9$ edges, $5$ vertices
User Avatar
28 votes
5 answers
2348
GATE CSE 1992 | Question: 02,vii
A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...
User Avatar
16 votes
4 answers
2351
GATE CSE 1992 | Question: 01,viii
The purpose of instruction location counter in an assembler is _______
The purpose of instruction location counter in an assembler is _______
User Avatar
19 votes
2 answers
2353
GATE CSE 1992 | Question: 01-iii
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because _____
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because _____
User Avatar
28 votes
4 answers
2354
GATE CSE 1992 | Question: 01,ii
Consider a $3$-bit error detection and $1$-bit error correction hamming code for $4$-bit data. The extra parity bits required would be _____ and the $3$-bit error detection is possible because the code has a minimum distance of _______.
Consider a $3$-bit error detection and $1$-bit error correction hamming code for $4$-bit data. The extra parity bits required would be _____ and the $3$-bit error detecti...
User Avatar
23 votes
4 answers
2355
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
User Avatar
52 votes
2 answers
2357
GATE CSE 1991 | Question: 16,a
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's.$
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's....
User Avatar
15 votes
5 answers
2358
GATE1991-15,a
<p><span style="line-height: 1.6;">Show that the product of the least common multiple and the greatest common&nbsp;</span><span style="line-height: 1.6;">divisor of two positive integers $a$ and $b$ is $a\times b$.</span></p> <p>&nbsp; &nbsp; &nbsp; &nbsp;</p>
<p><span style="line-height: 1.6;">Show that the product of the least common multiple and the greatest common&nbsp;</span><span style="line-height: 1.6;">divisor of two p...
User Avatar
27 votes
1 answer
2365
GATE CSE 1991 | Question: 5-a
Analyse the circuit in Fig below and complete the following table ${\begin{array}{|c|c|c|}\hline \textbf{a}& \textbf{b}& \bf{ Q_n} \\\hline 0&0\\\ 0&1 \\ 1&0 \\ 1&1 \\ \hline \end{array}}$
Analyse the circuit in Fig below and complete the following table$${\begin{array}{|c|c|c|}\hline\textbf{a}& \textbf{b}& \bf{ Q_n} \\\hline0&0\\\ 0&1 \\ 1&0 \\ 1...
User Avatar
Page: