Register
GATE 1990 Computer Science questions

Recent questions tagged gate1990

9 votes
3 answers
31
GATE CSE 1990 | Question: 4-iii
State whether the following statements are TRUE or FALSE with reason: The flags are affected when conditional CALL or JUMP instructions are executed.
State whether the following statements are TRUE or FALSE with reason:The flags are affected when conditional CALL or JUMP instructions are executed.
User Avatar
19 votes
4 answers
32
GATE CSE 1990 | Question: 4-ii
State whether the following statements are TRUE or FALSE with reason: The data transfer between memory and I/O devices using programmed I/O is faster than interrupt-driven I/O.
State whether the following statements are TRUE or FALSE with reason:The data transfer between memory and I/O devices using programmed I/O is faster than interrupt-driven...
User Avatar
10 votes
1 answer
33
GATE CSE 1990 | Question: 4-i
State whether the following statements are TRUE or FALSE with reason: RAM is a combinational circuit and PLA is a sequential circuit.
State whether the following statements are TRUE or FALSE with reason:RAM is a combinational circuit and PLA is a sequential circuit.
User Avatar
30 votes
6 answers
35
GATE CSE 1990 | Question: 3-x
Indicate which of the following well-formed formulae are valid: $\left(P\Rightarrow Q\right) {\wedge} \left(Q \Rightarrow R\right) \Rightarrow \left(P \Rightarrow R\right)$ ...
Indicate which of the following well-formed formulae are valid:$\left(P\Rightarrow Q\right) {\wedge} \left(Q \Rightarrow R\right) \Rightarrow \left(P \Rightarrow R\right)...
User Avatar
12 votes
2 answers
36
GATE CSE 1990 | Question: 3-ix
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is: $15!/(5!)^{3}$ $15!$ $\left(\frac{15}{5}\right)$ $15!(5!3!)$.
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is:$15!/(5!)^{3}$$15!$$\left(\frac{15}{5}\right)$$15!(5!3!)$.
User Avatar
20 votes
3 answers
37
GATE CSE 1990 | Question: 3-viii
Let $R_{1}$ and $R_{2}$ be regular sets defined over the alphabet $\Sigma$ Then: $R_{1} \cap R_{2}$ is not regular. $R_{1} \cup R_{2}$ is regular. $\Sigma^{*}-R_{1}$ is regular. $R_{1}^{*}$ is not regular.
Let $R_{1}$ and $R_{2}$ be regular sets defined over the alphabet $\Sigma$ Then:$R_{1} \cap R_{2}$ is not regular.$R_{1} \cup R_{2}$ is regular.$\Sigma^{*}-R_{1}$ is regu...
User Avatar
46 votes
2 answers
38
GATE CSE 1990 | Question: 3-vii
It is undecidable whether: An arbitrary Turing machine halts after $100$ steps. A Turing machine prints a specific letter. A Turing machine computes the products of two numbers None of the above.
It is undecidable whether:An arbitrary Turing machine halts after $100$ steps.A Turing machine prints a specific letter.A Turing machine computes the products of two numb...
User Avatar
17 votes
2 answers
40
GATE CSE 1990 | Question: 3-v
The complexity of comparison based sorting algorithms is: $\Theta (n \log n)$ $\Theta (n)$ $\Theta \left(n^2\right)$ $\Theta (n\sqrt n)$
The complexity of comparison based sorting algorithms is:$\Theta (n \log n)$$\Theta (n)$$\Theta \left(n^2\right)$$\Theta (n\sqrt n)$
User Avatar
21 votes
2 answers
45
GATE CSE 1990 | Question: 2-x
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Groups} & (p) & \text{Associativity} \\\hline (b) & \text{Semigroups} & (q) & \text...
User Avatar
29 votes
3 answers
46
GATE CSE 1990 | Question: 2-ix
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll} (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \tex...
User Avatar
14 votes
3 answers
47
GATE CSE 1990 | Question: 2-viii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|} \hline (a) & \text{A heap construction} & (p) & \ \Omega(n\log_{10}n) \\\hline (b) & \text{Construct...
User Avatar
11 votes
1 answer
48
GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline (...
User Avatar
4 votes
1 answer
49
GATE CSE 1990 | Question: 2-vi
Match the pairs in the following questions: (a) Small talk (p) Logic programming (b) LISP (q) Data flow programming (c) Prolog (r) Functional programming (d) VAL (s) Object-oriented programming ...
Match the pairs in the following questions:(a) Small talk(p) Logic programming(b) LISP(q) Data flow programming(c) Prolog(r) Functional programming(d) VAL(s) Object-orien...
User Avatar
17 votes
3 answers
50
GATE CSE 1990 | Question: 2-v
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline (a) & \text{Pointer data type} & (p) & \text{Type conversion} \\\hline (b) & \text{Activation rec...
User Avatar
10 votes
2 answers
51
GATE CSE 1990 | Question: 2-iv
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Secondary index} & (p) & \text{Function dependency} \\\hline (b) & \text{Non-proced...
User Avatar
1 votes
0 answers
53
GATE CSE 1990 | Question: 1-ix
The solution to the following linear program $\max$ $X_{1}$ such that $X_{1}+2X_{2} \leq 10$ $X_{1} \leq 8$ $X_{1} \leq 1$ is ____________.
The solution to the following linear program$\max$ $X_{1}$such that $X_{1}+2X_{2} \leq 10$ $X_{1} \leq 8$ $X_{1} \leq 1$is ____________.
User Avatar
18 votes
1 answer
54
GATE CSE 1990 | Question: 1-viii
A graph which has the same number of edges as its complement must have number of vertices congruent to ________ or ________ modulo $4$.
A graph which has the same number of edges as its complement must have number of vertices congruent to ________ or ________ modulo $4$.
User Avatar
33 votes
1 answer
56
GATE CSE 1990 | Question: 1-vi
The highest-response ratio next scheduling policy favours ___________ jobs, but it also limits the waiting time of _________ jobs.
The highest-response ratio next scheduling policy favours ___________ jobs, but it also limits the waiting time of _________ jobs.
User Avatar
23 votes
1 answer
57
GATE CSE 1990 | Question: 1-v
Under paged memory management scheme, simple lock and key memory protection arrangement may still be required if the _________ processors do not have address mapping hardware.
Under paged memory management scheme, simple lock and key memory protection arrangement may still be required if the _________ processors do not have address mapping hard...
User Avatar
21 votes
4 answers
58
GATE CSE 1990 | Question: 1-iv-a
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$ The range of the exponent is ___________
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$The range of the ex...
User Avatar
34 votes
1 answer
59
GATE CSE 1990 | Question: 1-i
Fill in the blanks: In the two bit full-adder/subtractor unit shown in below figure, when the switch is in position $2$ ___________ using _________ arithmetic.
Fill in the blanks:In the two bit full-adder/subtractor unit shown in below figure, when the switch is in position $2$ ___________ using _________ arithmetic.
User Avatar
Page: