Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Aaru_2023
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Aaru_2023
2
answers
1
Applied Mock Test 2
In TCP, MSS is 8B. If during the 6th RTT the network is congested and timeout occurs, by using the congestion algorithm, then the threshold value is _________(in Bytes). (assume initial congestion window size for the first transmission is 1 MSS)
In TCP, MSS is 8B. If during the 6th RTT the network is congested and timeout occurs, by using the congestion algorithm, then the threshold value is _________(in Bytes). ...
1.5k
views
commented
Jan 15, 2023
Computer Networks
test-series
computer-networks
congestion-control
transport-layer
+
–
1
answer
2
Min number of register needed for this program without spilling ?
Min number of register needed for this program without spilling ?
679
views
commented
Jan 4, 2023
Compiler Design
compiler-design
register-allocation
zeal
+
–
0
answers
3
graph theory
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
427
views
commented
Jan 3, 2023
Graph Theory
zeal
graph-theory
discrete-mathematics
graph-coloring
numerical-answers
+
–
1
answer
4
TIFR CSE 2021 | Part B | Question: 13
Let $A$ be a $3 \times 6$ matrix with real-valued entries. Matrix $A$ has rank $3$. We construct a graph with $6$ vertices where each vertex represents distinct column in $A$, and there is an edge between two vertices if the two columns represented ... is connected. There is a clique of size $3$. The graph has a cycle of length $4$. The graph is $3$-colourable.
Let $A$ be a $3 \times 6$ matrix with real-valued entries. Matrix $A$ has rank $3$. We construct a graph with $6$ vertices where each vertex represents distinct column in...
571
views
commented
Dec 29, 2022
Graph Theory
tifr2021
graph-theory
graph-coloring
matrix
+
–
6
answers
5
GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion
Two processes $X$ and $Y$ need to access a critical section. Consider the following synchronization construct used by both the processes$$\begin{array}{|l|l|}\hline \text...
20.4k
views
commented
Nov 30, 2022
Operating System
gatecse-2015-set3
operating-system
process-synchronization
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register