Operating-System anna university Question papers

APRIL-2010                                                                                       SAZ4B

                                                             Part-A

1. What is an Operating System?
2. Write any two example Operating System.
3. Define Process.
4. What do you mean by Multiprogramming?
5. What is deadlock?
6. Differentiate between protection and sharing.
7. What do you mean by linking?
8. Define Loading.
9. What is Thrashing?
10. Define Kernal.
11. What do you mean by program threats?
12. Write any two basic concept of file system.

                                                             Part-B

13. Explain Operating System Structure.
14. Explain Monitors.
15. Differentiate between Internal and External Fragmentation.
16. Explain Single Level and Two Level Directory.
17. Differentiate between Magnetic Disk and Tape.
18. Write any one process scheduling algorithm.
19. What are the methods for handling Deadlocks?

                                                            Part-C

20. Explain the process scheduling.
21. Discuss in detail about Semaphores.
22. Explain Non-contiguous memory allocation.
23. Explain Demand Paging and Page Replacement.
24. Write short notes on:

          a)      Kernal I/O subsystem

          b)      Authentication

          c)      Encryption

NOVE-2010                                                                                       SAE5A

                                                     Part-A

1. What is the use of multiprogramming?
2. Define the term “process”.
3. List out the scheduling criteria.
4. Distinguish between preemptive and non-preemptive kernels.
5. Write the syntax of a monitor.
6. What is the goal of compaction?
7. What is the purpose of paging the page tables?
8. What is virtual memory?
9. Define : file , What are file’s attributes?.
10. What is a boot control block?
11. Mention the use of cache.
12. What do you mean by protection?

                                                 Part-B

13. Explain any five operating system services.
14. Describe the differences among short-term, medium-term and long-term scheduling.
15. What is semaphore? Explain its usage.
16. Discuss the Dining-philosophers problem.
17. Explain the contiguous memory management technique.
18. Compare the sequential and direct access methods.
19. Write a short note on authentication algorithm.

                                                  Part-C

20. Explain any two CPU scheduling algorithms with example.
21. Discuss the four necessary conditions for deadlock prevention.
22. Describe the paging memory management scheme.
23. Explain any four page replacement algorithms.
24. Discuss the structure of PC bus.

NOVE-2010                                                                                       SAZ4B

                                                  Part- A

1. What is time sharing?
2. Define operating system.
3. Differentiate between command line and batch interface.
4. Define process.
5. What do you mean by deadlock?
6. What is race condition?
7. Differentiate between logical and physical address space.
8. Define paging.
9. What is virtual memory?
10. Define bus.
11. What is buffering?
12. Define cache.

                                                 Part-B

13. Explain kernel I/O subsystem.
14. Explain CPU schedulers.
15. Explain semaphores.
16. What are the necessary conditions for deadlock characterization?
17. Explain dynamic loading and linking.
18. Differentiate between internal and external fragmentation.
19. Explain thrashing.

                                                   Part-C

20. Discuss in detail about different process scheduling algorithm.
21. Describe the various methods for handling deadlock.
22. Explain contiguous and non-contiguous allocation.
23. Write short notes on file system.
24. Explain the security problem in I/O systems.

APRIL-2011                                                                           SAZ4B

                                                 PART-A

      1.       Define computer-server system.

      2.       What is GUI?

      3.       Define program execution.

      4.       What is signal() semaphore operation?

      5.       Define transaction.

      6.       What is schedule?

      7.       What is meant by segmentation?

      8.       Define swapping.

      9.       Define swap space.

     10.   What is slab allocation?

     11.   Define polling.

     12.   Define interrupt vector.

                                            
                                             PART-B

     13.   Discuss on operating-system operations

     14.   Explain special-purpose systems.

     15.   Describe on characterization.

     16.   Write a note on logical and physical address space.

     17.   Explain FIFO page and LRU page replacements.

     18.   Discuss about free space management and directory structure.

     19.   Explain threads and authentication.

                                            PART-C

      20.   Explain in detail about operating system structure.

      21.   Describe about Deadlock prevention and avoidance.

      22.   Discuss in detail about hardware protection and fragmentation

      23.   Explain about thrashing.

      24.   Describe on I/O scheduling, buffering, caching and error handling.

