Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rish-18
3
answers
1
GATE CSE 2021 Set 1 | Question: 44
A $\text{TCP}$ server application is programmed to listen on port number $P$ on host $S$. A $\text{TCP}$ client is connected to the $\text{TCP}$ server over the network. Consider that while the $\text{TCP}$ connection was active, the ... receive a $\text{RST}$ segment If the client sends a packet after the server reboot, it will receive a $\text{FIN}$ segment
A $\text{TCP}$ server application is programmed to listen on port number $P$ on host $S$. A $\text{TCP}$ client is connected to the $\text{TCP}$ server over the network.C...
13.0k
views
commented
Sep 18, 2021
Computer Networks
gatecse-2021-set1
multiple-selects
computer-networks
tcp
2-marks
+
–
9
answers
2
GATE CSE 2021 Set 1 | GA Question: 9
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$ $\text{Statement 1:}$ All bacteria are microorganisms. $\text{Statement 2:}$ All pathogens are microorganisms. $\text{Conclusion I:}$ Some pathogens are ... Either conclusion $\text{I}$ or $\text{II}$ is correct Neither conclusion $\text{I}$ nor $\text{II}$ is correct
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$$\text{Statement 1:}$ All bacteria are microorganisms.$\text{Statement 2:}$ All ...
14.3k
views
commented
Feb 22, 2021
Analytical Aptitude
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
+
–
4
answers
3
GATE CSE 2005 | Question: 75
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simple-valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is one-to-many and $R_2$ is many-to-many. $R_1$ and $R_2$ do not have ... of their own. What is the minimum number of tables required to represent this situation in the relational model? $2$ $3$ $4$ $5$
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simple-valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is one-t...
18.6k
views
commented
Feb 1, 2021
Databases
gatecse-2005
databases
er-diagram
normal
+
–
3
answers
4
GATE CSE 1999 | Question: 1.25
Which of the following is correct? B-trees are for storing data on disk and B$^+$ trees are for main memory. Range queries are faster on B$^+$ trees. B-trees are for primary indexes and B$^+$ trees are for secondary indexes. The height of a B$^+$ tree is independent of the number of records.
Which of the following is correct?B-trees are for storing data on disk and B$^+$ trees are for main memory.Range queries are faster on B$^+$ trees.B-trees are for primary...
14.5k
views
commented
Jan 31, 2021
Databases
gate1999
databases
b-tree
normal
+
–
6
answers
5
GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...
23.8k
views
commented
Jan 29, 2021
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
10
answers
6
GATE CSE 2009 | Question: 28
Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ ... the number of cycles needed to execute the following loop? For (i=1 to 2) {I1; I2; I3; I4;} $16$ $23$ $28$ $30$
Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ is shown below:$$\begin{array}{|...
34.7k
views
commented
Jan 22, 2021
CO and Architecture
gatecse-2009
co-and-architecture
pipelining
normal
+
–
6
answers
7
GATE IT 2004 | Question: 64
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); The number of new processes created is $n$ $((n(n + 1))/2)$ $2^n - 1$ $3^n - 1$
A process executes the following segment of code :for(i = 1; i <= n; i++) fork ();The number of new processes created is$n$$((n(n + 1))/2)$$2^n - 1$$3^n - 1$
12.0k
views
answered
Nov 14, 2020
Operating System
gateit-2004
operating-system
fork-system-call
easy
+
–
14
answers
8
GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level...
76.7k
views
commented
Aug 31, 2020
Operating System
gatecse-2008
operating-system
virtual-memory
normal
+
–
10
answers
9
GATE CSE 2003 | Question: 36
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
How many perfect matching are there in a complete graph of $6$ vertices?$15$$24$$30$$60$
50.5k
views
commented
Aug 25, 2020
Graph Theory
gatecse-2003
graph-theory
graph-matching
normal
+
–
10
answers
10
GATE CSE 2006 | Question: 54
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a_{i}+a_{i+1}+\dots+a_{j}=b_{i}+b_{i+1}+\dots+b_{j}$ ... time in the key comparison mode Takes $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a...
29.4k
views
commented
Jul 25, 2020
Algorithms
gatecse-2006
algorithms
normal
algorithm-design
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register