מערכות הפעלה

Which of the following statements are true?

1

שאלה #43535

		Shortest remaining time first scheduling may cause starvation
		Preemptive scheduling may cause starvation
		Round robin is better than FCFS in terms of response time
		non of the above

Explanation: I) Shortest remaining time first scheduling is a preemptive version of shortest job scheduling. It may cause starvation as shorter processes may keep coming and a long CPU burst process never gets CPU. II) Preemption may cause starvation. If priority based scheduling with preemption is used, then a low priority process may never get CPU. III) Round Robin Scheduling improves response time as all processes get CPU after a specified time.

מיין לפי

Which is the most optimal scheduling algorithm?

1

שאלה #43536

		FCFS
		SJF
		RR
		None of the mentioned

מיין לפי

he real difficulty with SJF in short term scheduling is

1

שאלה #43537

		it is too good an algorithm
		knowing the length of the next CPU request
		it is too complex to understand
		none of the mentioned

מיין לפי

The FCFS algorithm is particularly troublesome for

1

שאלה #43538

		time sharing systems
		multiprogramming systems
		multiprocessor systems
		operating systems

Explanation: In a time sharing system, each user needs to get a share of the CPU at regular intervals.

מיין לפי

An SJF algorithm is simply a priority algorithm where the priority is

1

שאלה #43539

		the predicted next CPU burst
		the inverse of the predicted next CPU burst
		the current CPU burst
		anything the user wants

Explanation: The larger the CPU burst, the lower the priority.

מיין לפי

Choose one of the disadvantages of the priority scheduling algorithm?

1

שאלה #43540

		it schedules in a very complex manner
		its scheduling takes up a lot of time
		it can lead to some low priority process waiting indefinitely for the CPU
		none of the mentioned

מיין לפי

What is ‘Aging’?

1

שאלה #43541

		keeping track of cache contents
		keeping track of what pages are currently residing in memory
		keeping track of how many times a given page is referenced
		increasing the priority of jobs to ensure termination in a finite time

מיין לפי

A solution to the problem of indefinite blockage of low – priority processes is

1

שאלה #43542

		Starvation
		Wait queue
		Ready queue
		Aging

מיין לפי

Which of the following are true

1

שאלה #43543

		Shortest remaining time first scheduling may cause starvation
		Preemptive scheduling may cause starvation
		Round robin is better than FCFS in terms of response time
		none of the above

מיין לפי

Which of the following scheduling algorithms gives minimum average waiting time?

1

שאלה #43544

		FCFS
		SJF
		Round – robin
		Priority

מיין לפי

Discuss, Learn and be Happy דיון בשאלות

Which of the following statements are true?

Which is the most optimal scheduling algorithm?

he real difficulty with SJF in short term scheduling is

The FCFS algorithm is particularly troublesome for

An SJF algorithm is simply a priority algorithm where the priority is

Choose one of the disadvantages of the priority scheduling algorithm?

What is ‘Aging’?

A solution to the problem of indefinite blockage of low – priority processes is

Which of the following are true

Which of the following scheduling algorithms gives minimum average waiting time?

בקשה לשינוי התשובה / תיקון שאלה gavel

בקשה למחיקת השאלהmood_bad

בקשה לשינוי התשובה / תיקון שאלה

בקשה למחיקת השאלה