Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Kathleen
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Kathleen
25
votes
4
answers
121
GATE CSE 1995 | Question: 2.5
What values of $A, B, C$ and $D$ satisfy the following simultaneous Boolean equations? $\overline{A} + AB =0, AB=AC, AB+A\overline{C}+CD=\overline{C}D$ $A=1, B=0, C=0, D=1$ $A=1, B=1, C=0, D=0$ $A=1, B=0, C=1, D=1$ $A=1, B=0, C=0, D=0$
What values of $A, B, C$ and $D$ satisfy the following simultaneous Boolean equations?$\overline{A} + AB =0, AB=AC, AB+A\overline{C}+CD=\overline{C}D$$A=1, B=0, C=0, D=1$...
7.6k
views
asked
Oct 8, 2014
Digital Logic
gate1995
digital-logic
boolean-algebra
easy
+
–
13
votes
6
answers
122
GATE CSE 1995 | Question: 2.4
What is the value of $X$ printed by the following program? program COMPUTE (input, output); var X:integer; procedure FIND (X:real); begin X:=sqrt(X); end; begin X:=2 FIND(X); writeln(X); end. $2$ $\sqrt{2}$ Run time error None of the above
What is the value of $X$ printed by the following program?program COMPUTE (input, output); var X:integer; procedure FIND (X:real); begin X:=sqrt(X); end; begin X:=2 FIND(...
6.9k
views
asked
Oct 8, 2014
Compiler Design
gate1995
compiler-design
parameter-passing
runtime-environment
easy
+
–
11
votes
3
answers
123
GATE CSE 1995 | Question: 2.3
Assume that $X$ and $Y$ are non-zero positive integers. What does the following Pascal program segment do? while X <> Y do if X > Y then X := X - Y else Y := Y - X; write(X); Computes the LCM of two numbers Divides the larger number by the smaller number Computes the GCD of two numbers None of the above
Assume that $X$ and $Y$ are non-zero positive integers. What does the following Pascal program segment do?while X < Y do if X Y then X := X - Y else Y := Y - X; write(X)...
3.6k
views
asked
Oct 8, 2014
Algorithms
gate1995
algorithms
identify-function
normal
+
–
29
votes
3
answers
124
GATE CSE 1995 | Question: 2.2
The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of $4K \times 16$? $10$ address, $16$ data lines $11$ address, $8$ data lines $12$ address, $16$ data lines $12$ address, $12$ data lines
The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of...
11.6k
views
asked
Oct 8, 2014
Digital Logic
gate1995
digital-logic
memory-interfacing
normal
+
–
0
votes
1
answer
125
GATE CSE 1995 | Question: 2.1
A sequence of two instructions that multiplies the contents of the DE register pair by 2 and stores the result in the HL register pair (in 8085 assembly language) is: XCHG and DAD B XTHL and DAD H PCHL and DAD D XCHG and DAD H
A sequence of two instructions that multiplies the contents of the DE register pair by 2 and stores the result in the HL register pair (in 8085 assembly language) is:XCHG...
3.7k
views
asked
Oct 8, 2014
CO and Architecture
gate1995
co-and-architecture
8085-microprocessor
out-of-gate-syllabus
+
–
33
votes
5
answers
126
GATE CSE 1995 | Question: 1.25
The minimum number of edges in a connected cyclic graph on $n$ vertices is: $n-1$ $n$ $n+1$ None of the above
The minimum number of edges in a connected cyclic graph on $n$ vertices is:$n-1$$n$$n+1$None of the above
21.0k
views
asked
Oct 8, 2014
Graph Theory
gate1995
graph-theory
graph-connectivity
easy
+
–
23
votes
7
answers
127
GATE CSE 1995 | Question: 1.24
The rank of the following $(n+1) \times (n+1)$ matrix, where $a$ ... $1$ $2$ $n$ Depends on the value of $a$
The rank of the following $(n+1) \times (n+1)$ matrix, where $a$ is a real number is $$ \begin{bmatrix} 1 & a & a^2 & \dots & a^n \\ 1 & a & a^2 & \dots & a^n \\ \vdots ...
5.0k
views
asked
Oct 8, 2014
Linear Algebra
gate1995
linear-algebra
matrix
normal
rank-of-matrix
+
–
0
votes
2
answers
128
GATE CSE 1995 | Question: 1.23
The value of $k$ for which $4x^2 – 8xy + ky^2 = 0$ does not represent a pair of straight lines (both passing through the origin) is: 0 2 9 3
The value of $k$ for which $4x^2 – 8xy + ky^2 = 0$ does not represent a pair of straight lines (both passing through the origin) is:0293
768
views
asked
Oct 8, 2014
Others
gate1995
lines-curves
out-of-gate-syllabus
+
–
2
votes
2
answers
129
GATE CSE 1995 | Question: 1.22
If at every point of a certain curve, the slope of the tangent equals $\frac{-2x}{y}$ the curve is a straight line a parabola a circle an ellipse
If at every point of a certain curve, the slope of the tangent equals $\frac{-2x}{y}$ the curve isa straight linea parabolaa circlean ellipse
2.5k
views
asked
Oct 8, 2014
Others
gate1995
lines-curves
out-of-gate-syllabus
+
–
26
votes
3
answers
130
GATE CSE 1995 | Question: 1.21
In the interval $[0, \pi]$ the equation $x=\cos x$ has No solution Exactly one solution Exactly two solutions An infinite number of solutions
In the interval $[0, \pi]$ the equation $x=\cos x$ has No solutionExactly one solutionExactly two solutionsAn infinite number of solutions
5.6k
views
asked
Oct 8, 2014
Calculus
gate1995
calculus
normal
maxima-minima
+
–
24
votes
6
answers
131
GATE CSE 1995 | Question: 1.20
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is: $2$ $4$ $8$ None of the above
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is:$2$$4$$8$None of the above
16.2k
views
asked
Oct 8, 2014
Set Theory & Algebra
gate1995
set-theory&algebra
normal
set-theory
+
–
28
votes
6
answers
132
GATE CSE 1995 | Question: 1.19
Let $R$ be a symmetric and transitive relation on a set $A$. Then $R$ is reflexive and hence an equivalence relation $R$ is reflexive and hence a partial order $R$ is reflexive and hence not an equivalence relation None of the above
Let $R$ be a symmetric and transitive relation on a set $A$. Then$R$ is reflexive and hence an equivalence relation$R$ is reflexive and hence a partial order$R$ is reflex...
14.2k
views
asked
Oct 8, 2014
Set Theory & Algebra
gate1995
set-theory&algebra
relations
normal
+
–
43
votes
6
answers
133
GATE CSE 1995 | Question: 1.17
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is $\log_2 n$ $n-1$ $n$ $2^n$
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is$\log_2 n$$n-1$$n$$2^n$
35.9k
views
asked
Oct 8, 2014
DS
gate1995
data-structures
binary-tree
normal
+
–
35
votes
6
answers
134
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of$O(m)$$O(n)$$O(m+n)$$O(\log m + \log n)$
47.6k
views
asked
Oct 8, 2014
Algorithms
gate1995
algorithms
sorting
normal
+
–
39
votes
4
answers
135
GATE CSE 1995 | Question: 1.15
Which scheduling policy is most suitable for a time shared operating system? Shortest Job First Round Robin First Come First Serve Elevator
Which scheduling policy is most suitable for a time shared operating system?Shortest Job FirstRound RobinFirst Come First ServeElevator
13.1k
views
asked
Oct 8, 2014
Operating System
gate1995
operating-system
process-scheduling
easy
+
–
44
votes
1
answer
136
GATE CSE 1995 | Question: 1.14
A linker is given object modules for a set of programs that were compiled separately. What information need to be included in an object module? Object code Relocation bits Names and locations of all external symbols defined in the object module Absolute addresses of internal symbols
A linker is given object modules for a set of programs that were compiled separately. What information need to be included in an object module?Object codeRelocation bitsN...
16.6k
views
asked
Oct 8, 2014
Compiler Design
gate1995
compiler-design
runtime-environment
normal
+
–
2
votes
0
answers
137
GATE CSE 1995 | Question: 1.13
1.4k
views
asked
Oct 8, 2014
Others
gate1995
out-of-syllabus-now
pascal
+
–
25
votes
5
answers
138
GATE CSE 1995 | Question: 1.12
What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$? $2$ $3$ $4$ $1$
What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$?$2$$3$$4$$1$
7.5k
views
asked
Oct 8, 2014
Computer Networks
gate1995
computer-networks
error-detection
normal
+
–
15
votes
3
answers
139
GATE CSE 1995 | Question: 1.11
What are $x$ and $y$ in the following macro definition? macro Add x, y Load y Mul x Store y end macro Variables Identifiers Actual parameters Formal parameters
What are $x$ and $y$ in the following macro definition?macro Add x, y Load y Mul x Store y end macroVariablesIdentifiersActual parametersFormal parameters
4.6k
views
asked
Oct 8, 2014
Compiler Design
gate1995
compiler-design
macros
easy
+
–
38
votes
3
answers
140
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$$S \rightarrow \alpha S\mid b$$S \rightarrow \alpha b b\mid ab$$...
18.1k
views
asked
Oct 8, 2014
Compiler Design
gate1995
compiler-design
grammar
normal
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
61
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register