NOVE-2011                                                                                                   SAE5A

                                             PART-A

          1.       Distinguish tightly and loosely coupled systems.

          2.       What is fault tolerance?

          3.       Define Dispatch latency.

          4.       What is a safe state?

          5.       Define address binding.

          6.       Expand and define TLB.

          7.       Plot the multistep processing of user program.

          8.       Define swapping.

          9.       What is encryption?

         10.   Give the performance of demand paging.

         11.   Define concurrency.

         12.   What are the controls of I/O subsystems?

                                           PART-B

         13.   Explain mainframe systems.

         14.   What do you mean by pthreads?

         15.   Discuss in detail about resource allocation graph.

         16.   Draw the various structure of page table.

         17.   Write a note on file operations, attributes and types.

         18.   Discusses the transformation of I/O to Hardware operations.

         19.   Explain the various methods of implementations of access matrix.

    

                                             PART-C

         20.   Describe any five CPU scheduling algorithms.

         21.   Explain in detail about deadlock avoidance with Banker’s algorithm.

         22.   Differentiate internal fragmentation and external fragmentation with an example.

         23.   Explain any two page replacement algorithms.

         24.   Discuss in detail about secondary storage structures.

NOVE-2011                                                                                       SAZ4B

                                                   PART-A

          1.       What is API?

          2.       Define: System generation.

          3.       List any four process states.

          4.       Define: wait () semaphore.

          5.       What is locking protocol?

          6.       What is deadlock prevention?

          7.       Define: sharing.

          8.       What is segmentation?

          9.       Define: Hit ratio.

         10.   What is Interrupt chaining?

         11.   What is meant by software interrupt?

         12.   Define: STREAMS.

                                                 PART-B

          13.   Explain on threads and CPU schedulers.

          14.   Write a note on ‘virtual machines’.

          15.   Write about Deadlock characterization.

          16.   Explain the dynamic loading and linking.

          17.   Write about demand paying.

          18.   Describe on file system structures and allocation methods.

          19.   Explain on protection and encryption.

                                               PART-C

       20.   Explain the various types of system calls.

       21.   Describe the various methods for deadlocks avoidance.

       22.   Discuss in detail about non-contiguous allocation and hardware protection.

       23.   Describe on page replacement.

       24.   Write about Kernal I/O sub systems.

APRIL-2012                                                                                       SAE5A

                                                 PART-A

       1.       Write the goal of operating system.

       2.       What is known as dispatch latency?

       3.       Name the methods for handling deadlocks.

       4.       Mention the requirements to be satisfied by a solution to the critical section problem.

       5.       Specify any two solutions to the problem of external fragmentation.

       6.       What is paging?

       7.       State any two page-replacement algorithms.

       8.       Name the file attributes.

       9.       What is consistency semantics?

      10.   List the basic hardware elements involved in I/O.

      11.   What are represented using access matrix?

      12.   Compare a buffer with a cache.

                                            PART-B

       13.   Explain the multi processor systems.

       14.   Describe the importance of layered approach.

       15.   Elaborate the readers-writers problem.

       16.   Discuss about monitors.

       17.   Write a note on address binding.

       18.   Describe the file-system structure.

       19.   Discuss the issues with user authentication.

                                         PART-C

       20.   Discuss on interprocess communication.

       21.   Explain the important aspects associated with deadlock avoidance.

       22.   Give an overview of contiguous memory allocation.

       23.   Write a detailed note on thrashing.

       24.   Elaborate the Kernel I/O subsystem.

APRIL-2012                                                                                       SAZ4B

                                       PART-A

       1.       What is an operating system?

       2.       Define Kernel.

       3.       List any Three OS Components.

       4.       List the various process states.

       5.       What is meant by context switch?

       6.       Define Deadlock.

       7.       What do you mean by best fit?

       8.       Define swapping.

       9.       Define Demand Paging.

      10.   What is Virtual Memory?

      11.   List the three Basic functions of hardware clocks and timers.

      12.   What do you mean by Access Right?

                                PART-B

      13.   Explain the process control block.

      14.   How to eliminate deadlocks using resource preemption?

      15.   Discuss in short about Address Binding.

      16.   Explain the Optimal Page Replacement Algorithm.

      17.   Give a note on Direct Memory Access (DMA).

      18.   Explain the various process states with a diagram.

      19.   Explain the methods for handling deadlocks.

                                PART-C

       20.   Discuss in detail about Process Scheduling.

       21.   Write a detail note on deadlock prevention.

       22.   Explain Basic Paging in detail.

       23.   Write a detail note on page replacement?

       24.   Describe in detail about Encryption.

