Register
Filter

Recent activity by aaaakash001

5 answers
1
GATE CSE 2023 | Question: 17
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation? First-in First-Out Round Robin Priority Scheduling Shortest Job First
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation?First-in First-OutRound RobinPriority SchedulingShortest Job First
4 answers
4
GATE CSE 2023 | Question: 55
The forwarding table of a router is shown below. ... to a destination address $200.150 .68 .118$ arrives at the router. It will be forwarded to the interface with $\text{ID}$ __________.
The forwarding table of a router is shown below.$$\begin{array}{|l|l|c|}\hline \textbf{Subnet Number} & \textbf{Subnet Mask} & \textbf{Interface ID} \\\hline 200.150 .0 ....
2 answers
6
Floating point representation
What is the 16 bits pattern which represent (-13.5) in normalized signed magnitude fraction . S = 1 bit , Exponent = 7 bits , Mantissa = 8 bits . Represent it in hexadecimal also.
What is the 16 bits pattern which represent (-13.5) in normalized signed magnitude fraction . S = 1 bit , Exponent = 7 bits , Mantissa = 8 bits . Represent it in hexadeci...
3 answers
11
NIELIT Scientific Assistant A 2020 November: 52
In case of the dynamic programming approach the value of an optimal solution is computed in : Top down fashion Bottom up fashion Left to Right fashion Right to Left fashion
In case of the dynamic programming approach the value of an optimal solution is computed in :Top down fashionBottom up fashionLeft to Right fashionRight to Left fashion
2 answers
19
Transaction
1 answer
20
KORTH
T1 T2 T3 W(X) R(X) W(Y) W(X) R(Y) W(X) W(X) W(Y) W(X) W(Y) R(X) W(X) R(Y) W(Y) Number of blind write in given schedule
T1T2T3W(X) R(X) W(Y) W(X) R(Y) W(X) W(X) W(Y) W(X) W(Y) R(X) W(X) R(Y) W(Y) Number of blind write in given schedule
1 answer
21
2 Phase Locking
Consider the following schedule: S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3 Please explain how it is allowed in 2 PL
Consider the following schedule:S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3Please explain how it is allowed in 2 PL
1 answer
22
concurrent schedule
how to find total number of concurrent schedule possible when any schedule is given ? for example consider this schedule T1 : R1(A) , W1(A) , R1(B) , W1(B) ; T2 : R2(A) , W2(A) , R2(B) , W2(B) ;
how to find total number of concurrent schedule possible when any schedule is given ?for example consider this scheduleT1 : R1(A) , W1(A) , R1(B) , W1(B) ;T2 : R2(A) , W2...
4 answers
23
No. of View equivalent schedules
how many view equivalent schedules are possible for the Sch given below:
how many view equivalent schedules are possible for the Sch given below:
4 answers
25
self doubt
every strict recoverable schedule is conflict serializable..if not then why?
every strict recoverable schedule is conflict serializable..if not then why?
2 answers
26
DBMS - Transactions and concurrency control
I had a doubt. In the case of lost update problem (special case of write – write problem, where a transaction commits to a blind write and the other transaction rollsback without commiting) , is the schedule recoverable or not??
I had a doubt.In the case of lost update problem (special case of write – write problem, where a transaction commits to a blind write and the other transaction rollsbac...
2 answers
27
Is a Serial Schedule always Recoverable?
Is only conflict serializable schedules are recoverable? Or both view as well as conflict serializable schedules are recoverable? I have been seeing different answers in different forum.
Is only conflict serializable schedules are recoverable?Or both view as well as conflict serializable schedules are recoverable?I have been seeing different answers in di...
2 answers
28
Computer Networks
I am slightly confused in 40 Gbps. When to use 2^30 and when to use 10^3 in conversion.
I am slightly confused in 40 Gbps. When to use 2^30 and when to use 10^3 in conversion.
2 answers
30
coaching