Register

Recent questions tagged gate1998

24 votes
2 answers
61
GATE CSE 1998 | Question: 1.26
Which of the following statements is true? SLR parser is more powerful than LALR LALR parser is more powerful than Canonical LR parser Canonical LR parser is more powerful than LALR parser The parsers SLR, Canonical CR, and LALR have the same power
Which of the following statements is true?SLR parser is more powerful than LALRLALR parser is more powerful than Canonical LR parserCanonical LR parser is more powerful t...
User Avatar
26 votes
3 answers
62
GATE CSE 1998 | Question: 1.25, ISRO2008-41
In a resident – OS computer, which of the following systems must reside in the main memory under all situations? Assembler Linker Loader Compiler
In a resident – OS computer, which of the following systems must reside in the main memory under all situations?AssemblerLinkerLoaderCompiler
User Avatar
23 votes
3 answers
64
GATE CSE 1998 | Question: 1.23
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$? $n$ $n^2$ $2^n$ $\frac{n(n+1)}{2}$
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$?$n$$n^2$$2^n$$\frac{n(n+1)}{2}$
User Avatar
26 votes
3 answers
65
GATE CSE 1998 | Question: 1.22
Give the correct matching for the following pairs: ... $\text{A-R B-P C-S D-Q}$ $\text{A-P B-R C-S D-Q}$ $\text{A-P B-S C-R D-Q}$
Give the correct matching for the following pairs: $$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(P)} & \text{Selection} \\\hline \text{(B)} & \t...
User Avatar
25 votes
2 answers
66
GATE CSE 1998 | Question: 1.21, ISRO2008-16
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph? Dynamic programming Backtracking Greedy Divide and Conquer
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?Dynamic programmingBacktrackingGreedyDivide and Conqu...
User Avatar
40 votes
4 answers
68
GATE CSE 1998 | Question: 1.19
Which of the following addressing modes permits relocation without any change whatsoever in the code? Indirect addressing Indexed addressing Base register addressing PC relative addressing
Which of the following addressing modes permits relocation without any change whatsoever in the code?Indirect addressingIndexed addressingBase register addressingPC relat...
User Avatar
28 votes
4 answers
69
GATE CSE 1998 | Question: 1.18
Which of the following devices should get higher priority in assigning interrupts? Hard disk Printer Keyboard Floppy disk
Which of the following devices should get higher priority in assigning interrupts?Hard diskPrinterKeyboardFloppy disk
User Avatar
31 votes
2 answers
70
GATE CSE 1998 | Question: 1.17
The octal representation of an integer is $(342)_8$. If this were to be treated as an eight-bit integer in an $8085$ based computer, its decimal equivalent is $226$ $-98$ $76$ $-30$
The octal representation of an integer is $(342)_8$. If this were to be treated as an eight-bit integer in an $8085$ based computer, its decimal equivalent is$226$$-98$$7...
User Avatar
1 votes
1 answer
72
GATE CSE 1998 | Question: 1.15
The threshold level for logic 1 in the TTL family is any voltage above 2.5 V any voltage between 0.8 V and 5.0 V any voltage below 5.0 V any voltage below V$_{cc}$ but above 2.8 V
The threshold level for logic 1 in the TTL family isany voltage above 2.5 Vany voltage between 0.8 V and 5.0 Vany voltage below 5.0 Vany voltage below V$_{cc}$ but above ...
User Avatar
24 votes
1 answer
73
GATE CSE 1998 | Question: 1.14
A multiplexer with a $4-bit$ data select input is a $4:1$ multiplexer $2:1$ multiplexer $16:1$ multiplexer $8:1$ multiplexer
A multiplexer with a $4-bit$ data select input is a$4:1$ multiplexer$2:1$ multiplexer$16:1$ multiplexer$8:1$ multiplexer
User Avatar
42 votes
4 answers
74
GATE CSE 1998 | Question: 1.13
What happens when a bit-string is XORed with itself $n$-times as shown: $\left[B \oplus (B \oplus ( B \oplus (B \dots n \text{ times}\right]$ complements when $n$ is even complements when $n$ is odd divides by $2^n$ always remains unchanged when $n$ is even
What happens when a bit-string is XORed with itself $n$-times as shown:$\left[B \oplus (B \oplus ( B \oplus (B \dots n \text{ times}\right]$complements when $n$ is evenco...
User Avatar
41 votes
7 answers
75
GATE CSE 1998 | Question: 1.12
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$
The string $1101$ does not belong to the set represented by$110^*(0 + 1)$$1(0 + 1)^*101$$(10)^*(01)^*(00 + 11)^*$$(00 + (11)^*0)^*$
User Avatar
37 votes
4 answers
78
GATE CSE 1998 | Question: 1.9
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is true? $A \subset B$ $B \subset A$ $A$ and $B$ are incomparable $A = B$
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is t...
User Avatar
20 votes
4 answers
79
GATE CSE 1998 | Question: 1.8
The number of functions from an $m$ element set to an $n$ element set is $m + n$ $m^n$ $n^m$ $m*n$
The number of functions from an $m$ element set to an $n$ element set is$m + n$$m^n$$n^m$$m*n$
User Avatar
19 votes
5 answers
81
GATE CSE 1998 | Question: 1.6
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is $n$ $n^2$ $1$ $n+1$
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is$n$$n^2$$1$$n+1$
User Avatar
40 votes
5 answers
82
GATE CSE 1998 | Question: 1.5
What is the converse of the following assertion? I stay only if you go I stay if you go If I stay then you go If you do not go then I do not stay If I do not stay then you go
What is the converse of the following assertion?I stay only if you goI stay if you goIf I stay then you goIf you do not go then I do not stayIf I do not stay then you go
User Avatar
12 votes
6 answers
83
GATE CSE 1998 | Question: 1.4
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function is continuous and differentiable continuous but not differentiable differentiable but not continuous neither continuous nor differentiable
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function iscontinuous and differentiablecontinuous but not differentiabledifferentiable but...
User Avatar
22 votes
3 answers
85
GATE CSE 1998 | Question: 1.2
Consider the following set of equations $x+2y=5$ $4x+8y=12$ $3x+6y+3z=15$ This set has unique solution has no solution has finite number of solutions has infinite number of solutions
Consider the following set of equations$x+2y=5$$4x+8y=12$$3x+6y+3z=15$This sethas unique solutionhas no solutionhas finite number of solutionshas infinite number of solut...
User Avatar
31 votes
8 answers
86
GATE CSE 1998 | Question: 1.1
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is$\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}...
User Avatar
Page: