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 rituraj2847
6
answers
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.4k
views
commented
Mar 11, 2020
Algorithms
gatecse-2020
algorithms
graph-algorithms
2-marks
shortest-path
+
–
4
answers
2
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...
21.0k
views
commented
Jan 17, 2020
Theory of Computation
gatecse-2016-set1
theory-of-computation
regular-expression
normal
+
–
2
answers
3
GATE CSE 2012 | Question: 7
The decimal value $0.5$ in IEEE single precision floating point representation has fraction bits of $000\dots 000$ and exponent value of $0$ fraction bits of $000\dots 000$ and exponent value of $−1$ fraction bits of $100\dots 000$ and exponent value of $0$ no exact representation
The decimal value $0.5$ in IEEE single precision floating point representation hasfraction bits of $000\dots 000$ and exponent value of $0$fraction bits of $000\dots 000$...
11.6k
views
commented
Dec 25, 2019
Digital Logic
gatecse-2012
digital-logic
normal
number-representation
ieee-representation
+
–
4
answers
4
Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?
Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effec...
4.8k
views
commented
Nov 25, 2019
Operating System
operating-system
demand-paging
memory-management
multilevel-paging
+
–
3
answers
5
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.6k
views
answered
Nov 11, 2019
Computer Networks
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register