Loyola College Operating System Question Papers Download
Loyola College B.Sc. Computer Science Nov 2006 Operating System Question Paper PDF Download
LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034 B.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
FIFTH SEMESTER – NOV 2006
CS 5501 – OPERATING SYSTEM
(Also equivalent to CSC 507)
Date & Time : 25-10-2006/9.00-12.00 Dept. No. Max. : 100 Marks
PART A
Answer ALL the questions (10 x 2 = 20)
1) List the two main functions of an operating system?
2) Mention the three states that a process may be in?
3) Name the four conditions for deadlock?
4) State the difference between a safe state and an unsafe state?
5) What is a dirty bit?
6) What is paging daemon?
7) Define cycle stealing?
8) What is polling or busy waiting?
9) How is the file access categorized?
10) What is called a hard link?
PART B
Answer ALL the questions (5 x 8 =40)
11) a) Discuss the system calls for directory management.
OR
- b) What are layered systems?
12 a) Explain critical region in detail
OR
- b) Discuss Banker’s algorithm for a single resource to avoid deadlock.
13) a) Explain memory management with linked list.
OR
- b) Discuss the following:
- FIFO algorithm (2)
- Second chance algorithm (2)
- Clock page algorithm (2)
- LRU (2)
14) a) Explain in detail about DMA, with a neat block diagram
OR
- b) How to bridge the gap between CPU performance and disk
performance using RAID?
15) a)List out the Unix system calls to manage the directories.
OR
- b) What are the different forms of directory system?
PART C
Answer any TWO questions (2 x 20 = 40)
16) Discuss the following in detail:
- Paging
- Page tables
- TLB
17) Discuss in detail about I/O software layers.
18) What are the implementation issues in virtual memory system?
Loyola College B.Sc. Computer Science April 2007 Operating System Question Paper PDF Download
LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
B.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
FIFTH SEMESTER – APRIL 2007
CS 5501 – OPERATING SYSTEM
Date & Time: 27/04/2007 / 1:00 – 4:00 Dept. No. Max. : 100 Marks
PART A
Answer ALL the questions (10 x 2 =20)
1) List the two main functions of an operating system?
2) What is the key difference between a trap and an interrupt?
3) Name the four main principle events that cause the processes to be created?
4) What are the four strategies for dealing with deadlocks?
5) Define page fault?
6) When external fragmentation is required?
7) How I/O devices are categorized?
8) Mention the properties of precise interrupt?
9) In how many ways a path name can be specified? What are they?
10) Define deadlock.
PART B
Answer ALL the questions (5 x 8 = 40)
11) a) Discuss system calls for file management.
OR
- b) What are monolithic systems?
12) a) What is a race condition? Explain
OR
- b) Explain the different ways to recover from deadlock.
13) a) Explain memory management with Bitmaps.
OR
- b) Discuss any four-page replacement algorithms.
14) a) Explain in detail how DMA is used to free the CPU from low level work, with a
neat block diagram
OR
- b) Justify the necessity of memory-mapped I/O?
15) a) List out the system calls related to files.
OR
- b) Explain how directory systems are organized.
PART C
Answer any TWO questions (2 x 20 = 40)
16) Discuss the following in detail: a) Paging b) Page tables c) TLB
17) Discuss the following in detail
- Interrupt handlers (5).
- Device drivers (5).
- Device independent operating system software (5).
- User level software (5).
18) What are the implementation issues in virtual memory system?
Loyola College B.Sc. Computer Science Nov 2008 Operating System Question Paper PDF Download
LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
B.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
FIFTH SEMESTER – November 2008
CS 5501 – OPERATING SYSTEM
Date : 03-11-08 Dept. No. Max. : 100 Marks
Time : 9:00 – 12:00
PART A (10×2=20 marks)
Answer ALL Questions
- Define Process
- What are the functions of an Operating System?
- Explain the need for Compaction.
- What is thrashing?
- State the steps performed in P(S) operation with respect to semaphores
- What is CPU headway?
- What is blocking with respect to file systems?
- Explain Dedicated devices.
- What are the functions of the I/O Scheduler?
- What is access control?
PART B (5×8=40 marks)
Answer ALL Questions
- a) Explain the different states of a process and their transitions.
(OR)
b) Explain the different types of Interrupts. - a) Define Deadlock. Explain in brief, how to prevent deadlock?
(OR)
b) Compare any two scheduling algorithms with an example - a) What is a page fault? How it is handled by Operating System?
(OR)
b) Compare any two page replacement algorithms
- a) Explain SPOOLING
(OR)
b) Explain management of Channels with respect to I/O devices
- a) Explain the hierarchical organization of file systems
(OR)
b) Explain the System calls related to Directory systems.
PART C (2×20=40 marks)
Answer any TWO Questions
- a) Explain Partitioned allocation with respect to memory.
b) Explain any two Page Replacement algorithms. - a) Explain Process Synchronization mechanisms.
b) What is deadly embrace? How can it be resolved? - a) Explain any two techniques of device management.
b) What are the different methods of File organization
Loyola College B.Sc. Computer Science April 2009 Operating System Question Paper PDF Download
LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
B.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
FIFTH SEMESTER – April 2009
CS 5501 – OPERATING SYSTEM
Date & Time: 16/04/2009 / 9:00 – 12:00 Dept. No. Max. : 100 Marks
PART – A
Answer ALL questions: (10 x 2 = 20)
- Define: Operating System.
- What is Multiprogramming?
- Mention any two major activities of an operating system with regard to memory management.
- When overlays are used?
- When do we say that a system is in safe state?
- Write a note on scheduling algorithm.
- Write any two advantages of Direct access storage devices.
- What do you mean by spooling?
- What are the objectives of file Management function?
- List out the advantages of UNIX.
PART – B
Answer any FIVE questions: (5 x 8 = 40)
- a) Explain the common operating system services which help the user.
(OR)
- b) Explain the various operations on process.
- a) What do you mean by compaction? Explain.
(OR)
- b) Write a note on Segmentation
- a)Explain on how the Banker’s algorithm used for Deadlock avoidance
(OR)
- b) Write a short note on Inter process communication
- a) Explain about disk scheduling with an example.
(OR)
- b) Explain the need for device management
- a) Explain the two level directory structure
(OR)
- b) Write a note on WINDOWS operating system
PART – C
Answer any TWO questions: (2 x 20 = 40)
- a) Explain the various types of system calls normally provided by an operating
system in detail.
- b) Explain in detail about Buffering.
- a) Explain the Segmentation memory management scheme in detail.
- b) Discuss in detail about Swapping.
- a) List out file protection methods and explain any three of them.
- b) Explain in detail on Disk scheduling.
Loyola College B.Sc. Computer Science Nov 2010 Operating System Question Paper PDF Download
LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
B.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
FIFTH SEMESTER – NOVEMBER 2010
CS 5504 – OPERATING SYSTEM
Date : 29-10-10 Dept. No. Max. : 100 Marks
Time : 9:00 – 12:00
PART A
Answer ALL the Questions (10 x 2=20 marks)
- Define Operating System.
- What is a System Call?
- List down the various process states.
- What are the various conditions for Deadlock?
- Define Multiprogramming.
- Differentiate Virtual Address and Physical Address.
- What is Memory Mapped I/O?
- Define Buffering.
- What is NFS in Linux File System?
- Define Caching.
PART B
Answer ALL the Questions (5 x 8=40 marks)
- a) Explain about the Layered Approach of the Operating System Structure.
(OR)
- b) Discuss on the System Calls provided for process management.
- a) Explain about Semaphores in Inter Process Communication.
(OR)
- b) Write about Deadlock Prevention Mechanisms.
- a) Discuss on Segmentation.
(OR)
- b) Explain about swapping.
- a) Explain about Graphical User Interface in Operating Systems.
(OR)
- b) Write in detail about I/O Software Layers.
- a) Explain about the Windows 2000 File systems.
(OR)
- b) Explain the common directory systems in operating system.
PART C
Answer any TWO Questions (2 x 20 = 40 marks)
- a) Explain the various tasks carried out by an operating system.
- b) Discuss on the various scheduling algorithms for batch systems.
- a) Explain the following page replacement algorithms with example.
- Optimal Page Replacement Algorithm.
- Least Recently Used (LRU) Page Replacement Algorithm.
- b) Discuss on Virtual Memory Management.
- a) Explain about Unix File systems.
- b) Discuss on UNIX Memory Management.
Loyola College B.Sc. Computer Science April 2012 Operating System Question Paper PDF Download
LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
B.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
FIFTH SEMESTER – APRIL 2012
CS 5504/CS 5501 – OPERATING SYSTEM
Date : 25-04-2012 Dept. No. Max. : 100 Marks
Time : 9:00 – 12:00
PART – A
ANSWER ALL THE QUESTIONS: (10 x 2 = 20 marks)
- Define spooling.
- Define system call.
- What is meant by deadlock?
- What do you mean by recovery through rollback?
- Define memory compaction.
- What is meant by page fault?
- What is memory-mapped I/O?
- What do you mean by cycle stealing?
- Define shell scripts.
- What are the file types available in Linux file system?
PART-B (5 x 8=40 marks)
ANSWER ALL THE QUESTIONS:
- a) Explain the layered systems design in the operating system structure.
(OR)
- b) List out the POSIX system calls associated with the file management.
- a) Discuss about the banker’s algorithm for a single resource.
(OR)
b)Explain the OSTRICH algorithm in the process of deadlock.
- a) Differentiate between Paging and segmentation.
(OR)
- b) Explain the structure of a Page Table Entry.
- a) What are the goals of the I/O software?
(OR)
- b) Describe in detail about the RS-232 Terminal Hardware.
- a) Describe some common file extensions in the file naming mechanism.
(OR)
- b) Explain the most common system calls relating to files operations.
PART-C
ANSWER ANY TWO QUESTIONS: (2×20=40 marks)
- a) Explain the deadlock Modeling with an appropriate figures.
- b) Describe the file system supported by virtually all operating systems.
- a) Discuss in detail about any five page replacement algorithms.
- b) Describe the sequence of events involved in page fault handling.
- a) Explain the Disk Arm scheduling algorithms.
- b) Explain the Win32 Application Programming Interface in Windows 2000.