Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
minal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by minal
7
votes
81
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...
37.6k
views
answered
Jun 16, 2015
Operating System
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
+
–
2
votes
82
The process of assigning similar objects/entities to object/entity type known as
The process of assigning similar objects/entities to object/entity type known as a)Classification b)Instantiation c)Specialization d)Generalization
The process of assigning similar objects/entities to object/entity type known asa)Classification b)Instantiationc)Specializationd)Generalization
765
views
answered
Jun 4, 2015
10
votes
83
GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X...
29.7k
views
answered
Jun 1, 2015
Operating System
gatecse-2012
operating-system
process-synchronization
normal
+
–
1
votes
84
Scheduling Algorithm
746
views
answered
May 28, 2015
0
votes
85
Turnaround time
5 batch jobs A through E arrive at a computer center at almost same time. They have estimated running times of A:10, B:6, C:2, D:4 and E:8 minutes. Their priorities are A:3,B:5,C:2,D:1 and E:8 min. Their(externally determined) priorities are A:3,B: ... the mean process turnaround time under R-R scheduling algorithm(assuming time slice of 1 min)? a) 22 min b) 21 min c) 18 min d) none
5 batch jobs A through E arrive at a computer center at almost same time. They have estimated running times of A:10, B:6, C:2, D:4 and E:8 minutes. Their priorities are A...
909
views
answered
May 28, 2015
0
votes
86
networking
What setting of THT (token holding time) will be optimal for a network that had only one station active at a time? Response: 10 ms Depends on the size of the ring Infinity Can't say
What setting of THT (token holding time) will be optimal for a network that had only one station active at a time?Response: 10 ms Depends on the size of the ring Infinity...
412
views
answered
May 27, 2015
1
votes
87
network general
Which type of ACK is used in 802.5? Response: Cumulative ACK Independent ACK Piggybacking ACK None of these
Which type of ACK is used in 802.5?Response: Cumulative ACK Independent ACK Piggybacking ACK None of these
679
views
answered
May 27, 2015
1
votes
88
PROBLEM ON VIEW SERIALIZABILITY
check whether it is view serializable or not? schedule S:R1(X),W2(X),W1(X)
check whether it is view serializable or not?schedule S:R1(X),W2(X),W1(X)
5.5k
views
answered
May 20, 2015
Databases
view-serializable
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register