Register
GATE 1990 Computer Science questions

Recent questions tagged gate1990

17 votes
2 answers
2
GATE CSE 1990 | Question: 1-viii
The condition for overflow in the addition of two $2's$ complement numbers in terms of the carry generated by the two most significant bits is ___________.
The condition for overflow in the addition of two $2's$ complement numbers in terms of the carry generated by the two most significant bits is ___________.
User Avatar
9 votes
2 answers
3
GATE CSE 1990 | Question: 17c
Show that the elements of the lattice $(N, \leq)$, where $N$ is the set of positive intergers and $a \leq b$ if and only if $a$ divides $b$, satisfy the distributive property.
Show that the elements of the lattice $(N, \leq)$, where $N$ is the set of positive intergers and $a \leq b$ if and only if $a$ divides $b$, satisfy the distributive prop...
User Avatar
24 votes
1 answer
7
GATE CSE 1990 | Question: 16a
Show that grammar $G_1$ is ambiguous using parse trees: $G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$
Show that grammar $G_1$ is ambiguous using parse trees:$G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$
User Avatar
20 votes
2 answers
9
GATE CSE 1990 | Question: 15a
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwiseG: $S \rightarrow aB$$B \rightarrow bC$$C \rightarro...
User Avatar
7 votes
1 answer
11
GATE CSE 1990 | Question: 13b
Consider a hash table with chaining scheme for overflow handling: What is the worst-case timing complexity of inserting $n$ elements into such a table? For what type of instance does this hashing scheme take the worst-case time for insertion?
Consider a hash table with chaining scheme for overflow handling:What is the worst-case timing complexity of inserting $n$ elements into such a table?For what type of ins...
User Avatar
5 votes
1 answer
21
GATE CSE 1990 | Question: 8b
State the Booth's algorithm for multiplication of two numbers. Draw a block diagram for the implementation of the Booth's algorithm for determining the product of two $8$-bit signed numbers.
State the Booth's algorithm for multiplication of two numbers. Draw a block diagram for the implementation of the Booth's algorithm for determining the product of two $8$...
User Avatar
23 votes
6 answers
27
GATE CSE 1990 | Question: 5-b
Show with the help of a block diagram how the Boolean function : $f=AB+BC+CA$ can be realised using only a $4:1$ multiplexer.
Show with the help of a block diagram how the Boolean function :$f=AB+BC+CA$can be realised using only a $4:1$ multiplexer.
User Avatar
19 votes
3 answers
28
GATE CSE 1990 | Question: 5-a
Find the minimum product of sums of the following expression $f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$
Find the minimum product of sums of the following expression$f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$
User Avatar
17 votes
2 answers
29
GATE CSE 1990 | Question: 4-v
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
State whether the following statements are TRUE or FALSE with reason:The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
User Avatar
4 votes
0 answers
30
GATE CSE 1990 | Question: 4-iv
State whether the following statements are TRUE or FALSE with reason: Transferring data in blocks from the main memory to the cache memory enables an interleaved main memory unit to operate at its maximum speed.
State whether the following statements are TRUE or FALSE with reason:Transferring data in blocks from the main memory to the cache memory enables an interleaved main memo...
User Avatar
Page: