1.

a. Which of the following are important design issues of memory cache?

	speed and volatility
	cache size and replacement policy
	power consumption and reusability
	cache size and access privileges

b.

Which of the following is most suitable for time sharing OS?

Question 2 options:

	Shortest Job First
	First Come First Serve
	Round Robin
	Priority scheduling

c.

Which of the following statements is correct about the method to pass parameters to the OS?

Question 3 options:

	All of them
	Pass parameters in registers
	Push parameters on stack and pop off the stack by OS
	Pass the starting address of blocks of parameters

d.

Which of the following is a significant problem in priority scheduling?

Question 4 options:

	determining the length of the time quantum
	starvation
	complexity
	aging

e.

If the next CPU burst is unknown, an exponential average of the measured lengths of previous CPU bursts can be used to predict the next CPU burst and approximate the ______ scheduling.

Question 5 options:

	Priority Scheduling
	Shortest Job First
	First Come First Serve
	Round Robin