Loyola College M.Sc. Computer Science April 2011 Operating Systems Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

SECOND SEMESTER – APRIL 2011

CS 2811/ 2809 – OPERATING SYSTEMS

 

 

 

Date : 02-04-2011             Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

                                                                           SECTION – A       

ANSWER ALL THE QUESTIONS:                                                                                         (10X2=20)

  1. Define Multiprocessor Systems.
  2. What are the different categories of System Calls in OS?
  3. Differentiate I/O-Bound and CPU-Bound process.
  4. What is turnaround time?
  5. Define Wait and Signal Operation.
  6. What is deadlock?
  7. What is fragmentation?
  8. What is Virtual Memory?
  9. List the basic file operations.
  10. What is a file descriptor?

SECTION – B

ANSWER ALL THE QUESTIONS:                                                                                         (5X8=40)

11 a) Explain Real-Time Systems

(OR)

  1. b) Explain the various system services of an operating System

12 a) Explain about Inter Process Communication

(OR)

  1. b) Explain the basic concepts of CPU Scheduling

13 a) Explain Readers-Writers problem of Synchronization

(OR)

  1. b) Explain how will you prevent Deadlock?

14 a) Explain Paging with neat diagram

(OR)

  1. b) Explain FIFO Page Replacement algorithm with an example

15 a) Explain any two Directory structure

(OR)

  1. b) Explain about protection in file system

                                                                   SECTION – C

 

ANSWER ANY TWO QUESTIONS:                                                                                                    (2X20=40)

 

16 a) Explain the Structure of an operating system in detail

  1. b) Explain any two Scheduling algorithms

17 a) Explain Semaphore in detail

  1. b) Explain Swapping with neat diagram

18 a) Discuss any two methods of allocating disk space

  1. b) Explain Resource-Allocation graph with a neat diagram

 

Go To Main page

Loyola College M.Sc. Computer Science April 2012 Operating Systems Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

SECOND SEMESTER – APRIL 2012

CS 2811 – OPERATING SYSTEMS

 

 

Date : 17-04-2012             Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

 

PART – A

                                                                                                        

       ANSWER ALL THE QUESTIONS:                                                                              10 X 2 = 20

 

  1. What are the two communication models in process control?
  2. Define the term ‘DLM’.
  3. List out the different types of queues in process scheduling.
  4. Define: Through put.
  5. What is Entry section?
  6. Define Deadlock.
  7. What is Page fault?
  8. What is the usage of limit register?
  9. Define Relative Block number.
  10. What is Disk band width?

 

PART – B

 

       ANSWER ALLTHE QUESTIONS :                                                                                5 X 8 = 40

 

11.   a) Write a brief note on Distributed systems.

(OR)

  1. b) How the system programs are categorized? Explain its functionalities.

 

  1.  a) Write a note on FCFS scheduling algorithm.

(OR)

  1. b) Explain about the Real time scheduling.

 

  1.  a) Briefly discuss about the Deadlock characterization.

(OR)

  1. b) Explain the Reader-Writers problem.

 

 

 

 

  1.  a) How physical address is generated using Hash table? Explain.

(OR)

  1. b) Briefly discuss about Segmentation with diagram.

 

  1.  a) Write a note on file attributes and file operations.

(OR)

  1. b) Explain Scan and C-scan disk scheduling methods with examples.

 

 

 

PART – C

 

 

       ANSWER ANY TWO:                                                                                       2 X 20 = 40

 

 

  1. a) Discuss the System calls and its categories in detail.(10)
  1. b) Explain the SJF and RR scheduling methods in detail.(10)

 

  1. a) Explain the Deadlock prevention method in detail.(10)
  1. b) Give the detail note on Demand paging and page replacement with diagram.(10)

 

  1. a) Discuss the Directory structures with neat diagram.(10)
  1. b) Write a note on the following (i) Multi processor Systems.(5)

(ii) Clustered System.(5)

 

 

Go To Main page

 

 

Loyola College M.C.A. Computer Application Nov 2016 Operating Systems Question Paper PDF Download

Go To Main page

Loyola College B.Sc. Computer Science Nov 2012 Operating Systems Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

B.Sc., DEGREE EXAMINATION – COMPUTER SCIENCE

FIFTH SEMESTER – NOVEMBER 2012

CS 5504 – OPERATING SYSTEMS

 

 

 

Date : 01-11-2012              Dept. No.                                        Max. : 100 Marks

Time : 9.00 – 12.00

 

PART –A

 

ANSWER ALL THE QUESTIONS:                                                                                  (10 X 2 = 20)

 

  1. Name the two modes in which the operating system functions.
  2. What is a system call?
  3. What is process table?
  4. What are the four conditions for deadlock occurrence?
  5. Define swapping
  6. What is the key idea behind segmentation?
  7. What is spooling?
  8. Define interrupt.
  9. What is a directory?
  10. List any four user interface utility program in unix.

PART – B

 

ANSWER ALL THE QUESTIONS:                                                                                  (5 X 8 = 40)

 

  1. a) What is an operating system? Explain.

(OR)

  1. b) Compare and contrast virtual machine and client server model.

 

  1. a) What is critical section? How semaphore helps in the execution of critical section?

(OR)

  1. b) Explain about the deadlock prevention techniques.

 

  1. a) How do operating system manage memory using linked list and bit vector? Explain.

(OR)

  1. b) Discuss in detail about LRU page replacement algorithms.

 

  1. a) Discuss about Direct memory access.

(OR)

  1. b) Explain about terminals.

 

  1. a)Explain in detail unix file system.

(OR)

b)Discuss about the various file allocation techniques.

PART – C

 

Answer any TWO Questions:                                                                                         (2 X 20 = 40)

 

  1. a) Discuss in detail about any two process scheduling algorithms.       (10 marks)
  2. b) Write note on deadlock recovery.                                                                   (10 marks)
  3. a) Discuss in detail about the Banker’s algorithm for deadlock avoidance. (10 marks)
  4. b) What is paging? Discuss about the hardware techniques used to implement

page tables.                                                                                                       (10 marks)

  1. a) Discuss in detail about principles of I/O software. (10 marks)
  2. b) Discuss in detail about Directories and its implementation in various operating

systems.                                                                                                                           (10 marks)

 

 

 

Go To Main Page

© Copyright Entrance India - Engineering and Medical Entrance Exams in India | Website Maintained by Firewall Firm - IT Monteur