SRI VENKATESHWARAA COLLEGE OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SUBJECT: OPERATING SYSTEMS

UNIT I

2 MARKS

1.	What is an Operating system? (APR’15) 

2.	Why is the Operating System viewed as a resource allocator & control program? 

3.	What is the Kernel? 

4.	What are Batch systems? 

5.	What is the advantage of Multiprogramming?(APR ‘12) 

6.	What is an Interactive computer system? 

7.	What do you mean by Time-sharing systems? 

8.	What are multiprocessor systems & give their advantages?(APR ‘14)(APR ‘12)(APR’15) 

9.	What are the different types of multiprocessing? 

10.	What is Distributed system? (APR ’12, NOV ‘15) 

11.	What are the advantages of distributed processing? (APR ‘13) 

12.	What are the disadvantages of distributed processing? 

13.	What is graceful degradation? 

14What is Dual-Mode Operation?

15.	What are privileged instructions? 

16.	How can a user program disrupt the normal operations of a system? 

17.	How is the protection for memory provided? 

18.	What are the various OS components? 

19.	What is a process? 

20.	What is a process state and mention the various states of a process?(APR ‘12) 

21.	What is process control block? 

22.	What are the use of job queues, ready queues & device queues? 

23.	What is meant by context switch? (NOV’14) 

24.	What are the factors that need to be considered to determine the degree of multiprogramming in a system? 

25.	What is the difference between the idle and blocked state of a process? 

26.	When a process requests for I/O, how many process switches take place? 

27.	Differentiate tightly coupled systems and loosely coupled systems? 

28.	What is real time system?(APR 2011) (NOV 2011) 

29.	What do you mean by system calls? (APR ‘12) 

30.	What is scheduler? 

31.	What is independent process? 

32.	What is co-operative process? 

33.	What is the benefits of OS co-operating process? 

34.	How can a user program disturb the normal operation of the system? 

35.	What is the use of inter process communication. 

36.	What are the five major activities of an operating system with regard to process management?(APR ‘14) 

37.	Describe the differences between symmetric and asymmetric multiprocessing?(APR 2011) 

38.	Define Information Sharing?(NOV ‘12) 

39.	List the types of server systems?(NOV ‘13) 

40.	What is the use of fork and exec system calls? 

41.	What’s the difference between multitasking, multiprogramming & multiprocessing? 

42.	Define PCB and write its contents?(APRIL 2011) 

43.	What is meant by independent process and cooperating process? (APR’12) 

44.	Name any three components of the system. (Nov ’15) 

11	MARKS 

1.	Explain computer systems which are categorized according to the number of processors used? (APR ‘12) 

2Write in detail about Mainframe systems(APR ‘14) 

3.	Explain Multiprocessor systems or Parallel Systems(APR 2011) 

4.	Write about Distributed Systems (APR 2011)( APR ‘12) 

5.	Write short notes on Clustered Systems and real time &hand held systems (NOV 13) 

6.	Write short notes on Hardware Protection 

7.	List out and discuss operating System Components?(NOV ‘12)(APR’15) 

8.Write notes on Operating System Services (APR ’12, NOV ‘15) 

9.	Discuss and detail about System Calls and system programs (APR ‘12)(NOV ‘12)(NOV’14) 

10.	Explain Different type of system calls?(NOV 12)(APR’15) 

11.Write short notes on Process(APR 12)(NOV 13) 

12.Write about process scheduling   (NOV’14)

13.Write about operation on Processes(NOV 13) (NOV’14, NOV ‘15)

14.	Explain how cooperating process can communication in direct and indirect communication? 

(APR ‘13) 

15.	Explain Producer-Consumer Problem 

16.	Write about Inter process Communication (APR ’14, NOV ‘15) 

17.	Write short notes on system programs. 

UNIT II 2 MARKS

1.	What is a thread? (APR’15, NOV ‘15) 

2.	What are the benefits of multithreaded programming? (NOV’14) 

3.	Write the types of Thread? 

4.	Compare user threads and kernel threads? 

5.	Define thread cancellation & target thread. 

6.	What are the different ways in which a thread can be cancelled? 

7.	Define CPU scheduling (APR’15) 

8.	What is preemptive and non preemptive scheduling? 

9.	What is a Dispatcher? (NOV ‘11) 

10.	What is dispatch latency? 

11.	What are the various scheduling criteria for CPU scheduling? 

