Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged fill-in-the-blanks
23
votes
3
answers
31
GATE CSE 1994 | Question: 2.3
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
Kathleen
5.1k
views
Kathleen
asked
Oct 4, 2014
Set Theory & Algebra
gate1994
set-theory&algebra
normal
relations
fill-in-the-blanks
+
–
39
votes
4
answers
32
GATE CSE 1994 | Question: 2.2
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
On the set $N$ of non-negative integers, the binary operation ______ is associative and non-commutative.
Kathleen
5.7k
views
Kathleen
asked
Oct 4, 2014
Set Theory & Algebra
gate1994
set-theory&algebra
normal
group-theory
binary-operation
fill-in-the-blanks
+
–
19
votes
1
answer
33
GATE CSE 1994 | Question: 2-1
The number of flip-flops required to construct a binary modulo $N$ counter is __________
The number of flip-flops required to construct a binary modulo $N$ counter is __________
Kathleen
6.3k
views
Kathleen
asked
Oct 4, 2014
Digital Logic
gate1994
digital-logic
sequential-circuit
flip-flop
digital-counter
fill-in-the-blanks
+
–
0
votes
0
answers
34
GATE CSE 1993 | Question: 02.8
Given $\vec v= x\cos ^2y \hat i + x^2e^z\hat j+ z\sin^2y\hat k$ and $S$ the surface of a unit cube with one corner at the origin and edges parallel to the coordinate axes, the value of integral $\int^1 \int_s \vec V. \hat n dS$ is __________.
Given $\vec v= x\cos ^2y \hat i + x^2e^z\hat j+ z\sin^2y\hat k$ and $S$ the surface of a unit cube with one corner at the origin and edges parallel to the coordinate axes...
Kathleen
940
views
Kathleen
asked
Sep 13, 2014
Calculus
gate1993
calculus
normal
out-of-gate-syllabus
fill-in-the-blanks
+
–
24
votes
2
answers
35
GATE CSE 1993 | Question: 02.7
If $A = \begin{pmatrix} 1 & 0 & 0 & 1 \\ 0 & -1 & 0 & -1 \\ 0 & 0 & i & i \\ 0 & 0 & 0 & -i \end{pmatrix}$ the matrix $A^4$, calculated by the use of Cayley-Hamilton theorem or otherwise, is _______
If $A = \begin{pmatrix} 1 & 0 & 0 & 1 \\ 0 & -1 & 0 & -1 \\ 0 & 0 & i & i \\ 0 & 0 & 0 & -i \end{pmatrix}$ the matrix $A^4$, calculated by the use of Cayley-Hamilton theo...
Kathleen
5.6k
views
Kathleen
asked
Sep 13, 2014
Linear Algebra
gate1993
linear-algebra
normal
matrix
fill-in-the-blanks
+
–
4
votes
2
answers
36
GATE CSE 1993 | Question: 02.6
The value of the double integral $\int^{1}_{0} \int_{0}^{\frac{1}{x}} \frac {x}{1+y^2} dxdy$ is_________.
The value of the double integral $\int^{1}_{0} \int_{0}^{\frac{1}{x}} \frac {x}{1+y^2} dxdy$ is_________.
Kathleen
3.7k
views
Kathleen
asked
Sep 13, 2014
Calculus
gate1993
calculus
integration
normal
fill-in-the-blanks
out-of-gate-syllabus
+
–
0
votes
0
answers
37
GATE CSE 1993 | Question: 02.4
Kathleen
371
views
Kathleen
asked
Sep 13, 2014
Numerical Methods
gate1993
numerical-methods
runga-kutta-method
out-of-gate-syllabus
fill-in-the-blanks
+
–
1
votes
1
answer
38
GATE CSE 1993 | Question: 02.3
If the linear velocity $\vec V$ is given by $\vec V = x^2y\,\hat i + xyz\,\hat j – yz^2\,\hat k$ The angular velocity $\vec \omega$ at the point $(1, 1, -1)$ is ________
If the linear velocity $\vec V$ is given by $$\vec V = x^2y\,\hat i + xyz\,\hat j – yz^2\,\hat k$$The angular velocity $\vec \omega$ at the point $(1, 1, -1)$ is ______...
Kathleen
1.4k
views
Kathleen
asked
Sep 13, 2014
Linear Algebra
gate1993
linear-algebra
normal
vector-space
out-of-gate-syllabus
fill-in-the-blanks
+
–
1
votes
0
answers
39
GATE CSE 1993 | Question: 02.2
The radius of convergence of the power series$\sum_{}^{\infty} \frac{(3m)!}{(m!)^3}x^{3m}$ is: _____________
The radius of convergence of the power series$$\sum_{}^{\infty} \frac{(3m)!}{(m!)^3}x^{3m}$$ is: _____________
Kathleen
1.1k
views
Kathleen
asked
Sep 13, 2014
Calculus
gate1993
calculus
convergence
normal
out-of-gate-syllabus
fill-in-the-blanks
+
–
15
votes
3
answers
40
GATE CSE 1993 | Question: 02.1
$\displaystyle \lim_{x \to 0} \frac{x(e^x - 1) + 2(\cos x -1)}{x(1 - \cos x)}$ is __________
$\displaystyle \lim_{x \to 0} \frac{x(e^x - 1) + 2(\cos x -1)}{x(1 - \cos x)}$ is __________
Kathleen
3.7k
views
Kathleen
asked
Sep 13, 2014
Calculus
gate1993
limits
calculus
normal
fill-in-the-blanks
+
–
10
votes
1
answer
41
GATE CSE 1992 | Question: 01,x
Maximum number of edges in a planar graph with $n$ vertices is _____
Maximum number of edges in a planar graph with $n$ vertices is _____
Kathleen
5.5k
views
Kathleen
asked
Sep 12, 2014
Graph Theory
gate1992
graph-theory
graph-planarity
easy
fill-in-the-blanks
+
–
16
votes
4
answers
42
GATE CSE 1992 | Question: 01,viii
The purpose of instruction location counter in an assembler is _______
The purpose of instruction location counter in an assembler is _______
Kathleen
3.5k
views
Kathleen
asked
Sep 12, 2014
Compiler Design
gate1992
compiler-design
assembler
normal
fill-in-the-blanks
+
–
7
votes
3
answers
43
GATE CSE 1992 | Question: 01,vii
Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________
Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________
Kathleen
1.5k
views
Kathleen
asked
Sep 12, 2014
Compiler Design
gate1992
compiler-design
macros
easy
fill-in-the-blanks
+
–
11
votes
1
answer
44
GATE CSE 1992 | Question: 01,v
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the transmitter _______.
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the ...
Kathleen
3.1k
views
Kathleen
asked
Sep 12, 2014
Computer Networks
gate1992
computer-networks
network-flow
easy
fill-in-the-blanks
+
–
37
votes
10
answers
45
GATE CSE 1992 | Question: 01,ix
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Kathleen
17.3k
views
Kathleen
asked
Sep 12, 2014
Algorithms
gate1992
spanning-tree
algorithms
time-complexity
easy
fill-in-the-blanks
+
–
7
votes
4
answers
46
GATE CSE 1992 | Question: 01-iv
Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because ________
Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because ________
Kathleen
3.0k
views
Kathleen
asked
Sep 12, 2014
CO and Architecture
gate1992
co-and-architecture
easy
instruction-execution
fill-in-the-blanks
+
–
19
votes
2
answers
47
GATE CSE 1992 | Question: 01-iii
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because _____
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because _____
Kathleen
2.3k
views
Kathleen
asked
Sep 12, 2014
CO and Architecture
gate1992
normal
co-and-architecture
clock-frequency
fill-in-the-blanks
+
–
28
votes
4
answers
48
GATE CSE 1992 | Question: 01,ii
Consider a $3$-bit error detection and $1$-bit error correction hamming code for $4$-bit data. The extra parity bits required would be _____ and the $3$-bit error detection is possible because the code has a minimum distance of _______.
Consider a $3$-bit error detection and $1$-bit error correction hamming code for $4$-bit data. The extra parity bits required would be _____ and the $3$-bit error detecti...
Kathleen
11.7k
views
Kathleen
asked
Sep 12, 2014
Computer Networks
gate1992
computer-networks
error-detection
normal
fill-in-the-blanks
+
–
22
votes
4
answers
49
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
Kathleen
5.2k
views
Kathleen
asked
Sep 12, 2014
Digital Logic
gate1992
digital-logic
k-map
normal
fill-in-the-blanks
+
–
51
votes
4
answers
50
GATE CSE 1991 | Question: 01,xv
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
Kathleen
11.4k
views
Kathleen
asked
Sep 12, 2014
Graph Theory
gate1991
graph-theory
graph-connectivity
normal
fill-in-the-blanks
+
–
19
votes
3
answers
51
GATE CSE 1991 | Question: 01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
Kathleen
5.7k
views
Kathleen
asked
Sep 12, 2014
Set Theory & Algebra
gate1991
set-theory&algebra
partial-order
normal
fill-in-the-blanks
+
–
16
votes
1
answer
52
GATE CSE 1991 | Question: 01-xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
Kathleen
3.1k
views
Kathleen
asked
Sep 12, 2014
Operating System
gate1991
operating-system
normal
precedence-graph
fill-in-the-blanks
+
–
24
votes
3
answers
53
GATE CSE 1991 | Question: 1,vi
Consider the following PASCAL program segment: if i mod 2 = 0 then while i >= 0 do begin i := i div 2; if i mod 2 < > 0 then i := i - 1; else i := i – 2; end; An appropriate loop-invariant for the while-loop is ________
Consider the following PASCAL program segment:if i mod 2 = 0 then while i >= 0 do begin i := i div 2; if i mod 2 < 0 then i := i - 1; else i := i – 2; end;An appropria...
Kathleen
4.4k
views
Kathleen
asked
Sep 12, 2014
Programming in C
gate1991
programming
loop-invariants
normal
fill-in-the-blanks
+
–
37
votes
1
answer
54
GATE CSE 1991 | Question: 01-v
When two $4$-bit numbers $A = a_3a_2a_1a_0$ and $B=b_3b_2b_1b_0$ are multiplied, the bit $c_1$ of the product $C$ is given by ________
When two $4$-bit numbers $A = a_3a_2a_1a_0$ and $B=b_3b_2b_1b_0$ are multiplied, the bit $c_1$ of the product $C$ is given by ________
Kathleen
4.8k
views
Kathleen
asked
Sep 12, 2014
Digital Logic
gate1991
digital-logic
normal
number-representation
fill-in-the-blanks
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register