ANNA UNIVERSITY ME DEGREE OPERATING SYSTEM QUESTION BANK


OPERATING SYSTEM
Question Bank
M.E. (CSE) - Second Semester
UNIT-I
PART A
               
  1. State the purpose and goals of an operating system.
  2. What are system calls?
  3. What are the operating system services?
  4. Define paging.
  5. What is a context switching?
  6. What is the purpose of command interpreter? Why is it usually separate from kernel?
  7. What is a thread?
8.      What is virtual machine architecture? What is the main advantage of this for OS designer and OS user?
  1. Define a process.
  2. What are a safe state and an unsafe state?
  3. How can the system recover from deadlock
  4. Define logical address and physical address.
  5. What is a thread?
  6. Define user threads and kernel threads
  7. Distinguish between light weight process  and heavy weight process. What are the differences between user level threads and kernel supported threads?
PART B

  1. Explain the following CPU scheduling algorithms with suitable example.
                                                              i.      i) SJF    ii) Priority    iii) Round Robin
  1. Discuss in detail about deadlock prevention.
  2. Explain Semaphore in detail. Show the implementation of semaphore with readers-writers problem.
  3. State clearly the four necessary conditions required for deadlocks to occur. Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free.
  4. Explain the concept of cooperating processes. Bring out the significance of this concept through the implementation of a producer -consumer process.
  5. What are the necessary conditions for deadlocks? Explain the methods for deadlock prevention?
  6. Write short notes on
(i)                 Deadlock detection.
(ii)               Deadlock prevention.
UNIT II
PART A
                                                               
  1. When do page faults occur? Describe the actions taken by the operating system when a page fault occurs.
  2. What is paging?
  3. What is the cause of thrashing?
  4. Consider a logical address space of eight pages of 1024 words each, mapped on to 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?
  1. What is demand paging?
  2. What is Belady’s anomaly?
  3. Explain the importance of dynamic loading in memory space utilization.
  4. What is swapping?
  5. What is internal and external fragmentation?
  6. What are base and limit registers?
  7. List out the functions of a dispatcher
  8. What is deterministic modeling?
  9. Define resource reservation?
  10. What is a hashed page table?
  11. Define roll in and roll out.
  12. What is TLB hit and TLB miss?
  13. PART B
                                                               
  1. Explain about page replacement algorithms with examples.
  2. Describe in detail about free space management..
  3. Describe about paging with a neat diagram.
  4. Explain the structure of the paging hardware with translation look-aside buffer (TLB),with suitable diagram. Also give the significance of protection bit.
  5. Discuss in detail about segmented memory management.
6.      Explain about the techniques for structuring the page table.
7.       Explain the basic concepts of segmentation

UNIT III

PART A
                                                               
  1. Mention any four attributes normally contained in a file.
  2. List the two important characteristics of a disk.
  3. What is C-SCAN scheduling?
  4. Why scheduling is needed?
  5. Why rotational latency is usually not considered in disk scheduling?
  6. Mention the types of disk scheduling.
  7. How the user interface is linked to the file system?
  8. State the responsibilities of operating system in connection with the file management.
  9. Mention the advantages and disadvantages of continuous allocation of files.
  10. What is a bit vector?
  11. Define hash table.
  12. What are the various layers of a file system?
  13. What are the design issues in file system
  14. What is compaction?
  15. What is dynamic storage allocation?
PART B
                               
  1. Explain any three schemes for defining the logical structure of a directory with suitable example.
  2. With suitable example, explain the disk scheduling algorithms.
  3. Explain briefly about the various access methods?
  4.  Discuss about the allocation methods?
  5. Write briefly about disk scheduling.
  6. Explain in detail about I/O device management.
  7. Why rotational latency is usually not considered in disk scheduling? How would you modify SSTF, SCAN and C-SCAN to include latency optimization?
UNIT IV
PART A
               
  1. Define distributed file systems.
  2. How swapping is done in distributed systems?
  3. What are the reasons for building distributed systems?
  4. What are hierarchical networks?
  5. List different types of failures that are possible in a distributed system.
  6. What do you mean by fault tolerant system? Give at least two reasons why the fault tolerance is different to implement?
  7. What are RPC’s?
  8. What is dynamic routing?
  9. Define AFS.
  10. What are the two approaches to verify the validity of cached data?
  11. List the primary tasks of a microkernel.
  12. Mention the four “management calls” provided for a thread.
PART B
                                                               
  1. Explain the various design issues in distributed system.
  2. What are the benefits of distributed file system when compared to a file system in a centralized system?
  3.  a) Explain briefly the “threads” in distributed systems.
b) Write a detailed note on distributed OS.
  1. Write short notes on:
               a) Data migration
                     b) Process migration
                     c) Computation migration
     5. Describe about dynamic routing in distributed system.
UNIT V
PART A
  1. What is i-node?
  2. Give the significance of “vfork”system call.
  3. What are pipes?
  4. What is the use of fork and exec system calls?
  5. What are filters?
  6. What is interprocess communication?
  7. What is PCB?
  8. Explain memory management in LINUX
  9. Explain about the process management in Linux
  10. Discuss the design principles of LINUX OS
  11. Under what circumstances filters and shell scripts are used.
  12. What are device drivers?
  13. Define kernel.
  14. List out the components of Linux system.
  15. What is a process model?
PART B
1.       Write in detail about the UNIX file system.
2.      a) What are signals? How are signals handled in UNIX?
3.       b) Write about process control blocks in the UNIX system.
4.      Explain in detail the memory management in UNIX.
5.      Discuss in detail about processes in UNIX.
6.      Explain the file structure in UNIX and the system calls for basic file manipulation.
7.       Explain in detail about file system structure.



ANNA UNIVERSITY ME DEGREE OPERATING SYSTEM QUESTION BANK Reviewed by Rejin Paul on 7:36 AM Rating: 5

Contact Form

Name

Email *

Message *

Powered by Blogger.