Q. The most effective technique to keep dispatch latency low is to :

View solution

Q. Priority inversion is solved by use of _____________

View solution

Q. In a real time system the computer results :

View solution

Q. In a safety critical system, incorrect operation :

View solution

Q. Antilock brake systems, flight management systems, pacemakers are examples of :

View solution

Q. In a ______ real time system, it is guaranteed that critical real time tasks will be completed within their deadlines.

View solution

Q. Some of the properties of real time systems include :

View solution

Q. The amount of memory in a real time system is generally :

View solution

Q. The priority of a real time task :

View solution

Q. Memory management units :

View solution

Q. The technique in which the CPU generates physical addresses directly is known as :

View solution

Q. Earliest deadline first algorithm assigns priorities according to :

View solution

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

View solution

Q. Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to :

View solution

Q. T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. To schedule the processes, they are considered _________

View solution