Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Satbir
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Satbir
21
votes
1
GATE CSE 2020 | Question: 55
Consider a $\textsf{TCP}$ connection between a client and a server with the following specifications; the round trip time is $6$ ms, the size of the receiver advertised window is $50$ KB, slow-start threshold at the client is $32$ KB, and the ... the size of the congestion window (in $\text{KB}$) at time $t+60$ ms after all acknowledgements are processed is _______
Consider a $\textsf{TCP}$ connection between a client and a server with the following specifications; the round trip time is $6$ ms, the size of the receiver advertised w...
14.2k
views
answered
Feb 13, 2020
Computer Networks
gatecse-2020
numerical-answers
computer-networks
tcp
2-marks
+
–
16
votes
2
GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
11.7k
views
answered
Feb 13, 2020
Databases
gatecse-2020
databases
transaction-and-concurrency
2-marks
+
–
31
votes
3
GATE CSE 2020 | Question: 17
Let $\mathcal{R}$ be the set of all binary relations on the set $\{1,2,3\}$. Suppose a relation is chosen from $\mathcal{R}$ at random. The probability that the chosen relation is reflexive (round off to $3$ decimal places) is ______.
Let $\mathcal{R}$ be the set of all binary relations on the set $\{1,2,3\}$. Suppose a relation is chosen from $\mathcal{R}$ at random. The probability that the chosen re...
9.1k
views
answered
Feb 12, 2020
Set Theory & Algebra
gatecse-2020
numerical-answers
probability
relations
1-mark
+
–
41
votes
4
GATE CSE 2020 | Question: 13
Consider a relational database containing the following schemas. ... WHERE pno = P4' GROUP BY pno) ; The number of rows returned by the above SQL query is $4$ $5$ $0$ $2$
Consider a relational database containing the following schemas.$$\overset{\text{Catalogue}} {\begin{array}{|c|c|c|} \hline \underline{\text{sno}} & \underline{\text{pno}...
13.4k
views
answered
Feb 12, 2020
Databases
gatecse-2020
databases
sql
1-mark
+
–
9
votes
5
GATE CSE 2020 | Question: 12
Consider the following statements about process state transitions for a system using preemptive scheduling. A running process can move to ready state. A ready process can move to running state. A blocked process can move to running state. A blocked process can move to ready state. ... TRUE? I, II, and III only II and III only I, II, and IV only I, II, III and IV only
Consider the following statements about process state transitions for a system using preemptive scheduling.A running process can move to ready state.A ready process can m...
12.7k
views
answered
Feb 12, 2020
Operating System
gatecse-2020
operating-system
process-scheduling
1-mark
easy
+
–
12
votes
6
GATE CSE 2020 | Question: GA-6
Goods and Services Tax (GST) is an indirect tax introduced in India in $2017$ that is imposed on the supply of goods and services, and it subsumes all indirect taxes except few. It is a destination-based tax imposed on goods and services used, ... indirect taxes. GST does not have a component specific to UT. GST is imposed at the point of usage of goods and services.
Goods and Services Tax (GST) is an indirect tax introduced in India in $2017$ that is imposed on the supply of goods and services, and it subsumes all indirect taxes exce...
3.2k
views
answered
Feb 12, 2020
Verbal Aptitude
gatecse-2020
verbal-aptitude
verbal-reasoning
passage-reading
2-marks
+
–
31
votes
7
GATE CSE 2020 | Question: 51
Consider the following language. $L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$ The minimum number of states in DFA that accepts $L$ is _________
Consider the following language.$L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$The minimum number of states in DFA that ...
13.3k
views
answered
Feb 12, 2020
Theory of Computation
gatecse-2020
numerical-answers
theory-of-computation
regular-language
2-marks
+
–
13
votes
8
ISRO2020-7
Consider a $5$- segment pipeline with a clock cycle time $20$ ns in each sub operation. Find out the approximate speed-up ratio between pipelined and non-pipelined system to execute $100$ instructions. (if an average, every five cycles, a bubble due to data hazard has to be introduced in the pipeline) $5$ $4.03$ $4.81$ $4.17$
Consider a $5$- segment pipeline with a clock cycle time $20$ ns in each sub operation. Find out the approximate speed-up ratio between pipelined and non-pipelined system...
7.2k
views
answered
Jan 23, 2020
CO and Architecture
isro-2020
co-and-architecture
pipelining
normal
+
–
8
votes
9
GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s?$(0+1 )^ *001...
20.6k
views
answered
Jan 7, 2020
Theory of Computation
gatecse-2016-set1
theory-of-computation
regular-expression
normal
+
–
7
votes
10
ISRO2014-37
The probability that two friends are born in the same month is ____ ? $1/6$ $1/12$ $1/144$ $1/24$
The probability that two friends are born in the same month is ____ ?$1/6$$1/12$$1/144$$1/24$
7.3k
views
answered
Jan 6, 2020
Probability
probability
isro2014
+
–
4
votes
11
Mathematics: GATE 2013 EC-A-27
Let A be an mxn matrix and B an nxm matrix. It is given that determinant ( Im + AB ) = determinant ( In + BA ) , where Ik is the k k identity matrix. Using the above property, the determinant of the matrix given below is ... A) 2 B) 5 C) 8 D) 16
Let A be an mxn matrix and B an nxm matrix.It is given that determinant ( Im + AB ) = determinant ( In + BA ) , where Ik is the k×k identity matrix. Using the above prop...
5.9k
views
answered
Jan 4, 2020
Linear Algebra
gate2013-ec
linear-algebra
engineering-mathematics
normal
determinant
+
–
3
votes
12
ISRO2018-6
A data driven machine is one that executes an instruction if the needed data is available. The physical ordering of the code listing does not dictate the course of execution. Consider the following pseudo-code: Multiply $E$ by $0.5$ to get $F$ Add $A$ and $B$ to get $E$ Add $B$ with $0.5$ to get ... sequence of execution is valid? B, C, D, A, E C, B, E, A, D A, B, C, D, E E, D, C, B, A
A data driven machine is one that executes an instruction if the needed data is available. The physical ordering of the code listing does not dictate the course of execut...
3.1k
views
answered
Jan 1, 2020
CO and Architecture
isro2018
co-and-architecture
instruction-format
+
–
1
votes
13
Madeeasy[CN-Flow control]
Consider two computers A and B are connected through a network of 30 Mbps.Assume the distance between them is 3000km and the signal propagation speed is same as the speed of light and the packet size is 12 KB. What is minimum number of bits required for window to achieve 100% utilization during GBN and SR protocol ?
Consider two computers A and B are connected through a network of 30 Mbps.Assume the distance between them is 3000km and the signal propagation speed is same as the speed...
1.2k
views
answered
Dec 22, 2019
Computer Networks
computer-networks
go-back-n
+
–
2
votes
14
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...
22.8k
views
answered
Dec 16, 2019
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
1
votes
15
TIFR CSE 2019 | Part A | Question: 11
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands multiple times. for some parties stretch late into the night , and it is hard to keep track.Still, ... $2 \mid \text{Odd} \mid - \mid \text{Even} \mid$
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands mul...
2.0k
views
answered
Dec 1, 2019
Analytical Aptitude
tifr2019
general-aptitude
analytical-aptitude
logical-reasoning
+
–
3
votes
16
TIFR CSE 2019 | Part A | Question: 6
A function $f: \mathbb{R} \rightarrow \mathbb{R}$ is said to be $\textit{convex}$ if for all $x,y \in \mathbb{R}$ and $\lambda$ such that $0 \leq \lambda \leq1,$ $f(\lambda x+ (1-\lambda)y) \leq \lambda f (x) + (1-\lambda) f(y)$. Let $f:$\ ... . Which of the functions $p,q$ and $r$ must be convex? Only $p$ Only $q$ Only $r$ Only $p$ and $r$ Only $q$ and $r$
A function $f: \mathbb{R} \rightarrow \mathbb{R}$ is said to be $\textit{convex}$ if for all $x,y \in \mathbb{R}$ and $\lambda$ such that $0 \leq \lambda \leq1,$ $f(...
1.0k
views
answered
Dec 1, 2019
Set Theory & Algebra
tifr2019
set-theory&algebra
functions
convex-sets-functions
non-gate
+
–
14
votes
17
GATE CSE 1995 | Question: 2.13
A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is: $\frac{1}{\sqrt{3}} (i+j+k)$ $\frac{1}{3} (i+j-k)$ $\frac{1}{3} (i-j-k)$ $\frac{1}{\sqrt{3}} (i+j-k)$
A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is:$\frac{1}{\sqrt{3}} (i+j+k)$$\frac{1}{3} (i+j-k)$$\frac{1}{3} (i-j-k)$$\frac{1}{\sqrt{3}} (i...
4.0k
views
answered
Nov 28, 2019
Linear Algebra
gate1995
linear-algebra
normal
vector-space
+
–
0
votes
18
Hamming Code
3.2k
views
answered
Nov 21, 2019
Digital Logic
digital-logic
hamming-code
+
–
0
votes
19
TIFR CSE 2012 | Part A | Question: 17
A spider is at the bottom of a cliff, and is $n$ inches from the top. Every step it takes brings it one inch closer to the top with probability $1/3$, and one inch away from the top with probability $2/3$, unless it is at the bottom in which ... $n$? It will never reach the top. Linear in $n$. Polynomial in $n$. Exponential in $n$. Double exponential in $n$.
A spider is at the bottom of a cliff, and is $n$ inches from the top. Every step it takes brings it one inch closer to the top with probability $1/3$, and one inch away f...
2.3k
views
answered
Nov 17, 2019
Probability
tifr2012
probability
binomial-distribution
+
–
59
votes
20
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
20.4k
views
answered
Nov 2, 2019
Probability
gatecse-2017-set1
probability
numerical-answers
normal-distribution
+
–
2
votes
21
TIFR CSE 2015 | Part A | Question: 6
Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin until he gets heads in two consecutive tosses. The expected number of coin tosses that Ram does is. $2$ $4$ $6$ $8$ None of the above
Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin u...
5.0k
views
answered
Oct 28, 2019
Probability
tifr2015
expectation
+
–
6
votes
22
TIFR CSE 2011 | Part A | Question: 6
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for the first time is. $4$ $3$ $6$ $10$ $5$
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for...
5.8k
views
answered
Oct 28, 2019
Probability
tifr2011
probability
expectation
+
–
3
votes
23
GATE CSE 1997 | Question: 4.2
Let $A=(a_{ij})$ be an $n$-rowed square matrix and $I_{12}$ be the matrix obtained by interchanging the first and second rows of the $n$-rowed Identity matrix. Then $AI_{12}$ is such that its first Row is the same as its second row Row is the same as the second row of $A$ Column is the same as the second column of $A$ Row is all zero
Let $A=(a_{ij})$ be an $n$-rowed square matrix and $I_{12}$ be the matrix obtained by interchanging the first and second rows of the $n$-rowed Identity matrix. Then $AI_{...
4.8k
views
answered
Oct 24, 2019
Linear Algebra
gate1997
linear-algebra
easy
matrix
+
–
25
votes
24
GATE CSE 2019 | Question: 49
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is ______
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum ...
19.7k
views
answered
Oct 24, 2019
Computer Networks
gatecse-2019
numerical-answers
computer-networks
lan-technologies
2-marks
+
–
7
votes
25
GATE CSE 2017 Set 2 | Question: 22
Let $P = \begin{bmatrix}1 & 1 & -1 \\2 & -3 & 4 \\3 & -2 & 3\end{bmatrix}$ and $Q = \begin{bmatrix}-1 & -2 &-1 \\6 & 12 & 6 \\5 & 10 & 5\end{bmatrix}$ be two matrices. Then the rank of $ P+Q$ is ___________ .
Let $P = \begin{bmatrix}1 & 1 & -1 \\2 & -3 & 4 \\3 & -2 & 3\end{bmatrix}$ and $Q = \begin{bmatrix}-1 & -2 &-1 \\6 & 12 & 6 \\5 & 10 & 5\end{bmatrix}$ be two matrices.Th...
11.7k
views
answered
Oct 23, 2019
Linear Algebra
gatecse-2017-set2
linear-algebra
eigen-value
numerical-answers
+
–
2
votes
26
GATE CSE 2005 | Question: 49
What are the eigenvalues of the following $2\times 2$ matrix? $\left( \begin{array}{cc} 2 & -1\\ -4 & 5\end{array}\right)$ $-1$ and $1$ $1$ and $6$ $2$ and $5$ $4$ and $-1$
What are the eigenvalues of the following $2\times 2$ matrix? $$\left( \begin{array}{cc} 2 & -1\\ -4 & 5\end{array}\right)$$$-1$ and $1$$1$ and $6$$2$ and $5$$4$ and $-1$...
6.0k
views
answered
Oct 23, 2019
Linear Algebra
gatecse-2005
linear-algebra
eigen-value
easy
+
–
0
votes
27
GATE CSE 2014 Set 3 | Question: 43
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies $1$ ns, $2.2 $ ns, $2$ ... program on the old and the new design are $P$ and $Q$ nanoseconds, respectively. The value of $P/Q$ is __________.
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), a...
22.0k
views
answered
Oct 21, 2019
CO and Architecture
gatecse-2014-set3
co-and-architecture
pipelining
numerical-answers
normal
+
–
5
votes
28
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 11
A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, respectively. $L_1, L_2$ ... until a complete memory block gets transferred, what is the average access time? $103$ ns $220$ ns $150$ ns $135$ ns
A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, re...
979
views
answered
Oct 19, 2019
CO and Architecture
tbb-coa-1
co-and-architecture
cache-memory
multilevel-cache
+
–
15
votes
29
GATE CSE 2009 | Question: 29
Consider a $4$-way set associative cache (initially empty) with total $16$ cache blocks. The main memory consists of $256$ ... $3$ $8$ $129$ $216$
Consider a $4$-way set associative cache (initially empty) with total $16$ cache blocks. The main memory consists of $256$ blocks and the request for memory blocks are in...
14.5k
views
answered
Oct 19, 2019
CO and Architecture
gatecse-2009
co-and-architecture
cache-memory
normal
+
–
7
votes
30
GATE CSE 1998 | Question: 18
For a set-associative Cache organization, the parameters are as follows: ... $1 \leq m \leq l$. Give the value of the hit ratio for $l = 1$.
For a set-associative Cache organization, the parameters are as follows:$$\begin{array}{|c|l|} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$t _m$} &...
11.9k
views
answered
Oct 18, 2019
CO and Architecture
gate1998
co-and-architecture
cache-memory
descriptive
+
–
Page:
1
2
3
4
5
6
...
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register