OS Midterm

1.       Solaris- Operating Systems implements the combined approach

2.       Race Condition – it is a situation where multiple threads read and write a shared data item.

3.       Unblocked – This Operation moves blocked thread into the ready queue for the continuation of its execution.

4.       Hold and wait – The condition is prevented by requiring a process to request all its required sources simultaneously

5.       Responsive – Multithreading allows a program to continue running even if some part of its blocked or performing a lengthy operation. This benefit is known as

6.       Resource allocation graph – it is useful tool in characterizing the allocation of resources to processes.

7.       Condition Variable - It is used to block a process or a thread until a specific condition is true

8.       Multithreading –This is the ability of an OS to support concurrent paths of execution within a single process.

9.       Binary – this semaphore only takes the value of zero and one

10.   Base Priority – It is the lower limit of the threads dynamic priority

11.   Distributed Processing – It is the management of multiple processes executing on multiple distributed computer system.

12.   Multicore System – These affect the application design and performance when application with multiple threads are provided

13.   Alert Status – It indicates whether a waiting thread may execute an asynchronous procedure call.

14.   Combined Approach – This approach runs multiple threads within the same application in parallel on multiple processors

15.   Monitor – this programming construct encapsulates variables and initialization code within an abstract sate type.

16.   All Process Threads share the same address space and resources – not true about process and threads arrangement

17.   Processes may exit while holding resources – not a restriction in implementing the deadlock avoidance strategy

18.   The ability to communicate with each other by process identification – not an operating system concern caused by existence of concurrency

19.   It involves conflicting needs for resources by two or more processes –not true about concurrency

20.   The separated core OS software from the application-oriented software – not true about multithreading

21.   Aborting deadlocked processes until deadlock no longer exist – not a recovery method in deadlocked detection

22.   It only takes the values of zero and one – not true about counting semaphore

23.   Schedule thread whenever a process is blocked – not a benefit of multithreaded programming.

24.   A resources is not preempted – condition must be present for a deadlock to occur

25.   They encompass the ability to load and execute multiple runnable program – not true about deadlock

26.   It executes an infinite loop – not true about the monitor mechanism

27.   Kernel maintains the context information for the process – not true about combined approach

28.   Thread management code is not needed on the application level – not an advantage of user-level threads

29.   An application that only processes binary data – not multithreaded application

30.   A web browser that display images or text – not attributed to threads