Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
GATE 1987 Computer Science Questions
Recent questions tagged gate1987
21
21 votes
5
answers
5 answers
6.7k
6.7k views
GATE CSE 1987 | Question: 2l
State whether the following statement are TRUE or FALSE.$A$ is recursive if both $A$ and its complement are accepted by Turing machines.
Misbah Ghaya
6.7k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
turing-machine
decidability
true-false
+
–
27
27 votes
4
answers
4 answers
6.3k
6.3k views
GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.
Misbah Ghaya
6.3k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
context-free-language
true-false
+
–
45
45 votes
5
answers
5 answers
9.3k
9.3k views
GATE CSE 1987 | Question: 2j
State whether the following statements are TRUE or FALSE:A minimal DFA that is equivalent to an NDFA with $n$ nodes has always $2^{n}$ states.
Misbah Ghaya
9.3k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
finite-automata
minimal-state-automata
+
–
18
18 votes
2
answers
2 answers
4.6k
4.6k views
GATE CSE 1987 | Question: 2i
State whether the following statements are TRUE or FALSE:All subsets of regular sets are regular.
Misbah Ghaya
4.6k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
regular-language
true-false
+
–
22
22 votes
5
answers
5 answers
6.3k
6.3k views
GATE CSE 1987 | Question: 2h
State whether the following statements are TRUE or FALSE:Regularity is preserved under the operation of string reversal.
Misbah Ghaya
6.3k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
regular-language
true-false
+
–
27
27 votes
4
answers
4 answers
8.6k
8.6k views
GATE CSE 1987 | Question: 2g
State whether the following statements are TRUE or FALSE:If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
Misbah Ghaya
8.6k
views
asked
Nov 9, 2016
Data Structures
gate1987
data-structures
binary-tree
true-false
+
–
3
3 votes
2
2 answers
1.5k
1.5k views
GATE CSE 1987 | Question: 2f
State whether the following statements are TRUE or FALSE:Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
Misbah Ghaya
1.5k
views
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-isomorphism
true-false
out-of-gatecse-syllabus
+
–
12
12 votes
2
2 answers
3.0k
3.0k views
GATE CSE 1987 | Question: 2e
State whether the following statement is TRUE or FALSE:There is a linear-time algorithm for testing the planarity of finite graphs.
Misbah Ghaya
3.0k
views
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-planarity
true-false
+
–
31
31 votes
5
answers
5 answers
9.8k
9.8k views
GATE CSE 1987 | Question: 2d
State whether the following statements are TRUE or FALSE:The union of two equivalence relations is also an equivalence relation.
Misbah Ghaya
9.8k
views
asked
Nov 9, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
relations
true-false
+
–
43
43 votes
8
answers
8 answers
11.5k
11.5k views
GATE CSE 1987 | Question: 2c
State whether the following statements are TRUE or FALSE:It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
Misbah Ghaya
11.5k
views
asked
Nov 9, 2016
Data Structures
gate1987
binary-tree
data-structures
normal
true-false
+
–
13
13 votes
4
4 answers
4.2k
4.2k views
GATE CSE 1987 | Question: 2b
State whether the following statements are TRUE or FALSE:Data transfer between a microprocessor and an I/O device is usually faster in memory-mapped-I/O scheme than in I/...
Misbah Ghaya
4.2k
views
asked
Nov 9, 2016
CO & Architecture
gate1987
co-and-architecture
io-handling
true-false
+
–
13
13 votes
5
5 answers
6.3k
6.3k views
GATE CSE 1987 | Question: 2a
State whether the following statements are TRUE or FALSEIn a microprocessor-based system, if a bus (DMA) request and an interrupt request arrive sumultaneously, the micro...
Misbah Ghaya
6.3k
views
asked
Nov 9, 2016
CO & Architecture
gate1987
co-and-architecture
interrupts
io-handling
true-false
+
–
21
21 votes
3
answers
3 answers
6.7k
6.7k views
GATE CSE 1987 | Question: 1-xxvi
If $f(x_{i}).f(x_{i+1})< 0$ thenThere must be a root of $f(x)$ between $x_i$ and $x_{i+1}$There need not be a root of $f(x)$ between $x_{i}$ and $x_{i+1}$There fourth der...
Misbah Ghaya
6.7k
views
asked
Nov 9, 2016
Calculus
gate1987
calculus
maxima-minima
+
–
0
0 votes
0
0 answers
1.2k
1.2k views
GATE CSE 1987 | Question: 1-xxv
Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure?It converges always under all circumstances.It does not converge t...
Misbah Ghaya
1.2k
views
asked
Nov 9, 2016
Numerical Methods
gate1987
numerical-methods
newton-raphson
out-of-gatecse-syllabus
+
–
1
1 vote
1
1 answer
1.4k
1.4k views
GATE CSE 1987 | Question: 1-xxiv
The simplex method is so named because It is simple.It is based on the theory of algebraic complexes.The simple pendulum works on this method.No one thought of a better n...
Misbah Ghaya
1.4k
views
asked
Nov 9, 2016
Numerical Methods
gate1987
numerical-methods
simplex-method
out-of-gatecse-syllabus
+
–
35
35 votes
5
answers
5 answers
10.2k
10.2k views
GATE CSE 1987 | Question: 1-xxiii
A square matrix is singular whenever The rows are linearly independentThe columns are linearly independentThe row are linearly dependentNone of the above
Misbah Ghaya
10.2k
views
asked
Nov 8, 2016
Linear Algebra
gate1987
linear-algebra
matrix
+
–
28
28 votes
5
answers
5 answers
6.5k
6.5k views
GATE CSE 1987 | Question: 1-xxii
The equation $7x^{7}+14x^{6}+12x^{5}+3x^{4}+12x^{3}+10x^{2}+5x+7=0$ hasAll complex rootsAt least one real rootFour pairs of imaginary rootsNone of the above
Misbah Ghaya
6.5k
views
asked
Nov 8, 2016
Calculus
gate1987
calculus
polynomials
+
–
14
14 votes
4
answers
4 answers
7.3k
7.3k views
GATE CSE 1987 | Question: 1-xxi
If $a, b,$ and $c$ are constants, which of the following is a linear inequality?$ax+bcy=0$$ax^{2}+cy^{2}=21$$abx+a^{2}y \geq 15$$xy+ax \geq 20$
Misbah Ghaya
7.3k
views
asked
Nov 8, 2016
Linear Algebra
gate1987
linear-algebra
inequality
out-of-gatecse-syllabus
+
–
20
20 votes
2
answers
2 answers
5.3k
5.3k views
GATE CSE 1987 | Question: 1-xx
For the program given below what will be printed by the write statements marked $(1)$ and $(2)$ in the program if the variables are dynamically scoped?Var x, y:interger; ...
Misbah Ghaya
5.3k
views
asked
Nov 8, 2016
Compiler Design
gate1987
compiler-design
variable-scope
runtime-environment
+
–
29
29 votes
2
answers
2 answers
10.6k
10.6k views
GATE CSE 1987 | Question: 1-xix
Study the following program written in a block-structured language:Var x, y:interger; procedure P(n:interger); begin x:=(n+2)/(n-3); end; procedure Q Var x, y:interger; b...
Misbah Ghaya
10.6k
views
asked
Nov 8, 2016
Compiler Design
gate1987
compiler-design
variable-scope
runtime-environment
+
–
58
58 votes
7
answers
7 answers
23.8k
23.8k views
GATE CSE 1987 | Question: 1-xviii
Let $P$ be a quicksort program to sort numbers in ascending order. Let $t_{1}$ and $t_{2}$ be the time taken by the program for the inputs $\left[1 \ 2 \ 3 \ 4\right]$ an...
Misbah Ghaya
23.8k
views
asked
Nov 8, 2016
Algorithms
gate1987
algorithms
sorting
quick-sort
+
–
29
29 votes
3
answers
3 answers
8.1k
8.1k views
GATE CSE 1987 | Question: 1-xvii
Using longer identifiers in a program will necessarily lead to:Somewhat slower compilationA program that is easier to understandAn incorrect programNone of the above
Misbah Ghaya
8.1k
views
asked
Nov 8, 2016
Compiler Design
gate1987
compiler-design
lexical-analysis
+
–
34
34 votes
2
answers
2 answers
8.7k
8.7k views
GATE CSE 1987 | Question: 1-xvi
A critical region isOne which is enclosed by a pair of $P$ and $V$ operations on semaphores.A program segment that has not been proved bug-free.A program segment that oft...
Misbah Ghaya
8.7k
views
asked
Nov 8, 2016
Operating System
gate1987
operating-system
process-synchronization
+
–
43
43 votes
5
answers
5 answers
24.7k
24.7k views
GATE CSE 1987 | Question: 1-xv
In a circular linked list organization, insertion of a record involves modification ofOne pointer.Two pointers.Multiple pointers.No pointer.
Misbah Ghaya
24.7k
views
asked
Nov 8, 2016
Data Structures
gate1987
data-structures
linked-list
+
–
24
24 votes
4
answers
4 answers
6.2k
6.2k views
GATE CSE 1987 | Question: 1-xiv
An operator precedence parser is aBottom-up parser.Top-down parser.Back tracking parser.None of the above.
Misbah Ghaya
6.2k
views
asked
Nov 8, 2016
Compiler Design
gate1987
compiler-design
parsing
easy
+
–
21
21 votes
2
answers
2 answers
10.5k
10.5k views
GATE CSE 1987 | Question: 1-xiii
FORTRAN is a:Regular language.Context-free language.Context-senstive language.None of the above.
Misbah Ghaya
10.5k
views
asked
Nov 8, 2016
Theory of Computation
gate1987
theory-of-computation
identify-class-language
+
–
33
33 votes
3
answers
3 answers
15.9k
15.9k views
GATE CSE 1987 | Question: 1-xii
A context-free grammar is ambiguous if:The grammar contains useless non-terminals.It produces more than one parse tree for some sentence.Some production has two non termi...
Misbah Ghaya
15.9k
views
asked
Nov 8, 2016
Compiler Design
gate1987
compiler-design
parsing
ambiguous-grammar
+
–
25
25 votes
5
answers
5 answers
9.5k
9.5k views
GATE CSE 1987 | Question: 1-xi
In a compiler the module that checks every character of the source text is called:The code generator.The code optimiser.The lexical analyser.The syntax analyser.
Misbah Ghaya
9.5k
views
asked
Nov 8, 2016
Compiler Design
gate1987
compiler-design
compilation-phases
lexical-analysis
+
–
2
2 votes
1
answers
1 answer
1.9k
1.9k views
GATE CSE 1987 | Question: 1-x
The data transfer rate of a double-density floppy disk system is about:$5K$ bits/sec$50K$ bits/sec$500K$ bits/sec$5000K$ bits/sec
Misbah Ghaya
1.9k
views
asked
Nov 8, 2016
Computer Peripherals
gate1987
computer-peripherals
floppy-disk
out-of-gatecse-syllabus
+
–
5
5 votes
2
2 answers
3.9k
3.9k views
GATE CSE 1987 | Question: 1-ix
The refreshing rate of dynamic RAMs is in the range of$2$ microseconds$2$ milliseconds.$50$ milliseconds$500$ milliseconds
Misbah Ghaya
3.9k
views
asked
Nov 8, 2016
CO & Architecture
gate1987
co-and-architecture
ram
out-of-gatecse-syllabus
+
–
Page:
« prev
1
2
3
next »