1. "If a process is executing in its critical section, then no other process mustbe executing in their critical sections". This is called: a) Priority scheduling b) Murual exclusion c) Priority inversion d) Starvation 2. In the bounded buffer problem: a) the producer can always produce new items b) the producer must walt if the buffer is empty c) the consumer must wait if the buffer is empty d) the consumer must wait if the buffer is full Consider the following graph to answer the questions? 3. The logical address of k is equal? 2) Page mo =2 offser no-2, b) Page no =2, affset no =3 c) Page no-1.offser no =2 d) Page no 1 , offse no, =3 4. The physical address of k is equal? a) Frame no =2, offsel no. =2 b) Frame no 2 , after m0=3 c) Frame no-1,olfer no =2 d) Frame ao-1, alfset na.-3 5. Peterson's Solution: Assame that the LOAD and STORE instructions are atomic; this means a) Caibe iateriopred b) Camot be impernpited c) Sometimes internupted d) Can be signaled 6. Use of semaphores is a mechanism for: a) Synchronization b) Preventing deadlocks c) Sequencing queues d) Pre-emptive termination 7. In the Bounded-Buffer Problem Semaphore mutex initialized to the value a) N b) N-1 c) 0 d) 1 8. A Web server services each request in a a) one thread b) separate thread c) concurrent thread d) None 9. If resources are always pre-empted from the same process, a) Deadlock b) System crash c) Ageing d) Starvation 10. The relationship between a process thread and the program counter is: a) One-to-many b) Many-to-one c) One-to-one d) Many-to-many 11. The page table contains: a) base address of each page in physical memory b) page offset of each page in memory c) page size of each page in physical memory d) block table of pages in memory