Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
tiger
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by tiger
1
votes
1
counting semaphore related question
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too? Please justify your answers.
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too?Please justify your answers.
1.5k
views
answered
Sep 17, 2016
Operating System
semaphore
process-synchronization
operating-system
+
–
1
votes
2
Can anyone explain the below question in a detailed way?
A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is the present(final) value of the binary semaphore mutex?
A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is t...
3.4k
views
answered
Sep 17, 2016
Operating System
semaphore
+
–
0
votes
3
Synchronization of two processes using Binary Semaphore_2n_EDITION_HARRIS
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S, T and U: Process P: Process Q: P(S) W: P(T) X: P(U) Y: Print ‘a’ Print ‘a’; Print ‘b’ Print &lsquo ... above problem? (a) P(S), P(T) (b) P(T), P(U) (c) P(S), P(U) (d) None
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S, T and U:Process P: Process Q:P(S) ...
1.7k
views
answered
Sep 17, 2016
Operating System
operating-system
process-synchronization
semaphore
mutex
+
–
2
votes
4
GATE CSE 2016 Set 2 | Question: 49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)...
15.6k
views
answered
Sep 17, 2016
Operating System
gatecse-2016-set2
operating-system
semaphore
normal
numerical-answers
+
–
1
votes
5
How many process are created by the program?
int main(){ int i; for(i=0;i<4;i++) fork(); return 0; } in my calculation i think 14 processes will be created including the the parent process. am i right ? Is there any easier method to solve this kind of question ?? please provide the right approach to solve these kind of problems
int main(){ int i; for(i=0;i<4;i++) fork(); return 0; }in my calculation i think 14 processes will be created including the the parent process. am i right ? Is there any ...
4.5k
views
answered
Sep 16, 2016
Operating System
operating-system
fork-system-call
+
–
0
votes
6
Fork
What is the output and how many child(what is the code of all other child .what they copied from parent give tree diagram) t1=0;t2=0; Fork(); Printf("hi"); t1=Fork(); Printf("hi"); t2=fork(); printf("hi); fork(); printf("hi);
What is the output and how many child(what is the code of all other child .what they copied from parent give tree diagram)t1=0;t2=0;Fork();Printf("hi");t1=Fork();Printf("...
881
views
answered
Sep 16, 2016
Operating System
fork-system-call
+
–
1
votes
7
Fork
what if the program like this(t1 is copied to all or printf will copied to all child) main() { t1=0,t2=0; t2=fork(); Fork(); Printf("Hi"); Fork(); t1=Fork(); Printf("hi"); } Arjun sir , I don't know the buffer concept.please explain with tree method. How many child and how many time Hi printed.
what if the program like this(t1 is copied to all or printf will copied to all child)main(){t1=0,t2=0;t2=fork();Fork();Printf("Hi");Fork();t1=Fork();Printf("hi");}Arjun s...
1.3k
views
answered
Sep 16, 2016
Operating System
fork-system-call
+
–
0
votes
8
Fork query what will be the effect of t3= -1 here?
694
views
answered
Sep 16, 2016
Operating System
fork-system-call
operating-system
+
–
4
votes
9
General Topic Doubt Operating System: Fork
How is the answer coming out to be 32?
How is the answer coming out to be 32?
960
views
answered
Sep 16, 2016
Operating System
fork-system-call
system-call
operating-system
general-topic-doubt
+
–
5
votes
10
GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...
37.1k
views
answered
Sep 15, 2016
Operating System
gatecse-2013
operating-system
virtual-memory
normal
+
–
1
votes
11
GATE CSE 2014 Set 1 | Question: 31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ and $P2.$ The table given below presents the current system state. ... be permitted. Only REQ2 can be permitted. Both REQ1 and REQ2 can be permitted. Neither REQ1 nor REQ2 can be permitted.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ a...
22.0k
views
answered
Sep 14, 2016
Operating System
gatecse-2014-set1
operating-system
resource-allocation
normal
+
–
0
votes
12
pipeline cycles
422
views
answered
Jan 11, 2016
0
votes
13
Two languages reducible to each other in polynomial time. Which is false option for them?
If Language L1 is reducible to L2 and L2 reducible to L1, then shouldn't they both be Recursively Enumerable Languages? I am really confused with the option given. Source : testbook.com live test on 3rd January, 2016
If Language L1 is reducible to L2 and L2 reducible to L1, then shouldn't they both be Recursively Enumerable Languages? I am really confused with the option given.Source ...
676
views
answered
Jan 4, 2016
Theory of Computation
recursive-and-recursively-enumerable-languages
normal
compound-automata
+
–
2
votes
14
CN: TCP Congestion Control
A TCP machine is sending windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line efficiency? Answer: One window can be sent every 20 msec. This gives 50 windows/sec, ... question they have given 10 msec one-way delay. Why they have taken RTT? why we can't use one-way delay itself ?
A TCP machine is sending windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line eff...
11.4k
views
answered
Jan 4, 2016
Computer Networks
computer-networks
congestion-control
+
–
0
votes
15
Identify the language accepted by the following NFA with $\in$-moves.
Identify the language accepted by the following NFA with $\in$-moves. All strings over a's and b's All strings which do not contain aa All strings which do not contain bb None of these ----- ... words instead of precise notation , makes this question confusing. Please answer this question, what should be correct answer.
Identify the language accepted by the following NFA with $\in$-moves.All strings over a's and b'sAll strings which do not contain aaAll strings which do not contain bbNon...
1.2k
views
answered
Dec 1, 2015
Theory of Computation
theory-of-computation
regular-language
+
–
11
votes
16
What is the time complexity of job sequencing with deadline using greedy algorithm?
What is the time complexity of job sequencing with deadline using greedy algorithm? O(n) O(log n) O(n log n) O(n2) Made Easy Full Syllabus Test-6 : Basic Level : Practice Test-14 Q 19 Please give reference for this answer to this algorithm.
What is the time complexity of job sequencing with deadline using greedy algorithm?O(n)O(log n)O(n log n)O(n2)Made EasyFull Syllabus Test-6 : Basic Level : Practice Test-...
23.4k
views
answered
Dec 1, 2015
Algorithms
greedy-algorithm
activity-selection
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register