Register

Search results for gate1987

45 votes
6 answers
1
GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode
The most relevant addressing mode to write position-independent codes is:Direct modeIndirect modeRelative modeIndexed mode
User Avatar
24 votes
4 answers
3
GATE CSE 1987 | Question: 9a
How many binary relations are there on a set $A$ with $n$ elements?
How many binary relations are there on a set $A$ with $n$ elements?
User Avatar
31 votes
5 answers
4
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?
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?
User Avatar
16 votes
2 answers
5
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.
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.
User Avatar
22 votes
4 answers
6
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.
State whether the following statements are TRUE or FALSE:The union of two equivalence relations is also an equivalence relation.
User Avatar
18 votes
3 answers
7
GATE CSE 1987 | Question: 1-xxiii
A square matrix is singular whenever The rows are linearly independent The columns are linearly independent The row are linearly dependent None of the above
A square matrix is singular whenever The rows are linearly independentThe columns are linearly independentThe row are linearly dependentNone of the above
User Avatar
25 votes
4 answers
8
GATE CSE 1987 | Question: 1-II
The total number of Boolean functions which can be realised with four variables is: $4$ $17$ $256$ $65, 536$
The total number of Boolean functions which can be realised with four variables is:$4$$17$$256$$65, 536$
User Avatar
24 votes
3 answers
9
GATE CSE 1987 | Question: 9b
How many one-to-one functions are there from a set $A$ with $n$ elements onto itself?
How many one-to-one functions are there from a set $A$ with $n$ elements onto itself?
User Avatar
21 votes
3 answers
10
GATE CSE 1987 | Question: 2n
State whether the following statements are TRUE or FALSE: A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2\rangle$ and $\langle 2, 2 \rangle$ can both be in $r$ simultaneously.
State whether the following statements are TRUE or FALSE:A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2...
User Avatar
23 votes
9 answers
11
GATE CSE 1987 | Question: 10e
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
User Avatar
17 votes
5 answers
12
GATE CSE 1987 | Question: 2h
State whether the following statements are TRUE or FALSE: Regularity is preserved under the operation of string reversal.
State whether the following statements are TRUE or FALSE:Regularity is preserved under the operation of string reversal.
User Avatar
16 votes
4 answers
14
GATE CSE 1987 | Question: 1-xiv
An operator precedence parser is a Bottom-up parser. Top-down parser. Back tracking parser. None of the above.
An operator precedence parser is aBottom-up parser.Top-down parser.Back tracking parser.None of the above.
User Avatar
23 votes
3 answers
15
GATE CSE 1987 | Question: 1-xv
In a circular linked list organization, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
In a circular linked list organization, insertion of a record involves modification ofOne pointer.Two pointers.Multiple pointers.No pointer.
User Avatar
13 votes
2 answers
16
GATE CSE 1987 | Question: 2i
State whether the following statements are TRUE or FALSE: All subsets of regular sets are regular.
State whether the following statements are TRUE or FALSE:All subsets of regular sets are regular.
User Avatar
15 votes
2 answers
17
GATE CSE 1987 | Question: 1-xvii
Using longer identifiers in a program will necessarily lead to: Somewhat slower compilation A program that is easier to understand An incorrect program None of the above
Using longer identifiers in a program will necessarily lead to:Somewhat slower compilationA program that is easier to understandAn incorrect programNone of the above
User Avatar
25 votes
2 answers
18
GATE CSE 1987 | Question: 9e
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
User Avatar
21 votes
4 answers
19
GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.
User Avatar
2 votes
3 answers
20
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/O-mapped -I/O scheme.
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/...
User Avatar
Page: