1 answer
2
Comparison of Scheduling Algorithms(FCFS, SJF, SJRF, Round Robin, Priority)Comparison points are1. Average TAT2. Average WT3. Average RT4. CPU utilization5. throughput
0 answers
3
Facts about SJF Algorithm:Maximum ThroughputMinimum Average TATMaximum Response TimeMaximum CPU Utilization
1 answer
4
What are the attributes of process control block ?
2 answers
5
Process control block does not containProcess IDUser identification numberRegistersNone of the above
3 answers
6
What is Byte Addressable and Word Addressable means in computer Architecture ? Difference between them with examples?I also find some sources like stack overflow and wik...
4 answers
8
If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is _____________ ?1. 02. 13. 24. 4
3 answers
9
Interprocess communication with message passing, the shared memory is in1. Userspace2. Kernel space3. Virtual memory4. None of these
3 answers
10
State True/ False Message passing is slow compared to shared memory and more error-prone.1. True2. False
3 answers
11
State True/False Bakery algorithm ensures that no process is starved.1. True2. False
1 answer
13
By using Intel hardware xchg instruction ensures thatThe critical section is deadlock freeSolution is starvation freeProcess enters CS in FIFO orderMore than one process ...
1 answer
14
Return value of xchg instruction is_____________1. Old value2. New value3 . 1 if operation succeeds and 0 if operation fails4. None of the above
1 answer
15
Consider the following statements:i) if(count==0)ii) add %eax,%ebx1. i is atomic, ii is non-atomic2. i is non-atomic, ii is non-atomic3. i is non-atomic, ii is atomic4...
0 answers
19
Which of the following can be described as a programming model used to develop applications processing massive amounts of data in a distributed and/or parallel manner?1. ...
0 answers
20
Consider the following databaseCol 1Col 2Col 3123456789If Col1 and Col2 form a column family and Col3 is another column family, how is the data stored?A. 1 2 3 4 5 6 7 8 ...
0 answers
22
Consider the following schedule $S$. S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A); Which of the following is a valid set of transactions tha...
0 answers
23
0 answers
24
A process executes following segment of code:for(i = 1; i <= n; n++)fork();The number of new process created is 1. n2. ((n(n+1))/2)3. (2^n)-14. (3^n)-1
1 answer
26
If 5 relations are put through the zig-zag configuration of join tree and the order of join does not matter, how many different join trees are possible?1. 960 2. 840 3. 1...
1 answer
27
A system where commutativity is considered different, in how many ways the join of n relations r1,r2,…, rn can be taken?1. (2n−2)!/(n−1)! 2. (2n−2)!/n!(n−1)! 3...
0 answers
28
2 answers
29
Which of the following is not a cause of transaction failure?1. System Crash2. Deadlock3. Exception4. All of the above are causes of transaction failures