12.	Define throughput? (NOV ‘11)(ARPIL ‘14) 

13.	What is turnaround time? 

14.	Define race condition? (ARPIL ‘14) 

15.	What is critical section problem? (APR ‘11) 

16.	What are the requirements that a solution to the critical section problem must satisfy? 

(NOV’14) 

17.	Define entry section and exit section. 

18.Give two hardware instructions and their definitions which can be used for implementing 19.What is semaphores?

20. Define busy waiting and spinlock?

21.What happens if the time allocated in a Round Robin Scheduling is very large? And what happens if the time allocated is very low?

22.What is reader writers problem in shared file type of interprocess communication?

23.	Write down Scheduling Criteria? 

24.	What is the difference between process and thread? 

25.	What is Spooling? 

26.	List the advantage of Spooling? 

27.	What is meant by CPU–I/O Burst Cycle, CPU burst, I/O burst? 

28.	Define Aging and starvation? (APR’ 14) 

29.	What is context switch? (APR ‘11) 

30.	What is a monitor? (NOV ’15) 

11	MARKS 

1.	Write short notes on CPU scheduler (NOV 13) (APR ‘11) (NOV ’15) 

2. Explain FCFS	(NOV 13)			
3.Write short notes on shortest job scheduling	
4.Write short notes on priority scheduling		
5. Explain Round Robin (RR)	(NOV ’15)	
6.Explain Multi level queue scheduling	(NOV ‘11)	
7.Explain Multilevel Feedback Queue		

8.	Write short notes on Multiple-Processor Scheduling (NOV ‘11)(APR’12) 

9.	Write in detail about Critical section problem OR what is critical section problem and explain two process solution and multiple process solutions? (NOV 11) (APR’15) 

10.	Explain Bakery Algorithm OR Multiple process solution (APR’15) 

11.	Write short notes on Synchronization Hardware  (NOV 11)(NOV 13) 

12.Write short notes on Semaphores(NOV ’12, NOV ‘15)

13.Write short notes on Dining-Philosophers Problem  (NOV’14)

14.Write short notes on Readers-Writers Problem   (APR ‘14,NOV’14)

15.Explain producer-consumer problem	(APR ‘14)

16.Write short notes on Critical region

17.Write short notes on Monitors

18.	Explain real time scheduling? 

19.	Explain in detail about the threading issues (APR’15) 

20.	Describe the difference between wait (A) where A is a semaphore and B Wait() ,where B is a condition variable in a monitor. (NOV’14) 

UNIT III 2 MARKS

1.	Define deadlock. (NOV 13, NOV ‘15) 

2.	What is the sequence in which resources may be utilized? 

3.	What are conditions under which a deadlock situation may arise? Or Write four general strategies for dealing with deadlocks? (APR’15)(NOV’14) 

4.	What is a resource-allocation graph? 

5.	Define request edge and assignment edge. 

6.	What are the methods for handling deadlocks? 

7.	Define deadlock prevention. 

8.	Define deadlock avoidance. 

9.	What are a safe state and an unsafe state? 

10.	What is banker's algorithm? 

11.	Define logical address and physical address. 

12.	What is logical address space and physical address space? 

13.	Why the page sizes is always power of 2 in memory? (NOV 13) 

14.What is the main function of the memory-management unit?

15.	Define dynamic loading. 

16.	Define Swapping (APR’15) 

17.	Define dynamic linking. 

18.	What is of resource allocation graph? (APR’12) 

19.	What is External Fragmentation? (APR 2014) 

20.	What are the common strategies to select a free hole from a set of available holes? 

21.	What do you mean by best fit?(APR 2012) 

22.	What do you mean by first fit?(APR 2012) 

23.	What are the criteria for LRU page replacement algorithms?(APR 2012) 

24.	Define effective access time. 

25.	Write the difference between internal and external fragmentation. 

26.	Explain the difference between paging and segmentation. 

27.	What are overlays? 

28.	Define paging? (NOV ’15) 

11	MARKS 

1.	Write short notes on Dead lock and its characteristics?(6 Marks) 

2.	Explain Deadlock Prevention in detail? (6 Marks) (APR’15) 

3.	Explain Deadlock Avoidance in details? (11 Marks) (APR 2012) 

4.	Explain Banker’s Algorithm (6) (APR 2012, NOV ‘15) 

5.	Explain Deadlock Detection (8 Marks)? (NOV 2011) (NOV 2012) 

