In round-robin CPU scheduling, as the time quantum increases

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

In round-robin CPU scheduling, as the time quantum increases, the average turn around time

Adecreases

Bincreases

Cremains almost same

Dvaries erratically

No answer description available for this question. Let us discuss.

View Answer

Discuss

A dirty bit points to a

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

A dirty bit points to a

Acorrupted page

Bwrong page in the memory

Cthe page that has never been accessed

Dthe page whose data is to be updated because of new computations

Akilesh Kharvi ? Dec 8 '2016 at 20:2

Answer: the page whose data is to be updated because of new computations

Explanation:

A dirty bit is a flag that indicates whether an attribute needs to be updated. Such situations usually occur when a bit in a memory cache or virtual memory page that has been changed by a processor but has not been updated in the storage. this dirty bit is point to the page whose data is to be updated because of new computations so answer is option (d ) the page whose data is to be updated because of new computations.

View Answer

Discuss

page replacement policies may lead to Belady's anomaly ?

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Which of the following page replacement policies may lead to Belady's anomaly ?

AFIFO

BLRU

CMRU

DReplacement of least active page

Akilesh Kharvi ? Dec 8 '2016 at 20:0

Answer: FIFO

Explanation:

Belady’s anomaly proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm.

Reference: https://en.wikipedia.org/wiki/B%C3%A9l%C3%A1dy%27s_anomaly

View Answer

Discuss

Resource allocation graphs are useful in

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Resource allocation graphs are useful in

Aresource management

Baccounting systems

Csystem auditing

Ddeadlock avoidance

Akilesh Kharvi ? Dec 8 '2016 at 19:42

Answer: deadlock avoidance

Explanation:

A relational database table is often described as “normalized” if it is in the Third Normal Form because most of the 3NF tables are free of insertion, update, and deletion anomalies. so answer is deadlock avoidance

View Answer

Discuss

At a particular time of computation, the value of a counting

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and 'x' V operations were completed on this semaphore. If the final value of the semaphore is 5, x will be

A13

B15

C18

D22

Nithin K ? Dec 7 '2016 at 22:24

Answer: 18

Explanation:

P means wait ie S:= S-1;
V means signal i.e S= S+1;

Each P operation will decrease the semaphore value by 1 and V operation increases by 1.
So,
7 -> 20p -> Xv = 5
=>7-20+X=5 
=> X = 18.

View Answer

Discuss