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
Answers by rituraj2847
32
votes
1
GATE CSE 2020 | Question: 40
Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in E$, define ${w}'(u,v)$ as $w(u,v)+f(u)-f(v)$. Which one of the ... from $s$ to $u$ in the graph obtained by adding a new vertex $s$ to $G$ and edges of zero weight from $s$ to every vertex of $G$
Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in ...
18.1k
views
answered
Feb 12, 2020
Algorithms
gatecse-2020
algorithms
graph-algorithms
2-marks
+
–
0
votes
2
If m number of bits are used for representing a sequence number in selective-repeat ARQ
If m number of bits are used for representing a sequence number in selective-repeat ARQ,then the maximum size of sliding window is 2m-1 .Justify this statement using a boundary case example.What will happen if the size of sliding window exceeds 2m-1 ?
If m number of bits are used for representing a sequence number in selective-repeat ARQ,then the maximum size of sliding window is 2m-1 .Justify this statement using a bo...
8.5k
views
answered
Nov 11, 2019
Computer Networks
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register