NOVEMBER 2012                                                                                                  51306/SAZ4B

                                                 PART-A

1.     what are privileged Instruction?

2.     Define Kernel?

3.     Why is the operating system viewed as the resourse allocator?

4.     List the various process states?

5.     Define thread?

6.     What are the conditions under which a deadlock situation may arise?

7.     what is the main function of memory management unit(MMU)?

8.     Define Swapping?

9.     List any TWO page replacement algorithm.

10.What is virtual memory?

11.Name the four registers of I/O

12. Define Access Right?

    

                                                 PART-B

  13.Write a short note on Dual Mode Operation?

  14.Describe the Critical Selection Problem.

  15.Write a short on memory allocation.

  16.Explain the optimal page replacement algorithm.

17.Write short on pooling.

18.Explain process control block.

19.How to eliminate deadlocks using resource preemption?

                                                   PART-C

20.Explain  scheduling criteria and any ONE scheduling algorithm.

21.Discuss  in detail note on deadlock prevention.

22.Discuss  in detail about segmentation.

23.Explain  the various file access methods.

24.Describe  in detail about Encryption.

NOVEMBER 2012                                                                                       50416/SAE5A

                                               PART-A

1.       What is an operating system?

2.       Specify the significance of ‘ready queue’.

3.       State the necessary conditions for deadlock states occurs.

4.       Give the advantage of a spin lock.

5.       Mention the use of memory-management unit.

6.       What is segmentation?

7.       Write the importance of optimal page replacement algorithm.

8.       What is thrashing?

9.       What is consistency semantics?

10.  Give any two reasons for buffering.

11.  What is device driver?

12.  Compare: Policy and Mechanism.

                                              PART-B

13.  Describe the distributed system.

14.  What are the components of operating system? Briefly explain.

15.  Discuss about deadlock prevention.

16.  Explain Dining-philosophers problem.

17.  Write a note on dynamic loading and linking.

18.  Discuss about free-space management.

19.  Explain access matrix mechanism.

                                              PART-C

20.  Elaborate any four CPU-scheduling algorithms.

21.  Discuss about the critical-section problems.

22.  Describe the paging memory-management scheme in detail.

23.  Explain the importance of various file access methods.

24.  Describe the threads faced by the computer programs and systems.

APRIL-2013                                                                                  SAE5A

                                          PART-A
1. State any two advantages of multiprocessor systems.
2. Name any two CPU- Scheduling algorithms.
3. What is a binary semaphore?
4. Give any two classic problems of synchronization.
5. Write the idea of overlays.
6. Specify the principles followed in first-fit and best-fit allocation strategies.
7.Mention the significance of FIFO page replacement.
8. List the basic file operations.
9. Write the functions of executable and batch files.
10. What is a buffer?
11. What are worms and viruses?
12. Give the significance of non-maskable interrupt.

                                 PART-B
13. Discuss about mainframe systems.
14. Explain the operating - system services
15. Describe the important aspects in deadlock detection.
16. State and explain the readers - writers problem.
17. Explain the logical and physical-address space.
18. Write a note on Thrashing.
19. Discuss about I/O hardware.

                              PART-C
 20. Discuss process scheduling
 21. Discuss about semaphores.
 22. Elaborate the importance of paging and segmenatation schemes.
 23. Explain the major methods of allocating disk space.
 24. Give an overview of security aspects of systems.

APRIL-2013                                                                 SAZ4B

                                  PART-A
1. What is an operating system?
2. What you mean by a Layered Approach?
3. List any three OS components.
4. What is a process?
5. What is meant by context switch?
6. Define Deadlock.
7. What do you mean by best fit?
8. What is meant by segmentation?
9. Define Demand Paging.
10. What is lazy swapper?
11. List the three basic functions of Hardware clocks and items.
12. Define Stream Cipher.

                              PART-B
13. Write the benefits of a Virtual-Machine.
14. What are the FOUR conditions that a deadlock.
15. Discuss in short about Address Binging.
16. Write a short note on Traxhing.
17. Give a note on Direct Memory Access (DMA).
18. Explain the various process states with a diagram.
19. Explain the methods for handling deadlocks.

                             PART-C

20. Discuss in detail about Process Scheduling.
21. Describe about Recovery from Deadlock.
22. Explain Paging in detail.
23. Write a detail note on Basic Page Replacement.
24. Discuss the Security Problem in detail.