6.	Write short notes on Recovery from Deadlock (5 Marks) (NOV 2011) (NOV 2012) 

7.	Explain about contiguous memory allocation (5Marks) (APR 2014) 

8.	Explain Paging in detail? (6) (APR 2014, NOV ‘15) 

9.	Explain TLB (6Marks) 

10.	Describe the paging memory management scheme in details?(APR 2012) 

11.	Discuss in Segmentation in details? (11) (NOV 13) 

12.	Consider the following snapshot of a system: (11) (NOV 13) 

	Allocation	Max	Available	
	ABCD	ABCD	ABCD	
Po	0012	0012	1520	
P1	1000	1750		
P2	1354	2356		
P3	0632	0652		
P4	0014	0656		

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? 

13. Consider the following snapshot of a system: (11) (NOV 14)

		Allocation			Max		
	A	B	C	A	B	C	
Po	0	0	2	2	0	3	
P1	1	1	0	2	3	5	
P2	0	0	1	1	2	3	
P3	1	0	0	2	0	3	
P4	0	0	2	0	1	5	

UNIT IV

2	MARKS 

1.	What is virtual memory?(APR ‘11)(APR ‘12) 

2.	What is Demand paging? 

3.	Define lazy swapper. 

4.	Compare Swapper with Lazy Swapper?(NOV ‘13) 

5.	What is a pure demand paging? 

6.	Define secondary memory. 

7.	Consider a logical address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames. A. How many bits are there in the logical address? B. How many bits are 

there in the physical address?

8.	What is the basic approach of page replacement? If no frame is free is available, find one that 

9.	What is the various page replacement algorithms used for page replacement? 

10.	What are the major problems to implement demand paging? 

11.	What is a reference string? 

12.	What is thrashing? (APR 11, NOV ‘15) 

13.	Write any two causes of Thrashing? 

14.	State the functions of working set strategy model (NOV’14) 

15.	Enumerate Search Path? (NOV ‘13) 

16.	What is a file? 

17.	What is Access method? 

18.What are the possible methods to be used to access file?

19.	List the various File Attributes? (APR ‘12)(NOV ‘12) 

20.	What are the various file operations? 

21.	Write some file type and its extension? 

22.What are the information associated with an open file?

23. What are the different accessing methods of a file? (APR’15)

24.What is Access control?

25.What are the advantages and disadvantages of access control? (NOV’14)

26.	What is Directory? 

27.	What are the operations that can be performed on a directory? 

28.	What are the most common schemes for defining the logical structure of a directory? 

29.	Define UFD and MFD. 

30.	What is a path name? 

31.	What is System file checker in Windows?(NOV ‘11) 

32.	Give any two criteria to chose a file organization? (APR ‘12) 

33.	How information is maintained in is Directory? 

34.	What is Directory Structure? 

35.	What are the operations that can be performed on a directory? 

36.	Mention the Directory design goals? 

37.	What is File Lock? (NOV ‘11) (APR ‘11) 

38.	What is File Control Block? (APR ‘14) 

39.	Define Single-Level Directory? 

40.	Define Two Level Directory? 

41.	Define Tree-Structured Directories? 

42.	Define Acyclic-Graph Directories? 

43.	What is File System Mounting? 

44.	What is File Authentication?(NOV ‘11)(ARPIL ‘11) 

45.	Define File Sharing? 

46.	How will you protect  the file system? 

47.	What is the principle of optimality? (NOV ’15) 

11 MARKS

1.	Explain demand paging in detail? (11) 

2.	Explain page replacement in detail? (11) (APR’15, NOV ‘15) 

3.	Explain Thrashing? (APR ‘11) (APR ‘14) (NOV ’15) 

4.	What are files and explain the access methods for files? (APR ’14, NOV ‘15) 

5.	Write short notes on single and two-level Directory?  (APR ‘11) 

6.	Describe about Acyclic Graph Directory (11 Marks) (NOV 13) 

7.	Explain Tree structured directories?  5 Marks (APR ‘14) 

8.	Write notes about the protection strategies provided for files . (APR’15) 

9.	Consider the following page reference string:  (APR ‘11) 

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?

10.	Explain in detail about file sharing? (APR ‘12) 

11.	Write short notes on process creation 

12.	Explain how many frames can be allocated to processors? 

13.	Explain about file system mounting 

UNIT V 2 MARKS

1.Define Bootstrap Program?(NOV ‘12)

2.What is boot control block 3.What is volume control block 4.Draw file control block

5.List the methods to implement directory 6.Write the types of directory allocation methods? 7.What is Contiguous Allocation?

8.What is the drawback of contiguous allocation? How to overcome from it? 9.What is linked allocation?

10.Write the disadvantages of Linked allocation 11.What is indexed allocation

12.	Write about free space management 

13.	How free list can be implemented 

14.	Write about Bit vector 

15.	Write about Linked List in free space management 

16.	Write about Grouping in free space management 

17.	Write about Counting in free space management 

18.	What do you mean by seek time? (APR ‘12) 

19.	List the disk performance parameter?( APR ‘13) 

20.	What is the purpose of device drivers? (APR ‘13) 

21.	List Different types of scheduling algorithm are as follows: 

22.	Write about FCFS Scheduling 

23.Write about SSTF Scheduling 24.Write about Scan Scheduling: 25.Write about C-Scan Scheduling: 26.Write about LOOK scheduling: 27.Write about C-LOOK scheduling:

28.	Write about Linux 1.0 ? 

29.	Write about Linux 2.0? 

30.	Define Slack ware? 

31.	Write the Kernel modules are available in Linux? 

32.	Define Kernel in OS? (APR  ‘12) (APR’15) (NOV ’15) 

33.	Define Module Management? 

34.	Define Driver Registration? 

35.	Define Conflict Resolution? 

36.	Write the contents of Registration tables? 

37.	What are the operations are available in process management? 

38.	Define Scheduling Context? 

39..Define signal-Handler table?

40.	What is IPC? (APR ‘12) 

41.	Define file table? 

42.Define Virtual Memory context?

43.	Write any two advantages of Linux?( NOV ‘12) 

44.	Define static Linking? 

45.Define Dynamic Linking?

46.	Define Interprocess Communication? 

47.	Write any two design principles of Linux? 

48.	What is Process Identity? 

49.	Brief about Process Environment Block (PEB).(NOV ‘13) 50.Write about fork() and clone() system call? 

51.	Does Linux supports Symmetric Multiprocessing? 

52.	List the role of process manager?( NOV ‘13) 

53.	Write about Character Devices 

54.Write about few design principles of windows XP 55.Write about XP Architecture? 

56.write about system components of XP? 57.Write about Kernel and Process and Threads? 58.What is Kernel Scheduling 

59.What is soft real time 60.write about i/ o subsystem 

61.What type of security is provided by Windows XP (APR’15) 

62.	Write about file compression in XP 63.write about memory management 

64.Write about interprocess communication in XP 

65.	What type of operating system is Windows XP? Describe two of its major features. 

66.	List the design goals of Windows XP. Describe two in detail. 

67. What are the responsibilities of the I/O manager?

68.Sketch the components of a Linux system (NOV’14) 69. Define physical record and logical record. (NOV ’15)

11	MARKS 

1.	Explain  the  allocation  methods  for  disk  space  in  file  allocation?  (NOV  12,13) (APR ‘11)(APR’15) 

2.	Explain Disk Scheduling in detail with example? (APR ‘11) (APR ‘13) (NOV ’15) 

3.	Discuss the various techniques used to improve the efficiency and performance of secondary storage?  (APR ‘14)

4.	Briefly explain Disk management and swap space management? (NOV ‘12) 

5.	Explain in detail about Kernel architecture of  Linux? (APR ‘13)(NOV ‘13) 

6.	Explain in Detail about Process management? (NOV’14) 

7.	Explain in detail about Process Scheduling? 

8.	Explain how interprocess communication is carried out in Linux OS? ( NOV ‘12) (APR’13) (APR’15) 

9.	Explain in detail about Linux advantage? 

10.	Explain how the memory and file management is implemented in windows XP? (APR’13) 

11.	Explain in detail about Security? (NOV’14) 

12.	Explain in detail about Windows XP System Architecture?(NOV ‘12) (APR’15) 

13.	Describe about memory allocation stages. (11)(NOV ‘13) 

14.	Explain how the following mechanisms are implemented in Windows XP? 

(1)Thread (2) IPC (APR ‘12)

15.	Explain in detail about Security? 

16.	Write in detail about Kernel I/O subsystem.

17.	Discuss on file system structure in the linux systems. (NOV ’15)