MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1690 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 1251. |
The ability to move around within a media stream is known as : |
| A. | buffering |
| B. | random access |
| C. | access |
| D. | sequential access |
| Answer» C. access | |
| 1252. |
Real time streaming is most useful for : |
| A. | short video clips |
| B. | long video clips |
| C. | extremely short and low quality videos |
| D. | none of the mentioned |
| Answer» C. extremely short and low quality videos | |
| 1253. |
The media file is streamed to the client but is only played and not stored by the client in : |
| A. | progressive download |
| B. | regular download |
| C. | real time streaming |
| D. | virtual time streaming |
| Answer» D. virtual time streaming | |
| 1254. |
Progressive download is most useful for : |
| A. | short video clips |
| B. | long video clips |
| C. | extremely long and high quality videos |
| D. | none of the mentioned |
| Answer» B. long video clips | |
| 1255. |
A media file containing audio or video is downloaded and stored on the client’s local file system in : |
| A. | progressive download |
| B. | regular download |
| C. | real time streaming |
| D. | virtual time streaming |
| Answer» B. regular download | |
| 1256. |
The two types of streaming techniques are : |
| A. | progressive download & real time streaming |
| B. | regular download & real time streaming |
| C. | real time & virtual time streaming |
| D. | virtual time streaming |
| Answer» B. regular download & real time streaming | |
| 1257. |
Multimedia files stored on a remote server are delivered to a client across the network using a technique known as : |
| A. | download |
| B. | streaming |
| C. | flowing |
| D. | leaking |
| Answer» C. flowing | |
| 1258. |
Local playback is when : |
| A. | the multimedia data are delivered from a local file system |
| B. | a computer next to you is playing something |
| C. | a multimedia file is being played on a system in the local network |
| D. | none of the mentioned |
| Answer» B. a computer next to you is playing something | |
| 1259. |
The characteristic of the eye to retain the image for a short time after it has been presented is known as : |
| A. | persistence of vision |
| B. | learning power |
| C. | memory mapped input |
| D. | none of the mentioned |
| Answer» B. learning power | |
| 1260. |
The faster the frames are displayed, : |
| A. | the rougher the video appears |
| B. | the smoother the video appears |
| C. | it gets blurry |
| D. | none of the mentioned |
| Answer» C. it gets blurry | |
| 1261. |
Video is represented as a series of images formally known as : |
| A. | pics |
| B. | shots |
| C. | frames |
| D. | snaps |
| Answer» D. snaps | |
| 1262. |
The major difference between a multimedia file and a regular file is : |
| A. | the size |
| B. | the attributes |
| C. | the ownership |
| D. | the rate at which the file must be accessed |
| Answer» E. | |
| 1263. |
Which one of the following resource is not necessarily required on a file server? |
| A. | secondary storage |
| B. | processor |
| C. | network |
| D. | monitor |
| Answer» E. | |
| 1264. |
Multimedia system require hard real time scheduling |
| A. | to ensure critical tasks will be serviced within timing deadlines |
| B. | to deliver the media file to the client |
| C. | to minimize the delay |
| D. | for security |
| Answer» B. to deliver the media file to the client | |
| 1265. |
CineBlitz multimedia server supports |
| A. | real time clients |
| B. | non-real time clients |
| C. | both real time & non-real time clients |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1266. |
In teardown state of real time streaming protocol |
| A. | the server resources for client |
| B. | server delivers the stream to client |
| C. | server suspends delivery of stream |
| D. | server breaks down the connection |
| Answer» E. | |
| 1267. |
Real time streaming protocol is used |
| A. | to control streaming media servers |
| B. | for establishing and controlling media sessions between endpoints |
| C. | to provide real time control of playback of media files from the server |
| D. | all of the mentioned |
| Answer» E. | |
| 1268. |
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 |
| Answer» D. None of the mentioned | |
| 1269. |
The delay that occur during the playback of a stream is called |
| A. | stream delay |
| B. | playback delay |
| C. | jitter |
| D. | event delay |
| Answer» D. event delay | |
| 1270. |
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 |
| Answer» D. none of the mentioned | |
| 1271. |
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 |
| Answer» B. progressive download | |
| 1272. |
A 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 |
| Answer» C. stored on remote server can not be delivered to its client | |
| 1273. |
Can the processes in the previous question be scheduled without missing the deadlines ? |
| A. | yes |
| B. | no |
| C. | maybe |
| D. | None of the mentioned |
| Answer» C. maybe | |
| 1274. |
If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then : |
| A. | they can be scheduled by EDF algorithm |
| B. | they cannot be scheduled by EDF algorithm |
| C. | they cannot be scheduled by any other algorithm |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1275. |
There are two processes P1 and P2, whose periods are 50 and 100 respectively. P1 is assigned higher priority than P2. The processing times are t1 = 20 for P1 and t2 = 35 for P2. Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling ? |
| A. | yes |
| B. | no |
| C. | maybe |
| D. | none of the mentioned |
| Answer» B. no | |
| 1276. |
In rate monotonic scheduling, a process with a shorter period is assigned : |
| A. | a higher priority |
| B. | a lower priority |
| C. | higher & lower priority |
| D. | none of the mentioned |
| Answer» B. a lower priority | |
| 1277. |
Rate monotonic scheduling assumes that the : |
| A. | processing time of a periodic process is same for each CPU burst |
| B. | processing time of a periodic process is different for each CPU burst |
| C. | periods of all processes is the same |
| D. | none of the mentioned |
| Answer» B. processing time of a periodic process is different for each CPU burst | |
| 1278. |
The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption. |
| A. | earliest deadline first |
| B. | rate monotonic |
| C. | first cum first served |
| D. | priority |
| Answer» C. first cum first served | |
| 1279. |
The scheduler admits a process using : |
| A. | two phase locking protocol |
| B. | admission control algorithm |
| C. | busy wait polling |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1280. |
If the period of a process is ‘p’, then the rate of the task is : |
| A. | p2 |
| B. | 2*p |
| C. | 1/p |
| D. | p |
| Answer» D. p | |
| 1281. |
To schedule the processes, they are considered _________ |
| A. | infinitely long |
| B. | periodic |
| C. | heavy weight |
| D. | light weight |
| Answer» C. heavy weight | |
| 1282. |
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 |
| Answer» C. all of the mentioned | |
| 1283. |
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. C will have ______ percent of the total processor time. |
| A. | 20 |
| B. | 15 |
| C. | 50 |
| D. | none of the mentioned |
| Answer» B. 15 | |
| 1284. |
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. B will have ______ percent of the total processor time. |
| A. | 20 |
| B. | 15 |
| C. | 50 |
| D. | none of the mentioned |
| Answer» C. 50 | |
| 1285. |
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. A will have ______ percent of the total processor time. |
| A. | 20 |
| B. | 15 |
| C. | 50 |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1286. |
T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm. |
| A. | rate monotonic |
| B. | proportional share |
| C. | earliest deadline first |
| D. | none of the mentioned |
| Answer» C. earliest deadline first | |
| 1287. |
Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to : |
| A. | the cost of context switching |
| B. | interrupt handling |
| C. | power consumption |
| D. | all of the mentioned |
| Answer» B. interrupt handling | |
| 1288. |
In Question number 2, can the two processes be scheduled using the EDF algorithm without missing their respective deadlines ? |
| A. | Yes |
| B. | No |
| C. | Maybe |
| D. | None of the mentioned |
| Answer» B. No | |
| 1289. |
In the above question, the priorities of P1 and P2 : |
| A. | remain the same throughout |
| B. | keep varying from time to time |
| C. | may or may not be change |
| D. | none of the mentioned |
| Answer» C. may or may not be change | |
| 1290. |
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is : |
| A. | 0.90 |
| B. | 0.74 |
| C. | 0.94 |
| D. | 0.80 |
| Answer» D. 0.80 | |
| 1291. |
Earliest deadline first algorithm assigns priorities according to : |
| A. | periods |
| B. | deadlines |
| C. | burst times |
| D. | none of the mentioned |
| Answer» C. burst times | |
| 1292. |
The technique in which the CPU generates physical addresses directly is known as : |
| A. | relocation register method |
| B. | real addressing |
| C. | virtual addressing |
| D. | none of the mentioned |
| Answer» C. virtual addressing | |
| 1293. |
Memory management units : |
| A. | increase the cost of the system |
| B. | increase the power consumption of the system |
| C. | increase the time required to complete an operation |
| D. | all of the mentioned |
| Answer» E. | |
| 1294. |
The priority of a real time task : |
| A. | must degrade over time |
| B. | must not degrade over time |
| C. | may degrade over time |
| D. | none of the mentioned |
| Answer» C. may degrade over time | |
| 1295. |
The amount of memory in a real time system is generally : |
| A. | less compared to PCs |
| B. | high compared to PCs |
| C. | same as in PCs |
| D. | they do not have any memory |
| Answer» B. high compared to PCs | |
| 1296. |
Some of the properties of real time systems include : |
| A. | single purpose |
| B. | inexpensively mass produced |
| C. | small size |
| D. | all of the mentioned |
| Answer» E. | |
| 1297. |
In a ______ real time system, it is guaranteed that critical real time tasks will be completed within their deadlines. |
| A. | soft |
| B. | hard |
| C. | critical |
| D. | none of the mentioned |
| Answer» C. critical | |
| 1298. |
Antilock brake systems, flight management systems, pacemakers are examples of : |
| A. | safety critical system |
| B. | hard real time system |
| C. | soft real time system |
| D. | safety critical system and hard real time system |
| Answer» E. | |
| 1299. |
In a safety critical system, incorrect operation : |
| A. | does not affect much |
| B. | causes minor problems |
| C. | causes major and serious problems |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1300. |
In a real time system the computer results : |
| A. | must be produced within a specific deadline period |
| B. | may be produced at any time |
| C. | may be correct |
| D. | all of the mentioned |
| Answer» B. may be produced at any time | |