Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
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
Kathleen
asked
in
Compiler Design
Sep 25, 2014
by
Kathleen
12.6k
views
gate1998
compiler-design
parsing
normal
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
Kathleen
asked
in
Compiler Design
Sep 25, 2014
by
Kathleen
9.3k
views
gate1998
compiler-design
runtime-environment
normal
isro2008
37
votes
5
answers
63
GATE CSE 1998 | Question: 1.24
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves. The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$
Kathleen
asked
in
DS
Sep 25, 2014
by
Kathleen
16.8k
views
gate1998
data-structures
tree
multiple-selects
normal
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}$
Kathleen
asked
in
Combinatory
Sep 25, 2014
by
Kathleen
14.5k
views
gate1998
combinatory
normal
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}$
Kathleen
asked
in
Algorithms
Sep 25, 2014
by
Kathleen
7.8k
views
gate1998
algorithms
sorting
easy
match-the-following
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
Kathleen
asked
in
Algorithms
Sep 25, 2014
by
Kathleen
9.1k
views
gate1998
algorithms
algorithm-design-technique
easy
isro2008
36
votes
2
answers
67
GATE CSE 1998 | Question: 1.20
Which of the following is true? Unless enabled, a CPU will not be able to process interrupts. Loop instructions cannot be interrupted till they complete. A processor checks for interrupts before executing a new instruction. Only level triggered interrupts are possible on microprocessors.
Kathleen
asked
in
CO and Architecture
Sep 25, 2014
by
Kathleen
11.8k
views
gate1998
co-and-architecture
interrupts
normal
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
Kathleen
asked
in
CO and Architecture
Sep 25, 2014
by
Kathleen
11.0k
views
gate1998
co-and-architecture
addressing-modes
easy
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
Kathleen
asked
in
Operating System
Sep 25, 2014
by
Kathleen
12.3k
views
gate1998
operating-system
interrupts
normal
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$
Kathleen
asked
in
Digital Logic
Sep 25, 2014
by
Kathleen
8.1k
views
gate1998
digital-logic
number-representation
normal
8085-microprocessor
19
votes
2
answers
71
GATE CSE 1998 | Question: 1.16
In serial communication employing $8$ data bits, a parity bit and $2$ stop bits, the minimum band rate required to sustain a transfer rate of $300$ characters per second is $2400$ band $19200$ band $4800$ band $1200$ band
Kathleen
asked
in
Computer Networks
Sep 25, 2014
by
Kathleen
8.6k
views
gate1998
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
1
vote
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
Kathleen
asked
in
Digital Logic
Sep 25, 2014
by
Kathleen
3.0k
views
gate1998
digital-logic
integrated-circuits
out-of-syllabus-now
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
Kathleen
asked
in
Digital Logic
Sep 25, 2014
by
Kathleen
9.0k
views
gate1998
digital-logic
multiplexer
easy
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
Kathleen
asked
in
Digital Logic
Sep 25, 2014
by
Kathleen
10.1k
views
gate1998
digital-logic
normal
boolean-algebra
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)^*$
Kathleen
asked
in
Theory of Computation
Sep 25, 2014
by
Kathleen
23.0k
views
gate1998
theory-of-computation
regular-expression
easy
multiple-selects
20
votes
1
answer
76
GATE CSE 1998 | Question: 1.11
Regarding the power of recognition of languages, which of the following statements is false? The non-deterministic finite-state automata are equivalent to deterministic finite-state automata. Non-deterministic Push-down automata are equivalent ... to deterministic Turing machines. Multi-tape Turing machines are available are equivalent to Single-tape Turing machines.
Kathleen
asked
in
Theory of Computation
Sep 25, 2014
by
Kathleen
8.2k
views
gate1998
theory-of-computation
easy
non-determinism
56
votes
4
answers
77
GATE CSE 1998 | Question: 1.10
Which of the following set can be recognized by a Deterministic Finite state Automaton? The numbers $1, 2, 4, 8, \dots 2^n, \dots$ written in binary The numbers $1, 2, 4, 8,\dots 2^n, \dots$ written in unary The set of binary string in which the number of zeros is the same as the number of ones. The set $\{1, 101, 11011, 1110111, \dots\}$
Kathleen
asked
in
Theory of Computation
Sep 25, 2014
by
Kathleen
15.4k
views
gate1998
theory-of-computation
finite-automata
normal
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$
Kathleen
asked
in
Theory of Computation
Sep 25, 2014
by
Kathleen
11.2k
views
gate1998
theory-of-computation
regular-expression
normal
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$
Kathleen
asked
in
Set Theory & Algebra
Sep 25, 2014
by
Kathleen
8.1k
views
gate1998
set-theory&algebra
combinatory
functions
easy
30
votes
3
answers
80
GATE CSE 1998 | Question: 1.7
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions: $R_1 \cup R_2$ is an equivalence relation $R_1 \cap R_2$ is an equivalence relation Which of the following is correct? Both assertions are true Assertions (i) is true ... (ii) is not true Assertions (ii) is true but assertions (i) is not true Neither (i) nor (ii) is true
Kathleen
asked
in
Set Theory & Algebra
Sep 25, 2014
by
Kathleen
12.4k
views
gate1998
set-theory&algebra
relations
normal
18
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$
Kathleen
asked
in
Set Theory & Algebra
Sep 25, 2014
by
Kathleen
9.4k
views
gate1998
set-theory&algebra
relations
easy
39
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
Kathleen
asked
in
Mathematical Logic
Sep 25, 2014
by
Kathleen
13.8k
views
gate1998
mathematical-logic
easy
propositional-logic
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
Kathleen
asked
in
Calculus
Sep 25, 2014
by
Kathleen
5.4k
views
gate1998
calculus
continuity
differentiation
easy
1
vote
1
answer
84
GATE CSE 1998 | Question: 1.3
Which of the following statements applies to the bisection method used for finding roots of functions: converges within a few iterations guaranteed to work for all continuous functions is faster than the Newton-Raphson method requires that there be no error in determining the sign of the function
Kathleen
asked
in
Numerical Methods
Sep 25, 2014
by
Kathleen
22.1k
views
gate1998
numerical-methods
bisection-method
easy
out-of-gate-syllabus
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
Kathleen
asked
in
Linear Algebra
Sep 25, 2014
by
Kathleen
7.1k
views
gate1998
linear-algebra
system-of-equations
easy
30
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}$
Kathleen
asked
in
Probability
Sep 25, 2014
by
Kathleen
8.5k
views
gate1998
probability
easy
28
votes
2
answers
87
GATE2001-1.23, UGCNET-June2012-III: 18
Consider a schema $R(A,B,C,D)$ and functional dependencies $A \rightarrow B$ and $C \rightarrow D$. Then the decomposition of R into $R_1 (A,B)$ and $R_2(C,D)$ is dependency preserving and lossless join lossless join but not dependency preserving dependency preserving but not lossless join not dependency preserving and not lossless join
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
8.2k
views
gate1998
databases
ugcnetcse-june2012-paper3
database-normalization
Page:
« prev
1
2
3
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged gate1998
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...