Question 1

The amount of time required for the scheduling dispatcher to stop one process and start another is known as _____________

Accepted Answer

A) event latency 
B) interrupt latency 
C) dispatch latency 
D) context switch 
A) event latency 
B) interrupt latency 
C) dispatch latency 
D) context switch C

Question 2

Preemptive, priority based scheduling guarantees ____________

Accepted Answer

A) hard real time functionality 
B) soft real time functionality 
C) protection of memory 
D) none of the mentioned 
A) hard real time functionality 
B) soft real time functionality 
C) protection of memory 
D) none of the mentioned B

Question 3

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.

Accepted Answer

A) 20 
B) 15 
C) 50 
D) none of the mentioned 
A) 20 
B) 15 
C) 50 
D) none of the mentioned C

Question 4

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. Can the processes be scheduled without missing the deadlines?

Accepted Answer

A) Yes 
B) No 
C) Maybe 
D) None of the mentioned 
A) Yes 
B) No 
C) Maybe 
D) None of the mentioned

Question 5

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., can the two processes be scheduled using the EDF algorithm without missing their respective deadlines?

Accepted Answer

A) Yes 
B) No 
C) Maybe 
D) None of the mentioned 
A) Yes 
B) No 
C) Maybe 
D) None of the mentioned

Question 6

. 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.

Accepted Answer

A) 20 
B) 15 
C) 50 
D) none of the mentioned 
A) 20 
B) 15 
C) 50 
D) none of the mentioned

Question 7

Earliest deadline first algorithm assigns priorities according to ____________

Accepted Answer

A) periods 
B) deadlines 
C) burst times 
D) none of the mentioned 
A) periods 
B) deadlines 
C) burst times 
D) none of the mentioned

Question 8

Real time systems need to __________ the interrupt latency.

Accepted Answer

A) minimize 
B) maximize 
C) not both A &Ber about 
D) none of the mentioned 
A) minimize 
B) maximize 
C) not both A &Ber about 
D) none of the mentioned

Question 9

Memory management units ____________

Accepted Answer

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 
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

Question 10

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 priorities of P1 and P2 are?

Accepted Answer

A) remain the same throughout 
B) keep varying from time to time 
C) may or may not be change 
D) none of the mentioned 
A) remain the same throughout 
B) keep varying from time to time 
C) may or may not be change 
D) none of the mentioned

Question 11

The amount of memory in a real time system is generally ____________

Accepted Answer

A) less compared to PCs 
B) high compared to PCs 
C) same as in PCs 
D) they do not have any memory 
A) less compared to PCs 
B) high compared to PCs 
C) same as in PCs 
D) they do not have any memory

Question 12

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 ____________

Accepted Answer

A) 0.90 
B) 0.74 
C) 0.94 
D) 0.80 
A) 0.90 
B) 0.74 
C) 0.94 
D) 0.80

Question 13

In a real time system the computer results ____________

Accepted Answer

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 
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

Question 14

In real time operating system ____________

Accepted Answer

A) all processes have the same priority 
B) a task must be serviced by its deadline period 
C) process scheduling can be done only once 
D) kernel is not required 
A) all processes have the same priority 
B) a task must be serviced by its deadline period 
C) process scheduling can be done only once 
D) kernel is not required

Question 15

The most effective technique to keep dispatch latency low is to ____________

Accepted Answer

A) provide non preemptive kernels 
B) provide preemptive kernels 
C) make it user programmed 
D) run less number of processes at a time 
A) provide non preemptive kernels 
B) provide preemptive kernels 
C) make it user programmed 
D) run less number of processes at a time

Question 16

In rate monotonic scheduling algorithm Select one:

Accepted Answer

A) shorter duration job has higher priority, 
B) longer duration job has higher priority 
C) priority does not depend on the duration of the job 
D) none of the mentioned 
A) shorter duration job has higher priority, 
B) longer duration job has higher priority 
C) priority does not depend on the duration of the job 
D) none of the mentioned

Question 17

Calculate the idle time of the processor with 3 periodic tasks whose execution times are given as 1, 1, and 3, and their periods are 3, 4, and 10. Select one: 17% 12% 88%

Accepted Answer

A) 0.17 
B) 0.12 
C) 0.88 
D) 1 
A) 0.17 
B) 0.12 
C) 0.88 
D) 1

Question 18

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 __________

Accepted Answer

A) allocate 30 shares to it 
B) deny entry to D in the system 
C) all of the mentioned 
D) none of the mentioned 
A) allocate 30 shares to it 
B) deny entry to D in the system 
C) all of the mentioned 
D) none of the mentioned

Question 19

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.

Accepted Answer

A) 20 
B) 15 
C) 50 
D) none of the mentioned 
A) 20 
B) 15 
C) 50 
D) none of the mentioned

Question 20

Antilock brake systems, flight management systems, pacemakers are examples of

Accepted Answer

A) safety critical system 
B) hard real time system 
C) soft real time system 
D) safety critical system and hard real time system 
A) safety critical system 
B) hard real time system 
C) soft real time system 
D) safety critical system and hard real time system

The amount of time required for the scheduling dispatcher to stop one process and start another is known as _____________

Preemptive, priority based scheduling guarantees ____________

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 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. Can the processes be scheduled without missing the deadlines?

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., can the two processes be scheduled using the EDF algorithm without missing their respective deadlines?

. 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.

Earliest deadline first algorithm assigns priorities according to ____________

Real time systems need to __________ the interrupt latency.

Memory management units ____________

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 priorities of P1 and P2 are?

The amount of memory in a real time system is generally ____________

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 ____________

In a real time system the computer results ____________

In real time operating system ____________

The most effective technique to keep dispatch latency low is to ____________

In rate monotonic scheduling algorithm Select one:

Calculate the idle time of the processor with 3 periodic tasks whose execution times are given as 1, 1, and 3, and their periods are 3, 4, and 10. Select one: 17% 12% 88%

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 __________

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.

Antilock brake systems, flight management systems, pacemakers are examples of

Chip Design, Protocols, and Communication

Embedded Systems and Communication Protocols

Computer Bus and IO Operations

ISA, Communication Modes, Wlan, Serial Protocols, ARM Processors, and Real-Time Systems

Real-Time Operating System Scheduling and Job Management

Filters

Exam 5: Real Time Operating Systems and Scheduling Techniques

The amount of time required for the scheduling dispatcher to stop one process and start another is known as _____________

Preemptive, priority based scheduling guarantees ____________

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 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. Can the processes be scheduled without missing the deadlines?

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., can the two processes be scheduled using the EDF algorithm without missing their respective deadlines?

. 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.

Earliest deadline first algorithm assigns priorities according to ____________

Real time systems need to __________ the interrupt latency.

Memory management units ____________

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 priorities of P1 and P2 are?

The amount of memory in a real time system is generally ____________

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 ____________

In a real time system the computer results ____________

In real time operating system ____________

The most effective technique to keep dispatch latency low is to ____________

In rate monotonic scheduling algorithm Select one:

Calculate the idle time of the processor with 3 periodic tasks whose execution times are given as 1, 1, and 3, and their periods are 3, 4, and 10. Select one: 17% 12% 88%

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 __________

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.

Antilock brake systems, flight management systems, pacemakers are examples of

Chip Design, Protocols, and Communication

Embedded Systems and Communication Protocols

Computer Bus and IO Operations

ISA, Communication Modes, Wlan, Serial Protocols, ARM Processors, and Real-Time Systems

Real-Time Operating System Scheduling and Job Management

Filters