The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged gate1989
GATE 1989 Computer Science Questions
+21
votes
2
answers
1
GATE19894i
Provide short answers to the following questions: 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.
asked
Nov 30, 2016
in
Combinatory
by
makhdoom ghaya
Boss
(
30.7k
points)

1.3k
views
gate1989
descriptive
permutationandcombination
discretemathematics
normal
+7
votes
2
answers
2
GATE19893ixa
Answer the following: 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 ... components of a graph. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
asked
Nov 27, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.7k
points)

1k
views
normal
gate1989
binarytree
graphsearch
+4
votes
1
answer
3
GATE19893vii
Answer the following: 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 interarrival time is exponentially ... time between successive arrivals is exponential, then the time between the occurences of every third arrival is also exponential.
asked
Nov 27, 2016
in
Probability
by
makhdoom ghaya
Boss
(
30.7k
points)

456
views
gate1989
normal
probability
poissondistribution
queuingtheory
nongate
+19
votes
2
answers
4
GATE19903vi
Which of the following graphs is/are planner?
asked
Nov 27, 2016
in
Graph Theory
by
makhdoom ghaya
Boss
(
30.7k
points)

1.3k
views
gate1989
normal
graphtheory
graphplanarity
descriptive
+10
votes
4
answers
5
GATE19893v
Answer the following: Which of the following wellformed formulas are equivalent? $P \rightarrow Q$ $\neg Q \rightarrow \neg P$ $\neg P \vee Q$ $\neg Q \rightarrow P$
asked
Nov 27, 2016
in
Mathematical Logic
by
makhdoom ghaya
Boss
(
30.7k
points)

661
views
gate1989
normal
mathematicallogic
propositionallogic
+18
votes
2
answers
6
GATE19893iii
Answer the following questions: Which of the following problems are undecidable? Membership problem in contextfree languages. Whether a given contextfree language is regular. Whether a finite state automation halts on all inputs. Membership problem for type $0$ languages.
asked
Nov 27, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
30.7k
points)

2.5k
views
gate1989
normal
theoryofcomputation
decidability
+18
votes
5
answers
7
GATE19893ii
Contextfree languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
asked
Nov 27, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
30.7k
points)

1.7k
views
gate1989
easy
theoryofcomputation
closureproperty
+5
votes
1
answer
8
GATE19893i
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.
asked
Nov 27, 2016
in
Programming
by
makhdoom ghaya
Boss
(
30.7k
points)

587
views
gate1989
normal
programming
goto
+21
votes
3
answers
9
GATE19892iv
Match the pairs in the following: ...
asked
Nov 27, 2016
in
Operating System
by
makhdoom ghaya
Boss
(
30.7k
points)

3.1k
views
matchthefollowing
gate1989
operatingsystem
virtualmemory
+14
votes
3
answers
10
GATE19892iii
Match the pairs in the following:$\begin{array}{llll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$ ... O (n^2)$} &\text{(s)} & \text{Selection of the $k^{th}$ smallest element in a set of $n$ elements} \\\hline \end{array}$
asked
Nov 27, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

982
views
gate1989
matchthefollowing
algorithms
timecomplexity
+16
votes
2
answers
11
GATE19892ii
Match the pairs in the following questions: ...
asked
Nov 27, 2016
in
CO and Architecture
by
makhdoom ghaya
Boss
(
30.7k
points)

1.4k
views
gate1989
matchthefollowing
coandarchitecture
addressingmodes
easy
+6
votes
1
answer
12
GATE19872i
Match the pairs in the following questions: $\begin{array}{lll} \hline \text {(A) Cyclic Redundancy Code} & \text {(p) Error Correction} \\\hline \text {(B) Serial Communication} & \text{(q) WiredOR } \\\hline \text{(C) Open Collector} & \text{(r) Error detection} \\\hline \text{(D) Hamming Code} & \text{(s) RS232C} \\\hline \end{array}$
asked
Nov 27, 2016
in
Computer Networks
by
makhdoom ghaya
Boss
(
30.7k
points)

701
views
gate1989
descriptive
computernetworks
serialcommunication
+6
votes
1
answer
13
GATE19891vi
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.
asked
Nov 27, 2016
in
Digital Logic
by
makhdoom ghaya
Boss
(
30.7k
points)

933
views
descriptive
gate1989
digitallogic
numberrepresentation
floatingpointrepresentation
+28
votes
1
answer
14
GATE19891v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given n) is ___________.
asked
Nov 27, 2016
in
Set Theory & Algebra
by
makhdoom ghaya
Boss
(
30.7k
points)

1.8k
views
gate1989
descriptive
settheory&algebra
binaryoperation
+14
votes
4
answers
15
GATE19891iv
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 ___________.
asked
Nov 27, 2016
in
Set Theory & Algebra
by
makhdoom ghaya
Boss
(
30.7k
points)

923
views
gate1989
settheory&algebra
relations
descriptive
+11
votes
2
answers
16
GATE19891iii
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR purser.
asked
Nov 27, 2016
in
Compiler Design
by
makhdoom ghaya
Boss
(
30.7k
points)

777
views
gate1989
descriptive
compilerdesign
parsing
+13
votes
1
answer
17
GATE19893viii
In which of the following case(s) is it possible to obtain different results for callbyreference and callbyname 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
asked
Jan 22, 2016
in
Compiler Design
by
Cruise Device
(
371
points)

1.4k
views
gate1989
parameterpassing
runtimeenvironments
compilerdesign
+30
votes
3
answers
18
GATE19891vii, ISRO201514
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$
asked
Jun 1, 2015
in
DS
by
Anu
Loyal
(
5.8k
points)

7.1k
views
hashing
isro2015
gate1989
datastructures
normal
Page:
« prev
1
2
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Management Trainee Recruitment COAL INDIA 2020
ECIL Interview Experience
Follow @csegate
Recent questions tagged gate1989
Recent Blog Comments
On an all, IT branch is not eligible then,or is...
What was the answer for checksum field in tcp...
@CSHuB You need to choose "systems" as post...
@cshub.....if you are branch computer engineering...
Hey all! I can't see the CS branch here? How...
50,741
questions
57,251
answers
198,060
comments
104,692
users