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 target2017
9
votes
31
Which of the following algorithm leads convoy effect?
Which of the following algorithm leads convoy effect? FCFS SJF Priority scheduling All of the above
Which of the following algorithm leads convoy effect?FCFS SJF Priority scheduling All of the above
10.4k
views
answered
Dec 9, 2016
Operating System
operating-system
+
–
1
votes
32
find the cpu utilisation
Consider 4 processes P 0 , P 1 , P 2 and P 3 . Each process performs a single computation that requires CPU for T B milliseconds and then initiates a single I/O operation that lasts for T I/O ms.Operating System of the ... is negligible. The processes have following characteristics: Using Round Robin scheduling algorithm with Time quantum 25 ms. Find the % CPU utilization
Consider 4 processes P 0 , P 1 , P 2 and P 3 . Each process performs a single computation thatrequires CPU for T B milliseconds and then initiates a single I/O operation ...
675
views
answered
Dec 7, 2016
Operating System
operating-system
+
–
1
votes
33
complement of prefix
376
views
answered
Dec 7, 2016
0
votes
34
Made easy
Doubt: Please clarify how option b is wrong.
Doubt: Please clarify how option b is wrong.
246
views
answered
Dec 6, 2016
0
votes
35
Turing machine
239
views
answered
Dec 6, 2016
1
votes
36
#toc#decidability
Someone explain... L1 ={a^p / p is prime} L2 ={a^p / p is odd} S1 : L1 ∪ L2 is regular S2 : Regular expression of L1 ∪ L2 is a(aa)* A) S1 is decidable(correct) S2 is undecidable(not correct) B) S1,S2 is decidable C) S1 , S2 is undecidable D) None
Someone explain...L1 ={a^p / p is prime}L2 ={a^p / p is odd}S1 : L1 ∪ L2 is regularS2 : Regular expression of L1 ∪ L2 is a(aa)*A) S1 is decidable(correct)S2 is undeci...
364
views
answered
Dec 6, 2016
2
votes
37
SJF Next burst prediction
Please help me in understanding the followign formulae? Prediction of the Length of the Next CPU Burst Pn+1 = a tn +(1-a)Pn This formula defines an exponential average Pn stores the past history tn contents are most recent information the parameter a ... a = 1 then Pn +1 = tn Prediction is last cpu burst I dont want to learn this.Please provide some logical explanation
Please help me in understanding the followign formulae?Prediction of the Length of the Next CPU Burst Pn+1 = a tn +(1-a)Pn This formula defines a...
1.2k
views
answered
Dec 6, 2016
Operating System
sjf
process-scheduling
+
–
0
votes
38
find the number of safe sequences
Consider the following system Find the total number of safe sequences?
Consider the following systemFind the total number of safe sequences?
1.0k
views
answered
Dec 5, 2016
Operating System
operating-system
+
–
2
votes
39
Consider the following variation in Peterson’s solution for 2 processes.
Consider the following variation in Peterson's solution for 2 processes. shared char want[2] = {0,0}; shared int turn = 0; 1. P_i() 2. { while (1) { 3. turn = |1-i|; 4. want[i] = 1; 5. ... is achieved Both i and ii Only i Only ii None for ME,I got the solution but couldn't understand about progress.Please explain.
Consider the following variation in Peterson’s solution for 2 processes.shared char want = {0,0}; shared int turn = 0; 1. P_i() 2. { while (1) { 3. turn = |1-i|; 4. wa...
881
views
answered
Dec 5, 2016
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
40
Suppose that the head of a moving head disk with 200 tracks numbered 0 to 199
Suppose that the head of a moving head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 65.disk queue requests are as follows,93,173,132,20,35,150,100,175.What is the total number of head movements ... the right side. for left side,does it go till 20 at the end or first 20 and at last 35..??
Suppose that the head of a moving head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 65.disk queue requests are as follows,93,173,132,20,...
5.2k
views
answered
Dec 5, 2016
Operating System
operating-system
+
–
0
votes
41
Logical and airthmatic left shift.
I just read that the logical and airthmatical left shift are same while there is a difference in case of right shift. https://en.wikipedia.org/wiki/Bitwise_operation (under Logical shift) Can understand how are they same. Like What is arithmetic left ... other hand, the logical left shift by 1 pos would be 10010010 but both are not same. any example on that.
I just read that the logical and airthmatical left shift are same while there is a difference in case of right shift.https://en.wikipedia.org/wiki/Bitwise_operation (unde...
1.6k
views
answered
Dec 5, 2016
Digital Logic
co-and-architecture
digital-logic
bitwise
+
–
1
votes
42
Made easy
L = { wxyw | x, y, w Ē (a+b)+ }. Is it regular or not? The solution says it is non-regular. Is the following regex wrong for L? -> a(a+b)+a + b(a+b)+b.
L = { wxyw | x, y, w Ē (a+b)+ }. Is it regular or not?The solution says it is non-regular. Is the following regex wrong for L? - a(a+b)+a + b(a+b)+b.
258
views
answered
Dec 5, 2016
0
votes
43
ace test
194
views
answered
Dec 5, 2016
0
votes
44
Predict Mutual exclusion and progress of given code
Consider the methods used by processes PI and P2 for accessing their critical sections. The initial values of shared Boolean variables S, and S2 are randomly assigned, P1 while (SI = = S2); critical section S1= S2; P2 while ... (B) Progress but not mutual exclusion (C) Neither mutual exclusion nor progress (D) Both mutual exclusion and progress
Consider the methods used by processes PI and P2 for accessing their critical sections.The initial values of shared Boolean variables S, and S2 are randomly assigned,P1wh...
586
views
answered
Dec 5, 2016
Operating System
deadlock-prevention-avoidance-detection
operating-system
+
–
1
votes
45
ace test TOC-I
397
views
answered
Dec 5, 2016
16
votes
46
Multilevel Paging
A computer has a 32 bit virtual address space and 1024 Bytes pages.A page table entry is 4 bytes.A multilevel page table is used because each page must fit in a page.How many levels are required ?Also tell how many bits are required to index page table at each level?
A computer has a 32 bit virtual address space and 1024 Bytes pages.A page table entry is 4 bytes.A multilevel page table is used because each page must fit in a page.How ...
6.7k
views
answered
Dec 5, 2016
Operating System
multilevel-paging
+
–
3
votes
47
Made Easy test
which of the below are CFL: a. L1 ={a^i b^j c^k |( i<=j or j<=i), j=k} b.L2 = {a^m b^nc^n d^m | m is not equals to n} whether CFL or DCFL....please explain
which of the below are CFL:a. L1 ={a^i b^j c^k |( i<=j or j<=i), j=k}b.L2 = {a^m b^nc^n d^m | m is not equals to n}whether CFL or DCFL....please explain
502
views
answered
Dec 5, 2016
1
votes
48
how is deadlock and starvation possible in test and set lock solution of M.E??
how is deadlock and starvation possible in test and set lock solution of M.E??
how is deadlock and starvation possible in test and set lock solution of M.E??
1.6k
views
answered
Dec 4, 2016
Operating System
deadlock-prevention-avoidance-detection
operating-system
+
–
3
votes
49
TOC minimal DFA
1.3k
views
answered
Dec 4, 2016
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
0
votes
50
TOC how many strings
373
views
answered
Dec 4, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
5
votes
51
CFL or not
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer given is CFL , am I missing something ?
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer g...
605
views
answered
Dec 4, 2016
Theory of Computation
theory-of-computation
context-free-language
finite-automata
dcfl
+
–
0
votes
52
counting
Let A,B are 4 digited numbers, how many possible cases are there to have B≥A?
Let A,B are 4 digited numbers, how many possible cases are there to have B≥A?
403
views
answered
Dec 4, 2016
0
votes
53
Aptitude
The minute hand of a clock overtakes the hour hand at intervals of 65 minutes of the correct time. How much time in a day does the clock gain or lose ? 440/43 minutes 450/65 minutes 5/11 minutes 65/11 minutes
The minute hand of a clock overtakes the hour hand at intervals of 65 minutes of the correct time. How much time in a day does the clock gain or lose ?440/43 minutes450/6...
621
views
answered
Dec 3, 2016
1
votes
54
MADE EASY TEST SERIES
Consider the following code : In the above code turn [ ] is a global Boolean array and wakeup ( ) call is used to unblock one of the blocked processes. Assume that above code is executed by any process Pi for 1 ≤ i ≤ 5. Which ... the above code ? Mutual exclusion and deadlock No mutual exclusion and deadlock Mutual exclusion and no deadlock No mutual exclusion but no deadlock
Consider the following code :In the above code turn [ ] is a global Boolean array and wakeup ( ) call is used to unblock one of the blocked processes. Assume that above c...
705
views
answered
Dec 3, 2016
2
votes
55
CFL or not TOC
Is L={$a^{n}b^{n}c^{m}$ : n>m} context free...???
Is L={$a^{n}b^{n}c^{m}$ : n>m} context free...???
713
views
answered
Dec 3, 2016
Theory of Computation
theory-of-computation
normal
context-free-language
+
–
0
votes
56
past gate question
A number is represented as m in base 10,p in base 2, q in base 3 p - q = 990 where subtraction is performed in base 10 then (a) m>=14 (b) 9<=m<=13 (c) 6<=m<=8 (d) m<6
A number is represented as m in base 10,p in base 2, q in base 3p - q = 990 where subtraction is performed in base 10then (a) m>=14(b) 9<=m<=13(c) 6<=m<=8(d) m<6
414
views
answered
Dec 2, 2016
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register