A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

• A. Increase
• B. Drop
• C. Stay still
• D. None of the mentioned

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________

• A. The set of processes that have been deadlocked
• B. The set of processes in the deadlock queue
• C. The specific process that caused the deadlock
• D. All of the mentioned

A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?

• A. 2
• B. 3
• C. 4
• D. 1

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________

• A. Can never occur
• B. May occur
• C. Has to occur
• D. None of the mentioned

‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock ____________

• A. Can never occur
• B. May occur
• C. Has to occur
• D. None of the mentioned

What is multimedia file?

• A. Is same as any other regular file
• B. Must be accessed at specific rate
• C. Stored on remote server can not be delivered to its client
• D. None of the mentioned

In which type of streaming multimedia file is delivered to the client, but not shared?

• A. Real-time streaming
• B. Progressive download
• C. Compression
• D. None of the mentioned

Which one of the following is the characteristic of a multimedia system?

• A. High storage
• B. High data rates
• C. Both high storage and high data rates
• D. None of the mentioned

The delay that occur during the playback of a stream is called ___________

• A. Stream delay
• B. Playback delay
• C. Jitter
• D. Event delay

Which algorithm can be optimized to meet the timing deadlines and rate requirements of continuous media?

• A. Earliest-deadline-first scheduling
• B. Scan-edf scheduling
• C. Both earliest-deadline-first scheduling & scan-edf scheduling
• D. None of the mentioned