Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
GATE 1989 Computer Science Questions
Recent questions tagged gate1989
37
votes
5
answers
31
GATE CSE 1989 | Question: 4-i
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
makhdoom ghaya
7.0k
views
makhdoom ghaya
asked
Nov 29, 2016
Combinatory
gate1989
descriptive
combinatory
normal
proof
+
–
14
votes
3
answers
32
GATE CSE 1989 | Question: 3-ixa
Which one of the following statements (s) is/are FALSE? Overlaying is used to run a program, which is longer than the address space of the computer. Optimal binary search tree construction can be performed efficiently by using dynamic programming. ... of a graph. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
Which one of the following statements (s) is/are FALSE?Overlaying is used to run a program, which is longer than the address space of the computer.Optimal binary search t...
makhdoom ghaya
4.1k
views
makhdoom ghaya
asked
Nov 27, 2016
DS
normal
gate1989
binary-tree
graph-search
multiple-selects
+
–
6
votes
1
answer
33
GATE CSE 1989 | Question: 3-vii
Which of the following statements are FALSE? For poisson distribution, the mean is twice the variance. In queuing theory, if arrivals occur according to poisson distribution, then the inter-arrival time is exponentially distributed. The ... between successive arrivals is exponential, then the time between the occurences of every third arrival is also exponential.
Which of the following statements are FALSE?For poisson distribution, the mean is twice the variance.In queuing theory, if arrivals occur according to poisson distributio...
makhdoom ghaya
2.0k
views
makhdoom ghaya
asked
Nov 27, 2016
Probability
gate1989
normal
probability
poisson-distribution
queuing-theory
out-of-gate-syllabus
+
–
31
votes
4
answers
34
GATE CSE 1989 | Question: 3-vi
Which of the following graphs is/are planar?
Which of the following graphs is/are planar?
makhdoom ghaya
7.8k
views
makhdoom ghaya
asked
Nov 27, 2016
Graph Theory
gate1989
normal
graph-theory
graph-planarity
descriptive
+
–
19
votes
7
answers
35
GATE CSE 1989 | Question: 3-v
Which of the following well-formed formulas are equivalent? $P \rightarrow Q$ $\neg Q \rightarrow \neg P$ $\neg P \vee Q$ $\neg Q \rightarrow P$
Which of the following well-formed formulas are equivalent?$P \rightarrow Q$$\neg Q \rightarrow \neg P$$\neg P \vee Q$$\neg Q \rightarrow P$
makhdoom ghaya
3.7k
views
makhdoom ghaya
asked
Nov 27, 2016
Mathematical Logic
gate1989
normal
mathematical-logic
propositional-logic
multiple-selects
+
–
26
votes
2
answers
36
GATE CSE 1989 | Question: 3-iii
Which of the following problems are undecidable? Membership problem in context-free languages. Whether a given context-free language is regular. Whether a finite state automation halts on all inputs. Membership problem for type $0$ languages.
Which of the following problems are undecidable?Membership problem in context-free languages.Whether a given context-free language is regular.Whether a finite state autom...
makhdoom ghaya
10.1k
views
makhdoom ghaya
asked
Nov 27, 2016
Theory of Computation
gate1989
normal
theory-of-computation
decidability
multiple-selects
+
–
32
votes
8
answers
37
GATE CSE 1989 | Question: 3-ii
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
Context-free languages and regular languages are both closed under the operation (s) of :UnionIntersectionConcatenationComplementation
makhdoom ghaya
11.9k
views
makhdoom ghaya
asked
Nov 27, 2016
Theory of Computation
gate1989
easy
theory-of-computation
closure-property
multiple-selects
+
–
19
votes
5
answers
38
GATE CSE 1989 | Question: 3-i
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s): It makes it more difficult to verify programs. It makes programs more inefficient. It makes it more difficult to modify existing programs. It results in the compiler generating longer machine code.
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s):It makes it more difficult to verify programs.It makes programs more ...
makhdoom ghaya
4.3k
views
makhdoom ghaya
asked
Nov 27, 2016
Programming in C
gate1989
normal
programming
goto
+
–
28
votes
5
answers
39
GATE CSE 1989 | Question: 2-iv
Match the pairs in the following: ...
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Virtual memory} & \text{(p)} & \text{ Temporal Locality} \\\hline \text{(B)} & \text{Sha...
makhdoom ghaya
12.9k
views
makhdoom ghaya
asked
Nov 27, 2016
Operating System
match-the-following
gate1989
operating-system
virtual-memory
+
–
19
votes
3
answers
40
GATE CSE 1989 | Question: 2-iii
Match the pairs in the following: ... 2)$} &\text{(s)} & \text{Selection of the $k^{th}$ smallest element in a set of $n$ elements} \\\hline \end{array}$
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$O (n)$} & \tex...
makhdoom ghaya
5.4k
views
makhdoom ghaya
asked
Nov 27, 2016
Algorithms
gate1989
match-the-following
algorithms
time-complexity
+
–
29
votes
3
answers
41
GATE CSE 1989 | Question: 2-ii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Base addressing} & \text{(p)} & \text{Reentranecy} \\\hline \text{(B)} & \text...
makhdoom ghaya
5.9k
views
makhdoom ghaya
asked
Nov 27, 2016
CO and Architecture
gate1989
match-the-following
co-and-architecture
addressing-modes
easy
+
–
9
votes
1
answer
42
GATE1987-2-i
Match the pairs in the following questions: $\begin{array}{|l|l|l|} \hline \text {(A) Cyclic Redundancy Code} & \text {(p) Error Correction} \\\hline \text {(B) Serial Communication} & \text{(q) Wired-OR } \\\hline \text{(C) Open Collector} & \text{(r) Error detection} \\\hline \text{(D) Hamming Code} & \text{(s) RS-232-C} \\\hline \end{array}$
Match the pairs in the following questions:$$\begin{array}{|l|l|l|} \hline \text {(A) Cyclic Redundancy Code} & \text {(p) Error Correction} \\\hline \text {(B) Serial Co...
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Nov 27, 2016
Computer Networks
gate1989
descriptive
computer-networks
error-detection
+
–
14
votes
1
answer
43
GATE CSE 1989 | Question: 1-vi
Consider an excess -$50$ representation for floating point numbers with $4$ BCD digit mantissa and $2$ BCD digit exponent in normalised form. The minimum and maximum positive numbers that can be represented are __________ and _____________ respectively.
Consider an excess -$50$ representation for floating point numbers with $4$ BCD digit mantissa and $2$ BCD digit exponent in normalised form. The minimum and maximum posi...
makhdoom ghaya
3.9k
views
makhdoom ghaya
asked
Nov 27, 2016
Digital Logic
descriptive
gate1989
digital-logic
number-representation
floating-point-representation
+
–
43
votes
2
answers
44
GATE CSE 1989 | Question: 1-v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
makhdoom ghaya
6.5k
views
makhdoom ghaya
asked
Nov 27, 2016
Set Theory & Algebra
gate1989
descriptive
set-theory&algebra
binary-operation
+
–
21
votes
6
answers
45
GATE CSE 1989 | Question: 1-iv
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
makhdoom ghaya
7.1k
views
makhdoom ghaya
asked
Nov 27, 2016
Set Theory & Algebra
gate1989
set-theory&algebra
relations
descriptive
+
–
17
votes
3
answers
46
GATE CSE 1989 | Question: 1-iii
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR parser.
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR parser.
makhdoom ghaya
5.4k
views
makhdoom ghaya
asked
Nov 27, 2016
Compiler Design
gate1989
descriptive
compiler-design
parsing
+
–
21
votes
1
answer
47
GATE CSE 1989 | Question: 3-viii
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameter passing? Passing an expression as a parameter Passing an array as a parameter Passing a pointer as a parameter Passing as array element as a parameter
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameter passing?Passing an expression as a parameter...
Cruise Device
4.6k
views
Cruise Device
asked
Jan 22, 2016
Compiler Design
gate1989
parameter-passing
runtime-environment
compiler-design
multiple-selects
+
–
53
votes
4
answers
48
GATE CSE 1989 | Question: 1-vii, ISRO2015-14
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is $4$ $5$ $6$ $3$
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear p...
Anu
17.9k
views
Anu
asked
Jun 1, 2015
Algorithms
hashing
isro2015
gate1989
algorithms
normal
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register