If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. If a new process D requested 30 shares, the admission controller would __________

• A. Allocate 30 shares to it
• B. Deny entry to d in the system
• C. All of the mentioned
• D. None of the mentioned

The ability to move around within a media stream is known as ___________

• A. Buffering
• B. Random access
• C. Access
• D. Sequential access

What are the two types of real time streaming?

• A. Live & on demand streaming
• B. Dead & static streaming
• C. Static & on demand streaming
• D. On demand streaming

Random access is not allowed in ___________

• A. Live streaming
• B. Dead streaming
• C. Static streaming
• D. On demand streaming

The streaming that takes place as the event is occurring is ___________

• A. Live streaming
• B. Dead streaming
• C. Static streaming
• D. On demand streaming

For a computer to deliver continuous media it must guarantee the specific rate and timing requirements, also known as ___________

• A. Deadline
• B. Quality of service
• C. Period
• D. Burst time

For QOS to be implemented properly ___________

• A. File systems must be efficient to meet the rate requirements of continuous media
• B. Network protocols must support bandwidth requirements while minimizing delay and jitter
• C. All of the mentioned
• D. None of the mentioned

What will happen once a file is compressed?

• A. It has a better quality
• B. It takes up less space for storage
• C. It cannot be delivered to the client more quickly
• D. None of the mentioned

Compression ratio is the ratio of ___________

• A. The original file size to the size of the compressed file
• B. The number of pixels in a frame of the original size to those in a frame of the compressed file
• C. Compressed file size to the original file size
• D. None of the mentioned

Lossy and lossless are classifications of ___________

• A. Multimedia storage systems
• B. Files
• C. Compression algorithms
• D. All of the mentioned