postheadericon Chapter 5, Concurrency: Mutual Exclusion and Synchronization

#
Question
Book Ref.
Marks
Year
1
Define multiprocessing.
5.1
1
Jan,2000
2
Define distributed processing.
5.1
1
Jan,2000
3
Define the mutual exclusion.
OR
Give the condition required for mutual exclusion.
5.1
1

2
Jan,2000

Jan,2004
4
List the two control problems created due to enforcement of mutual exclusion in concurrent process

1
Jan,2003
5
Why semaphored are used for mutual exclusion among an arbitrary number of processes? State the P and V operations on semaphores. Also enumerate the hardware support developed for mutual exclusion in various computer systems.
5.2
4
Jan,2000
6
Give the difference between strong and weak semaphores.                                
OR
Define strong and weak semaphore
OR
Explain the semaphores with the help of an example.
OR
List the difference between Strong and weak Semaphore

2

2

5

2
Jan,2004

Aug,2004

Jan,2005

Jan,2008
7
 What is semaphore? Give and explain the algorithm of producer consumer problem with bounded buffer using general semaphore.
OR
Explain bounded buffer Producer Consumer problem with algorithm

4


5
Jan,2000


Aug,2004
8
What is monitor? Give the implementation of the bounded Buffer Producer-Consumer problem using monitor.

5
Dec,2006
9
What is monitor? What are the requirements that need to be met by a system, which provides a support for mutual Exclusion?

4
Jan,2008
10
Give the advantages of using monitor.

1
Jan,2000
11
Describe reader’s writer problem. Implement it using semaphore.
OR
Define Readers Writers problem what are conditions generally associated with this problem? How can this problem be solved suing semaphores?
OR
Define Readers Writers Problem. Give its implementation using Semaphore. Here, readers have more priority than writer.

4

5


5

Jan,2000

Jan,2004


Dec,2006

12
Write and explain Producer Consumer problem with circular buffer.

4
Jan,2002
13
Discuss the Barbershop problem to use semaphores
OR
Discuss how barbershop problem is solves with the use of semaphores.
OR
Define the barbershop Problem. Explain The implementation of a fair Barbershop Problem using semaphore.

3

5

5
Jan,2003

Jan,2004

Jan,2008
14
Give the difference between competing process and cooperating process
OR
Difference Between competing and cooperative processes.

2

2
Jan,2004

Aug,2004
15
Write short notes on Message passing system.

2
Jan,2000
16
Explain Monitors for process synchronization

2
Jan,2000
17
Write short note on Bakery algorithm for mutual exclusion

3
Jan,2002
18
Define test and Set
Test-and-set instruction
Ø  Good for short time wait, not good for long time wait
Ø  Nor so good in single processor system
Ø  May reserve CPU, which is needed by the process holding the lock
Ø  Waiting is usually “busy wait” in a loop

1
Jan,2002
19
State whether the following statements are true or false.
The wait and signal operations must be non atomic.
False
1
Jan,2002

0 comments:

Follow by Email

Total Pageviews

© BipinRupadiya.com. Powered by Blogger.