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 keep11kd
0
votes
1
GATE CSE 2011 | Question: 12
Consider a relational table with a single record for each registered student with the following attributes: $\text {Registration_Num:}$ Unique registration number for each registered student $\text {UID:}$ ... that $S \cap \text{UID}$ is $\text{NULL}$ then $S \cup \text{UID}$ is also a superkey
Consider a relational table with a single record for each registered student with the following attributes:$\text {Registration_Num:}$ Unique registration number for each...
17.0k
views
answered
Dec 11, 2022
Databases
gatecse-2011
databases
normal
candidate-key
+
–
0
votes
2
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data...
26.7k
views
answered
Dec 9, 2022
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
0
votes
3
GATE CSE 2021 Set 1 | Question: 46
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in line $\#1$. Assume that the increment operation in line $\#7$ ... is $0$ after all the threads successfully complete the execution of $\textsf{parop}$ There is a deadlock involving all the threads
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in li...
14.0k
views
answered
Dec 4, 2022
Operating System
gatecse-2021-set1
multiple-selects
operating-system
process-synchronization
semaphore
2-marks
+
–
0
votes
4
GATE CSE 2005 | Question: 71
Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process $P_i$ is $s_i$, where $s_i > 0$. Which one of the following is a sufficient condition for ensuring that deadlock ... $\displaystyle{\sum_{i=1}^n} \: s_i < (m \times n)$
Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process ...
17.0k
views
answered
Dec 4, 2022
Operating System
gatecse-2005
operating-system
resource-allocation
normal
+
–
0
votes
5
GATE CSE 2005 | Question: 71
Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process $P_i$ is $s_i$, where $s_i > 0$. Which one of the following is a sufficient condition for ensuring that deadlock ... $\displaystyle{\sum_{i=1}^n} \: s_i < (m \times n)$
Suppose $n$ processes, $P_1, \dots P_n$ share $m$ identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process ...
17.0k
views
answered
Dec 4, 2022
Operating System
gatecse-2005
operating-system
resource-allocation
normal
+
–
0
votes
6
GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false
Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...
24.7k
views
answered
Nov 28, 2022
Operating System
gateit-2005
operating-system
process-synchronization
normal
+
–
0
votes
7
GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore ini...
13.7k
views
answered
Nov 28, 2022
Operating System
gateit-2006
operating-system
process-synchronization
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register