Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
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.
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Nov 23, 2016
CO and Architecture
gate1990
true-false
co-and-architecture
instruction-execution
+
–
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...
makhdoom ghaya
7.7k
views
makhdoom ghaya
asked
Nov 23, 2016
CO and Architecture
gate1990
true-false
co-and-architecture
io-handling
interrupts
+
–
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.
makhdoom ghaya
5.7k
views
makhdoom ghaya
asked
Nov 23, 2016
Digital Logic
gate1990
true-false
digital-logic
ram
pla
+
–
27
votes
2
answers
34
GATE CSE 1990 | Question: 3-xi
A graph is planar if and only if, It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.
A graph is planar if and only if,It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$.It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$...
makhdoom ghaya
12.6k
views
makhdoom ghaya
asked
Nov 23, 2016
Graph Theory
gate1990
normal
graph-theory
graph-planarity
multiple-selects
+
–
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)...
makhdoom ghaya
9.4k
views
makhdoom ghaya
asked
Nov 22, 2016
Mathematical Logic
gate1990
normal
mathematical-logic
propositional-logic
multiple-selects
+
–
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!)$.
makhdoom ghaya
3.1k
views
makhdoom ghaya
asked
Nov 22, 2016
Combinatory
gate1990
normal
combinatory
+
–
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...
makhdoom ghaya
9.1k
views
makhdoom ghaya
asked
Nov 22, 2016
Theory of Computation
gate1990
normal
theory-of-computation
regular-language
multiple-selects
+
–
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...
makhdoom ghaya
12.7k
views
makhdoom ghaya
asked
Nov 22, 2016
Theory of Computation
gate1990
normal
theory-of-computation
decidability
multiple-selects
+
–
27
votes
2
answers
39
GATE CSE 1990 | Question: 3-vi
Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.
Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...
makhdoom ghaya
16.9k
views
makhdoom ghaya
asked
Nov 22, 2016
Theory of Computation
gate1990
normal
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
multiple-selects
+
–
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)$
makhdoom ghaya
6.6k
views
makhdoom ghaya
asked
Nov 22, 2016
Algorithms
gate1990
normal
algorithms
sorting
easy
time-complexity
multiple-selects
+
–
22
votes
5
answers
41
GATE CSE 1990 | Question: 3-iv
The total external path length, $\text{EPL},$ of a binary tree with $n$ external nodes is, $\text{EPL}= \displaystyle \sum_{w} I_w$, where $I_{w}$ is the path length of external node $w$), $\leq n^{2}$ always. $\geq n \log_{2} n$ always. Equal to $n^{2}$ always. $O(n)$ for some special trees.
The total external path length, $\text{EPL},$ of a binary tree with $n$ external nodes is, $\text{EPL}= \displaystyle \sum_{w} I_w$, where $I_{w}$ is the path length of e...
makhdoom ghaya
6.3k
views
makhdoom ghaya
asked
Nov 22, 2016
DS
gate1990
normal
data-structures
binary-tree
multiple-selects
+
–
20
votes
2
answers
42
GATE CSE 1990 | Question: 3-iii
The number of rooted binary trees with $n$ nodes is, Equal to the number of ways of multiplying $(n+1)$ matrices. Equal to the number of ways of arranging $n$ out of $2 n$ distinct elements. Equal to $\frac{1}{(n+1)}\binom{2n}{n}$. Equal to $n!$.
The number of rooted binary trees with $n$ nodes is,Equal to the number of ways of multiplying $(n+1)$ matrices.Equal to the number of ways of arranging $n$ out of $2 n$ ...
makhdoom ghaya
5.4k
views
makhdoom ghaya
asked
Nov 19, 2016
Combinatory
gate1990
normal
combinatory
catalan-number
multiple-selects
+
–
35
votes
5
answers
43
GATE CSE 1990 | Question: 3-ii
Indicate which of the following statements are true: A relational database which is in $3$NF may still have undesirable data redundancy because there may exist: Transitive functional dependencies Non-trivial functional dependencies ... dependencies involving prime attributes only on the left-side. Non-trivial functional dependencies involving only prime attributes.
Indicate which of the following statements are true:A relational database which is in $3$NF may still have undesirable data redundancy because there may exist:Transitive ...
makhdoom ghaya
14.6k
views
makhdoom ghaya
asked
Nov 19, 2016
Databases
gate1990
normal
databases
database-normalization
multiple-selects
+
–
19
votes
5
answers
44
GATE CSE 1990 | Question: 3-i
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function $Y,$ implemented by the circuit is, $Y=ABC + DE$ $Y=\overline{ABC + DE}$ $Y=ABC.DE$ $Y=\overline{ABC.DE}$
Choose the correct alternatives (More than one may be correct).Two NAND gates having open collector outputs are tied together as shown in below figure.The logic function ...
makhdoom ghaya
7.4k
views
makhdoom ghaya
asked
Nov 19, 2016
Digital Logic
gate1990
normal
digital-logic
circuit-output
+
–
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...
makhdoom ghaya
3.9k
views
makhdoom ghaya
asked
Nov 19, 2016
Set Theory & Algebra
gate1990
match-the-following
set-theory&algebra
group-theory
+
–
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...
makhdoom ghaya
14.4k
views
makhdoom ghaya
asked
Nov 19, 2016
Compiler Design
gate1990
match-the-following
compiler-design
compilation-phases
+
–
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...
makhdoom ghaya
5.1k
views
makhdoom ghaya
asked
Nov 19, 2016
DS
gate1990
match-the-following
data-structures
binary-heap
+
–
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 (...
makhdoom ghaya
5.9k
views
makhdoom ghaya
asked
Nov 19, 2016
Algorithms
gate1990
match-the-following
algorithms
algorithm-design-technique
easy
+
–
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...
makhdoom ghaya
2.3k
views
makhdoom ghaya
asked
Nov 19, 2016
Programming in C
gate1990
match-the-following
programming
out-of-gate-syllabus
+
–
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...
makhdoom ghaya
8.4k
views
makhdoom ghaya
asked
Nov 19, 2016
Compiler Design
gate1990
match-the-following
compiler-design
runtime-environment
recursion
+
–
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...
makhdoom ghaya
2.6k
views
makhdoom ghaya
asked
Nov 19, 2016
Databases
gate1990
match-the-following
database-normalization
databases
+
–
30
votes
2
answers
52
GATE CSE 1990 | Question: 2-iii
Match the pairs:$\begin{array}{|ll|ll|}\hline (a) & \text{Critical region} & (p) & \text{Hoare's monitor} \\ (b) & \text{Wait/Signal} & (q) & \text{Mutual exclusion} \\ (c) & \text{Working Set} & (r) & \text{Principle of locality} \\ (d) & \text{Deadlock} & (s) & \text{Circular Wait} \\\hline \end{array}$
Match the pairs:$$\begin{array}{|ll|ll|}\hline (a) & \text{Critical region} & (p) & \text{Hoare's monitor} \\ (b) & \text{Wait/Signal} & (q) & \text{Mutual exclusion} \\ ...
makhdoom ghaya
6.1k
views
makhdoom ghaya
asked
Nov 18, 2016
Operating System
match-the-following
gate1990
operating-system
process-synchronization
+
–
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 ____________.
makhdoom ghaya
430
views
makhdoom ghaya
asked
Nov 18, 2016
Others
gate1990
descriptive
linear-programming
out-of-gate-syllabus
fill-in-the-blanks
+
–
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$.
makhdoom ghaya
5.3k
views
makhdoom ghaya
asked
Nov 18, 2016
Graph Theory
gate1990
graph-theory
graph-connectivity
fill-in-the-blanks
+
–
22
votes
1
answer
55
GATE CSE 1990 | Question: 1-vii
Semaphore operations are atomic because they are implemented within the OS _________.
Semaphore operations are atomic because they are implemented within the OS _________.
makhdoom ghaya
7.9k
views
makhdoom ghaya
asked
Nov 18, 2016
Operating System
gate1990
operating-system
semaphore
process-synchronization
fill-in-the-blanks
+
–
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.
makhdoom ghaya
5.7k
views
makhdoom ghaya
asked
Nov 18, 2016
Operating System
gate1990
operating-system
process-scheduling
fill-in-the-blanks
+
–
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...
makhdoom ghaya
5.8k
views
makhdoom ghaya
asked
Nov 18, 2016
Operating System
gate1990
operating-system
virtual-memory
fill-in-the-blanks
+
–
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...
makhdoom ghaya
7.9k
views
makhdoom ghaya
asked
Nov 18, 2016
Digital Logic
gate1990
digital-logic
number-representation
floating-point-representation
fill-in-the-blanks
+
–
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.
makhdoom ghaya
6.6k
views
makhdoom ghaya
asked
Nov 18, 2016
Digital Logic
gate1990
digital-logic
adder
fill-in-the-blanks
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register