Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions
14
votes
9
answers
201
GATE CSE 2017 Set 2 | Question: GA-2
Saturn is ___________ to be seen on a clear night with the naked eye. enough bright bright enough as enough bright bright as enough
Saturn is ___________ to be seen on a clear night with the naked eye.enough brightbright enoughas enough brightbright as enough
Arjun
4.4k
views
Arjun
asked
Feb 14, 2017
Verbal Aptitude
gatecse-2017-set2
verbal-aptitude
english-grammar
+
–
58
votes
9
answers
202
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
Arjun
17.9k
views
Arjun
asked
Feb 14, 2017
Combinatory
gatecse-2017-set2
combinatory
generating-functions
numerical-answers
normal
+
–
25
votes
9
answers
203
GATE CSE 2017 Set 1 | Question: 47
The number of integers between $1$ and $500$ (both inclusive) that are divisible by $3$ or $5$ or $7$ is ____________ .
The number of integers between $1$ and $500$ (both inclusive) that are divisible by $3$ or $5$ or $7$ is ____________ .
Arjun
11.8k
views
Arjun
asked
Feb 14, 2017
Set Theory & Algebra
gatecse-2017-set1
set-theory&algebra
normal
numerical-answers
set-theory
+
–
103
votes
9
answers
204
GATE CSE 2017 Set 1 | Question: 25
Consider a two-level cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
Consider a two-level cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rat...
Arjun
24.6k
views
Arjun
asked
Feb 14, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
cache-memory
numerical-answers
+
–
65
votes
9
answers
205
GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this repres...
Arjun
16.8k
views
Arjun
asked
Feb 14, 2017
Digital Logic
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
+
–
68
votes
9
answers
206
GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$.Consider the set of linear equations$...
Arjun
20.6k
views
Arjun
asked
Feb 14, 2017
Linear Algebra
gatecse-2017-set1
linear-algebra
system-of-equations
normal
+
–
47
votes
9
answers
207
GATE CSE 2017 Set 2 | Question: 25
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left | w_{1} \right | = 2, \left | w_{2} \right |\geq 3$} is ______________ .
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \righ...
Madhav
16.7k
views
Madhav
asked
Feb 14, 2017
Theory of Computation
theory-of-computation
gatecse-2017-set2
finite-automata
numerical-answers
minimal-state-automata
+
–
23
votes
9
answers
208
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))$
makhdoom ghaya
5.4k
views
makhdoom ghaya
asked
Nov 14, 2016
Mathematical Logic
gate1987
mathematical-logic
propositional-logic
proof
descriptive
+
–
2
votes
9
answers
209
MadeEasy Test Series: Computer Networks - Flow Control Methods
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets are ready and immediately available for transmission. If every ... gets lost), then the number of packets that X will transmit for sending the message to Y are _____.
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets ...
nvnverma18
2.4k
views
nvnverma18
asked
Sep 23, 2016
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
sliding-window
+
–
7
votes
9
answers
210
ISRO2014-3
What is the output of the following C program? #include<stdio.h> #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; } 14 36 18 20
What is the output of the following C program? #include<stdio.h #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; }14361820
pooja14
8.2k
views
pooja14
asked
Jun 22, 2016
Programming in C
programming-in-c
macros
isro2014
+
–
8
votes
9
answers
211
ISRO-2013-65
Consider the list of page references in the time line as below: 9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7 What is the working set at the penultimate page reference if ∆ is 5? {8, 5, 3, 2, 9, 6} {4, 3, 6, 2, 5} {3, 9, 6, 2, 7} {3, 9, 6, 2}
Consider the list of page references in the time line as below:9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7What is the working set at the ...
makhdoom ghaya
9.5k
views
makhdoom ghaya
asked
May 12, 2016
Operating System
isro2013
operating-system
memory-management
page-replacement
+
–
70
votes
9
answers
212
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j.$What would be the worst case time complex...
go_editor
20.0k
views
go_editor
asked
Apr 24, 2016
Algorithms
gatecse-2003
algorithms
sorting
normal
insertion-sort
+
–
65
votes
9
answers
213
GATE CSE 2016 Set 1 | Question: 38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &...
Sandeep Singh
24.3k
views
Sandeep Singh
asked
Feb 12, 2016
DS
gatecse-2016-set1
data-structures
graph-theory
normal
numerical-answers
+
–
92
votes
9
answers
214
GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)...
Sandeep Singh
21.9k
views
Sandeep Singh
asked
Feb 12, 2016
Set Theory & Algebra
gatecse-2016-set1
set-theory&algebra
functions
normal
numerical-answers
+
–
85
votes
9
answers
215
GATE CSE 2016 Set 1 | Question: 33
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is$\Theta (1)$$\...
Sandeep Singh
31.2k
views
Sandeep Singh
asked
Feb 12, 2016
Digital Logic
gatecse-2016-set1
digital-logic
adder
normal
+
–
34
votes
9
answers
216
GATE CSE 2016 Set 1 | Question: 07
The $16\text{-bit}\;2's$ complement representation of an integer is $1111 \quad 1111 \quad 1111 \quad 0101;$ its decimal representation is ____________
The $16\text{-bit}\;2's$ complement representation of an integer is $1111 \quad 1111 \quad 1111 \quad 0101;$ its decimal representation is ____________
Sandeep Singh
12.4k
views
Sandeep Singh
asked
Feb 12, 2016
Digital Logic
gatecse-2016-set1
digital-logic
number-representation
normal
numerical-answers
+
–
0
votes
9
answers
217
Let M range over Turing machine descriptions. Consider the set REG and let the complement of REG be Co-REG.
Let M range over Turing machine descriptions. Consider the set REG= {M | L(M) is a regular set} and let the complement of REG be Co-REG. Which of the following is true?(A...
Purple
1.4k
views
Purple
asked
Feb 2, 2016
Theory of Computation
theory-of-computation
+
–
4
votes
9
answers
218
exponential backoff
Nodes A and B are connected with 100 Mbps ethernet segment with 6 microsec pop.delay between them.Suppose A,B send frames at t=0 and frames get collided.after first collision A draws k=0 and bdraws k=1.if jam signal is ignored and timeout ... what time A's packet gets completely delivered to B...assume packet size 1000 bits. 28 microsec 16 microsec 22 microsec 38 microsec
Nodes A and B are connected with 100 Mbps ethernet segment with 6 microsec pop.delay between them.Suppose A,B send frames at t=0 and frames get collided.after first colli...
resuscitate
3.1k
views
resuscitate
asked
Dec 8, 2015
5
votes
9
answers
219
IPv6
Shefali
5.5k
views
Shefali
asked
Nov 8, 2015
Computer Networks
ipv6
+
–
9
votes
9
answers
220
ISRO2014-73
How many different trees are there with four nodes $\text{A, B, C}$ and $\text{D}?$ $30$ $60$ $90$ $120$
How many different trees are there with four nodes $\text{A, B, C}$ and $\text{D}?$$30$$60$$90$$120$
ajit
14.9k
views
ajit
asked
Sep 23, 2015
DS
isro2014
data-structures
tree
combinatory
+
–
Page:
« prev
1
...
6
7
8
9
10
11
12
13
14
15
16
...
3233
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register