NOVE-2013                                                                   SAE5A
                         PART-A
1. What are the goals of operating systems?
2. What is multiprogramming?
3. Write the states of a process.
4. What is a race condition?
5. Define deadlock.
6. What is dynamic loading?
7. Give the purpose of compaction.
8. Define 50% rule.
9. What is a lazy swapper?
10. Give the solution to thrasing.
11. Differentiate blocking and non blocking I/O.
12. What is access latency?

                        PART-B
13. List and explain operating system services.
14. Explain multithreading models
15. Briefly explain critical section problem.
16. Differentiate External and Internal fragmentation with example.
17. Write a note on Demand Paging.
18. Discuss the concept of Interrupts.
19. Write a note on file management systems.

                       PART-C
20. Explain in detail multiprocessor and distributed systems.
21. Explain the various CPU scheduling algorithms in detail.
22. Explain the deadlock avoidance with Banker's algorithms.
23. Explain in detail the concept of segmentation with a neat diagram.
24. Write notes on access matrix and its implementation.


April-2014                                                                SAE5A

Part - A

1. What is an operating system?
2. Define : Throughput.
3. Write the significance of cooperating processes.
4. Mention the necessary conditions for having deadlock.
5. Give an advantage of a spin lock.
6. What is referned to as overlays?
7. What are internal and external fragmentation?
8. Name any four basic file operations.
9. Write the use of having virtual memory.
10. What is an interrupt?
11. Mention the role of access matrix mechanism.
12. What is meant by encryption?

Part-B

13. Describe the various services of an operating system.
14. Write a note on: Monitors.
15. Explain the readers - writers problem.
16. Discuss the concept of dynamic loading and linking with respect to memory management.
17. Elaborate the issues with thrashing.
18. Explain the approaches adopted for free-space management.
19. Describe the goals and domain of protection.

Part- C

20. Explain any two CPU- scheduling algorithms in detail.
21. Name the methods used for handling deadlocks and elaborate any one.
22. Give a detailed discussion about paging.
23. Compare the methods used for allocating disk space for files.
24. Write a detailed note on threats that are against computer systems and programs.


April- 2016                                                                                       SAZ4B

Part -A

1. What is operating system?
2. What is swapping?
3. What are the two schemes of distributed system?
4. What is paging?
5. Define : semaphore.
6. What is turn around time?
7. What is segmentation?
8. What is deadlock?
9. Define virtual memory?
10. What is thrashing?
11. What do you mean by best fit?
12. What is meant by context switch?

Part - B

13. Write short notes on: Evolution of operating system.
14. Explain interprocess  communication.
15. Explain how count semaphore can be implemented using binary semaphore.
16. Describe how swapping takes place in memory management.
17. What are fragmentation and storage compaction?
18. Describe the functions of file management.
19. Write a note on dick drivers.

Part -C

20. What are the merits and demerits of segmented memory management and paged memory management?Explain.
21. Describe how to detect and avoid the deadlock.
22. discuss in detail about I/O controller.
23. Discuss the file security and protection problems handled by OS.
24. Explain the following scheduling algorithms a) Round - robin b) Shortest - Job -First C) FCFS


APRIL-2016                                                                              SAE5A

Part - A

1. Define: Turn around time.
2. List any two advantages of using virtual machines.
3. What are the different states of a process?
4. Write the significance of critical-section problem.
5.What is meant bu deadlock prevention?
6. What is paging?
7. Write the contents of a segment table.
8. Name any four file types.
9. Give the reason for a page-fault trap.
10. Write the role of protection in a computer system.
11. What are called as viruses in computer usage?
12. Mention the basic hardware elements involved in I/O Systems.

Part -B

13. Explain the key aspects of inter process communication.
14. Describe the methods used for recovery from deadlock.
15. write a note on semaphores.
16. Discuss the concept of dynamic loading and linking with respect with free-space management.
17. Elaborate the issues with free-space management.
18. Compare sequential and direct access file methods.
19. How are user authentication determined? Explain.

Part- C

20. Outline the various components of an operating system.
21. Explain any two classic problem of synchronization.
22. Elaborate the contiguous memory allocation method in detail.
23. Describe the FIFO page replacement algorithm and compare the same with optimal page replacement algorithm.
24. Discuss the access matrix mechanism related to protection.