Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
SaurabhKatkar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by SaurabhKatkar
0
votes
1
synchronization
the following five concurrent processes operating on counting semaphore variable (s) which is initialized to 0 P1: wait (s); cs; signal (s); P2: wait (s); cs; signal (s); P3: wait (s); cs; signal (s); P4: signal s); cs; wait (s); P5: signal (s); cs; wait (s); what is the maximum possible value of s? A) 1 B) 2 C) 3 D) 0
the following five concurrent processes operating on counting semaphore variable (s) which is initialized to 0P1: wait (s); cs; signal (s);P2: wait (s); cs; signal (s);P3...
1.6k
views
answered
Dec 21, 2019
Operating System
semaphore
process-synchronization
operating-system
+
–
3
votes
2
Process Synchronisation Of Operating System
Consider the below Algorithm where flag and lock are global variables: P0: P1: while (flag= =1 && lock= = 0); while (flag= = 0 && lock= = 1); Enter CS Enter CS lock= 0 flag= 0 flag= 1 lock= 1 (a) The above algorithm is deadlock free (b) The above algorithm guarantees Mutual Exclusion (c) Both (a) & (b) (d) None of the above
Consider the below Algorithm where flag and lock are global variables:P0: P1:while (fla...
1.4k
views
answered
Dec 21, 2019
Operating System
operating-system
process-scheduling
process-synchronization
semaphore
+
–
0
votes
3
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.6k
views
answered
Dec 18, 2019
Databases
er-diagram
databases
er-to-relational
relational
+
–
0
votes
4
Morris Mano Edition 3 Exercise 5 Question 6 (Page No. 198)
Assume that the EXCLUSIVE-OR gate has a propagation delay of 20ns and that the AND and OR gates have a Propagation delay of 10ns. What is the total Propagation delay time in the four-bit adder of the figure given below?
Assume that the EXCLUSIVE-OR gate has a propagation delay of 20ns and that the AND and OR gates have a Propagation delay of 10ns. What is the total Propagation delay time...
5.3k
views
answered
Nov 28, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
+
–
0
votes
5
madeeasy
Which of the following is true? A. TCP uses only cumulative acknowledgment. B. In TCP to identify the network capacity congestion window size always start with 1 MSS C. Keep alive timer is used when receiver send ack with window size 0. D. both a and c Please explain Ans is given B
Which of the following is true?A. TCP uses only cumulative acknowledgment.B. In TCP to identify the network capacity congestion window size always start with 1 MSSC. Keep...
436
views
answered
Nov 19, 2019
0
votes
6
made easy test series
please provide a detailed solution
please provide a detailed solution
566
views
answered
Nov 18, 2019
CO and Architecture
co-and-architecture
cache-memory
+
–
1
votes
7
MadeEasy Test Series: Algorithms - Sorting
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of set of 3 elements [First element, middle element, and last element]. What will be worst case time complexity of modified quick sort? a.O($n^{2}$) b.O(nlogn) c.O($n^{2}$logn) d.O(nloglogn)
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of se...
1.5k
views
answered
Nov 14, 2019
Algorithms
algorithms
sorting
quick-sort
made-easy-test-series
+
–
2
votes
8
MadeEasy Full Length Test 2019: Combinatory - Permutations And Combinations
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
1.4k
views
answered
Nov 11, 2019
Combinatory
discrete-mathematics
combinatory
made-easy-test-series
+
–
5
votes
9
T(n) = sqrt(n) * T(sqrt(n)) + n
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n). 'wolframalpha'' shows the answer same as mine. You can find the solution here. Can anyone confirm the solution and provide an explantion?
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n).'wolframalpha'' shows the answer same as mine. You can find the solution...
11.4k
views
answered
Nov 10, 2019
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
0
votes
10
Rosen chapter 5.5 question 50
How many ways are there to distribute 5 distinguishable objects into three indistinguishable boxes?
How many ways are there to distribute 5 distinguishable objects into three indistinguishable boxes?
1.8k
views
answered
Nov 9, 2019
1
votes
11
MadeEay Test Series 2018: Databases - Relational Algebra
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
401
views
answered
Oct 21, 2019
Databases
databases
relational-algebra
made-easy-test-series
madeeasy-testseries-2018
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register