0% found this document useful (0 votes)
83 views3 pages

Os Imp Questions

This is my project

Uploaded by

krishnamsk38
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
83 views3 pages

Os Imp Questions

This is my project

Uploaded by

krishnamsk38
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

OPERATING SYSTEM

IMPORTANT QUETIONS

unit -1 (shorts):

1. List the services of operating system .


2. Define Operating system with example.
3. List any five types of operating system.
4. List any three goals of operating system.
5. write a short note on distributed operating system
6. Define what is buffering ,
7. List any 6 componets of operating system.
8. List different types of system calls .
9. What is spooling.
10. Define system call with example.

Essays:

1. explain the system call sequence with the help of a diagram


2. explain A)Multi-processor system b)time-sharing os
3. explain the components of an os in details
4. explain spooling and buffering with neat sketch
5. explain multi-programming and time-sharing
6. explain about OS services

Unit-2 (Shorts):

1. What is queuing diagram.


2. what are short,long and medium term scheduling.
3. Draw the process state diagram.
4. What are the scheduling criteria for CPU scheduling algorithms.
5. a)define process.
b)what are the diffent states of a process
6. when is process terminated.
7. distinguish between preemptive and non preemtive scheduling
8. what is process control block. Draw its structure
9. List the advantages of round robin scheduling.
10. Write any three difference between process and thread
11. what do you mean by process management
12. what is requential process
13. Thread and multithreading models

Essays:

1. expalin the priority scheduling algorithm with an example


2. explain multi-level queue scheduling techniques
3. explain multi-level queue feedback scheduling algorithm
4. explain the working of long term, short term ,medium term schedulers
5. explain the process creation and termination
6. explain about round robin CPU scheduling algorithm with an example
7. explain about shortest job first scheduling algorithm
8. explain process state diagram
9. explain FCFC CPU scheduling algorithm with an example.
10. Write about the scheduling criteria

Unit -3 (Shorts):

1. what three issues must be considered in the case pre-emption


2. List the various techniques of dead lock prevention.
3. define semaphore
4. define semaphore. List different types of semaphore
5. What is a thread.
6. what is semaphore
7. What is a circular wait in dead lock
8. define dead lock
9. List the inter process communication methods
Essays:

1. exaplain all the strategies involved in deadlock detection and how it is recovered
2. expalin how deadlock can be avoided and detected
3. state the necessary conditions for arising deadlock
4. write about deadlock prevention
5. explain the conditions that must satisfy the occurrence of deadlock
6. explain the bankers algorithm for deadlock avoidance in detailed

Unit -4 (Shorts):

1. List the advantages and disadvantages of fixed partitioning


2. writre any differences between external and internal fragmentation.
3. Define term overlay.
4. what is the difference between paging and demand paging
5. Define swapping.
6. Difference between paging and segmentation.
7. what is working set.
8. what is thrashing.
9. what is fragmentation.
10. 1what is single partition allocation
11. give the need for page replacement.
12. .define virtual memory.
13. what is storage hierarchy.
14. what is memory management

Essays:

1. expalin about segmentation


2. explain the paging concept in details
3. expalin about multiple partition allocation
4. explain segmentation scheme for memory management give the segmentation hardware
5. describe FIFO page replacement algorithm with an example
6. expalin about demand paging
7. explain any two page replacement algorithms with an example
8. explain about address binding,dynamic linking ,dynamic loading and overlays
9. explain memory hierarchy in detail

Unit-5 (Shorts):

1. list ant six disk performance characterstics.


2. List any three operations on directory structure.
3. List various allocation methods.
4. Define terms seek time and latency time.
5. What is acyclice directory structure.
6. What is disk structure.
7. Define indexed allocation method.
8. Write about file management.
9. What are the ways to protect files on a single user system.
10. What is the need for secondary storage?
11. What is the need of file protection?
12. List various file allocation methods.
13. Write about direct access method.

Essays:

1. explain disk allocation methods


2. list and explain any five file operations
3. list any five functions of file management system
4. explain how files can be protected in detail with an example
5. explain free space management in details
6. list and explain disk scheduling algorithms(fifo,sstf,scan,cscan)
7. explain about directory structure

You might also like