7/29/2019 OSl QP

1/6

Regulations: Reg.No:

DEGREE & BRANCH: B.Tech (IT)

Time: 3 hrs Maximum: 100 Marks

PART - A (20 x 1 = 20 Marks)

1. The term operating system means

a) a set of programs which controls computer working

b) the way a computer operator works

c) conversion of high level language into machine code

d) the way a floppy disk drives operates

2. Who performs the garbage collection?

a. The user

b. The memory management system

c. The processor, which switches to the garbage collection mode aftertermination of every program.

3. Once a program is compiled, it can be loaded for executiona. Only from the compiler generated starting address

b. Anywhere in the main memory

c. User needs to specify where the compiled code is to be loaded

d. It is loaded starting from address 0 in the main memory.4. The typical page size may be

a. Usually between 10 and100 bytes

b. Usually of 512 to 2k bytesc. More than 100 KB bytes but less than 1 MB

d. Minimally 1 MB

5. Which of the following is true in the context of Inter-process communication:a. It is like a user defined procedure call.

b. It is like user defined a function call.

c. It is a system call

6. Multiprogramming was made possible by

a) input/output units that operate independently of the cpu

b) operating system

c) both a and b

7. Moving Process from main memory to disk is called

a) scheduling

Page 1/6

11I504

2011

7/29/2019 OSl QP

2/6

b) caching

c) swapping

d) spooling

8. Producer consumer problem can be solved using

a) semaphores

b) event counters

c) monitors

d) All of the above

9. In the multiprogramming system, a set of processes is deadlock if each process in the set is

waiting for an event to occur that can be initialized only by another process in the set. Which of

the following is not one of he four conditions that are necessary for deadlock to occur?

a) Non preemption

b) process suspension

c) partial assignment of resources

d) circular wait

10. A critical section is a program segment

a) which should run in a certain specified amount of time.

b) which avoids deadlocks.

c) where shared resources are accessed.

d) which must be enclosed by a pair of semaphore operations, P and V.

11. Which of these is actually a very basic computer?

a) a toaster

b) a stovec) a calculator

d) a light bulb

12. An example of an operating system is _______________.a) Windows XP

b) UNIX

c) MAC OSd) all of the above

13. Which of the following devices cannot be used as an input device?

a) Modemb) Keyboard

c) Moused) Speaker

14. Memory on your computer where data is stored temporarily is called __________.

a) RAMb) ROM

c) BIOS

d) CPUPage 2/6

7/29/2019 OSl QP

3/6

15 To prevent data loss...

a) Save every five minutesb) Make a backup of your programs and save them in a safe location

c) Use an antivirus program and keep it updated

d) all of the above

16. What body part is most like the computers CPU?

a) the arms

b) the brainc) the feet

d) the eyes

17. Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order) and processes of

212K, 417K, 112K, and 426K (in order), using the first-fit algorithm in which partition

would the process requiring 426K be placed?a. 100K

b. 500K

c. 200Kd. 300K

e. 600K18. The simplest way to break a deadlock is to

a. preempt a resourceb. rollback

c. kill one of the processes

d. lock one of the processes

19. A portion of the Windows 2000 operating system that is NOT portable is

a. processor managementb. user interface

c. device management

d. Virtual Memory Manager20. In the blocked state

a) the processes waiting for I/O are found

b) the process which is running is found

c) the processes waiting for the processor are found

Regulations: Reg.No:

Page 3/6

2011

7/29/2019 OSl QP

4/6

DEGREE & BRANCH: B.Tech (IT)

Time: 3 hrs Maximum: 80 Marks

PART - B (10 x 2 = 20 Marks)

Answer All Questions21. Compare preemptive and non preemptive scheduling methods.

22. Compare and contrast the round-robin, pre-emptive policy with shortest job first pre-emptive

policy.

23. Describe first-fit and best-fit strategies for disk space allocation, with their merits and

demerit.

24. How is the information organized along sectors on a disk?

25. Bring out the difference between Deadlock avoidance and deadlock prevention scheme.

26. What is mutual exclusion? Depict a scenario where mutual exclusion is required.

27. Describe at least three environmental variables that are carried by the child process from the

description of parent process.

28. Identify the motivation for establishing inter-process communication?

29. From point of view of requirements, how is a real-time operating system different from

general purpose operating system?

30. Define the essential properties of the following types of operating systems.

a Real timeb Hand held

c Main frame

PART - C(5 x 16 = 80 Marks)31.a) Consider the following snapshot of a system:

Allocation Max Available

ABCD ABCD ABCDPo 0012 0012 1520

P1 1000 1750

P2 1354 2356

P3 0632 0652P4 0014 0656

(12)

Page 4/6

11I504

7/29/2019 OSl QP

5/6

Answer the following questions using the banker's algorithm:

a. What is the content of the matrix Need?b. Is the system in a safe state?

c. If a request from process P1 arrives for (0,4,2,0), can the request be

granted immediately?(OR)

31.b) Both segmentation and paging has its own pros and cons . Illustrate how the

combination of these technologies improves both?

(12)

32.a) Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB

(inorder), how would each of the first-fit, best-fit, and worst-fit algorithms

place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)?Whichalgorithm makes the most efficient use of memory?

(12)

(OR)

32.b) Three major methods are extensively used for allocating disk spaces. Identify

them and Explain.

(12)

33.a) Consider the following set of processes, with the length of the CPU-bursttimegiven in milliseconds:

Process Burst Time PriorityP1 10 3

P2 1 1

P3 2 3p4 1 4

P5 5 2

The processes are assumed to have arrived in the order PI, P2,P3, P4, P5,all at

time 0.a. Draw four Gantt charts illustrating the execution of these

processesusing FCFS, SJF, a nonpreemptive priority (a smallerpriority number implies a higher priority), and RR (quantum =1)scheduling.

b. What is the turnaround time of each process for each of the

scheduling algorithms in part a?c. What is the waiting time of each process for each of the

scheduling algorithms in part a?

d. Which of the schedules in part a results in the minimal

average waiting time (over all processes)?

(12)

(OR)

33.b) When files are stored in computers, we want to keep them safe from physical

damage and improper access. Describe the various types of access, accesscontrol and other protection approaches.

(12)

34.a) Consider the following page-reference string:1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.

How many page faults would occur for the following replacement algorithms,

assuming one, two, three, four, five, six, or seven frames? Remember that allframes are initially empty, so your first unique pages will all cost one fault

each.

(12)

Page 5/6

7/29/2019 OSl QP

6/6

LRU replacement

FIFO replacement

Optimal replacement

(OR)

34.b) The basic unit of CPU utilization comprises of an ID, program counter etc.Identify it and Explain.

(12)

35.a) Explain the various sequences of events that are responsible for the present day

LINUX.

(12)

(OR)

35.b) Windows 2000 has a layered System of modules. Illustrate it with a neat figure. (12)

********************

Page 6/6