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 Divyanshum29
0
votes
1
the operating systems by galvin
What all chapters do I need to read from the operating systems by Galvin
What all chapters do I need to read from the operating systems by Galvin
1.4k
views
answered
Oct 16, 2018
3
votes
2
GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...
25.7k
views
answered
Oct 14, 2018
Computer Networks
gatecse-2012
computer-networks
communication
normal
+
–
0
votes
3
GATE CSE 2011 | Question: 30
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$ ... always true irrespective of the value of $x$ $P(x)$ being true means that $x$ has exactly two factors other than $1$ and $x$
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$, and a predicate$$P\left(x\right) = \neg \left(x=1\right)\wedge \forall y \left...
13.3k
views
answered
Oct 8, 2018
Mathematical Logic
gatecse-2011
mathematical-logic
normal
first-order-logic
+
–
1
votes
4
GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None
Each Process $P_i, i = 1\ldots 9$ is coded as followsrepeat P(mutex) {Critical section} V(mutex) foreverThe code for $P_{10}$ is identical except it uses V(mutex) in plac...
25.1k
views
answered
Oct 8, 2018
Operating System
gate1997
operating-system
process-synchronization
normal
+
–
1
votes
5
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
Consider the following functions$f(n) = 3n^{\sqrt{n}}$$g(n) = 2^{\sqrt{n}{\log_{2}n}}$$h(n) = n!$Which of the following is true?$h(n)$ is $O(f(n))$$h(n)$ is $O(g(n))$$g(n...
22.9k
views
answered
Oct 5, 2018
Algorithms
gatecse-2000
algorithms
asymptotic-notation
normal
+
–
0
votes
6
Introduction to algorithms by cormen
I am just starting with algorithms and as I have no source specifically aimed for gate prep so I am gonna go ahead with clrs(introduction to algorithms). Can someone list the topics which are relevant for GATE ? I am facing a ... linear time sorting algorithms like counting sort ,radix sort and the algorithms for median finding . Any help would be appreciated
I am just starting with algorithms and as I have no source specifically aimed for gate prep so I am gonna go ahead with clrs(introduction to algorithms). Can someone list...
867
views
answered
Jun 19, 2018
Algorithms
algorithms
reference-book
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register