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 tocshark
3
votes
1
GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....
34.2k
views
answered
Jan 25, 2017
Operating System
gatecse-2009
operating-system
resource-allocation
normal
+
–
0
votes
2
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
35.4k
views
answered
Jan 14, 2017
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
2
votes
3
GATE CSE 2014 Set 2 | Question: 52
The number of distinct minimum spanning trees for the weighted graph below is _____
The number of distinct minimum spanning trees for the weighted graph below is _____
13.6k
views
answered
Jan 13, 2017
Algorithms
gatecse-2014-set2
algorithms
spanning-tree
numerical-answers
normal
+
–
3
votes
4
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________.No...
49.9k
views
answered
Dec 17, 2016
DS
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
+
–
1
votes
5
GATE CSE 2014 Set 3 | Question: 55
Let $\oplus$ denote the exclusive OR (XOR) operation. Let '$1$' and '$0$' denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$ ... $F$ is $P+Q$ $\overline{P+Q}$ $P \oplus Q$ $\overline {P \oplus Q}$
Let $\oplus$ denote the exclusive OR (XOR) operation. Let '$1$' and '$0$' denote the binary constants. Consider the following Boolean expression for $F$ over two variable...
10.8k
views
answered
Oct 18, 2016
Digital Logic
gatecse-2014-set3
digital-logic
normal
boolean-algebra
+
–
–1
votes
6
GATE CSE 2014 Set 1 | Question: 53
Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE? $(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge \sim r)$ $( \sim (p \leftrightarrow q) \wedge r)\vee (p \wedge q \wedge \sim r)$ ... $(\sim (p \leftrightarrow q) \wedge r) \wedge (p \wedge q \wedge \sim r) $
Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE?$(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge...
13.7k
views
answered
Oct 10, 2016
Mathematical Logic
gatecse-2014-set1
mathematical-logic
normal
propositional-logic
+
–
4
votes
7
GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Simi...
34.8k
views
answered
Oct 1, 2016
DS
gatecse-2016-set1
data-structures
queue
difficult
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register