SUBJECT
Operating system( 22516)
Name of chapter
Chapter No. Marks
1 Overview of operating system 08
2 Services and components of operating system 10
3 Process management 14
4 CPU scheduling and algorithms 14
5 Memory management 14
6 File management 10
Total Marks :- 70
Syllabus:-
Unit Course Outcome
Name of the Unit
No. (CO)
1 Overview of operating system CO-516.1
2 Services and components of operating system CO-516.2
3 Process management CO-516.3
Course Outcome
Q.1 Attempt any FOUR 4*2=8Marks (CO)
a) Overview of operating system CO-516.1
b) Services and components of operating system CO-516.2
c)
Process management CO-516.3
d)
Overview of operating system CO-516.1
e) Services and components of operating system CO-516.2
f) Process management CO-516.3
Q.2 Attempt any TWO 3*4=12Marks
a) Overview of operating system CO-516.1
b) Services and components of operating system CO-516.2
c)
Process management CO-516.3
d)
Process management CO-516.3
Syllabus:-
Course Outcome
Unit Name of the Unit (CO)
No.
3 CPU scheduling and algorithms CO-516.4
4 Memory management CO-516.5
5 File management CO-516.6
Course Outcome
Q.1 Attempt any FOUR 4*2=8Marks (CO)
a) CPU scheduling and algorithms (CO-516.4)
b) CPU scheduling and algorithms (CO-516.4)
c) Memory management (CO-516.5)
d) Memory management (CO-516.5)
e) File management (CO-516.6)
f) File management (CO-516.6)
Q.2 Attempt any TWO 3*4=12Marks
a) CPU scheduling and algorithms (CO-516.4)
b) CPU scheduling and algorithms (CO-516.4)
c) Memory management (CO-516.5)
(CO-516.6)
d) File management
COURSE: Operating system (22516)
[Link] Course Outcome
CO-516.01 Install operating system and configure it.
CO-516.02 Use operating system tools to perform various functions.
CO-516.03 Execute process commands for performing process management operations.
Apply scheduling algorithms to calculate turnaround time and average waiting
CO-516.04
time.
CO-516.05 Calculate efficiency of different memory management techniques.
CO-516.06 Apply file management techniques.
UNIT-1 . OVERVIEW OF OPERATING SYSTEM
(TOTAL MARKS =08)
Q1. Define operating system.
Q2. Explain the need of operating system
Q3. Explain different components of operating system
Q4. State different operations of operating system.
Q5. Explain resource management of operating system.
Q6. Explain batch operating system.
Q7. Explain multiprogrammed operating system.
Q8 Explain time shared operating system.
Q9 Explain multiprocessing operating system.
Q10. Explain distributed operating system.
Q11. Explain network operating system.
Q12. Explain architecture of operating
sytem. Q13 Explain history of UNIX OS.
Q14 Explain features of UNIX OS.
Q15 Explain features of LINUX OS.
Q16 Explain features of WINDOWS OS.
Q17 Explain components of LINUX OS.
Q18 Compare MSDOS AND WINDOWS
Q19 Compare GUI and CUI.
Q20 How linux is more advantageous than windows?
UNIT- 2. SERVICES AND COMPONENTS OF OPERATING SYSTEM
(TOTAL MARKS =10)
[Link] in brief provided by operating system.
Q2. Define system call. Explain its different types.
Q3. Explain in short process management component of operating system.
Q4. Explain in short main memory management component of operating system.
Q5. Explain in short storage management component of operating system.
Q6. Explain in short file management component of operating system.
Q7. Explain in short I/O management component of operating system.
Q8. Explain in short secondary storage management component of operating system.
Q9. Explain the use of operating system tools.
Q10. Write a note on task scheduler.
Q11. Explain the use of password authentication in OS.
Q12. Explain the role of administration in security of OS.
Q13. Explain the device drivers and device files.
Q14. What are the different file permission types?
Q15. Explain the concept of performance monitor.
UNIT- 3. PROCESS MANAGEMENT
(TOTAL MARKS =14)
Q1. Define process.
Q2. Explain process state diagram.
Q3. Explain PCB in detail.
Q4. Enlist different types of queues.
Q5. Compare long term, medium term and short term scheduling.
Q6. Explain context switch..
Q7. Explain inter process communication.
Q8. Explain how shared memory is used for inter process communication.
Q9. Explain how message passing system is used for inter process communication.
Q10. Define thread. Give its advantages.
Q11 Compare process and thread.
Q 12 Explain user level and kernel level thread .
Q 13 Define multithreading
Q 14 Explain different types of multithreading models.
Q15 Explain the use of following commands
Ps,wait,sleep,kill,exit.
UNIT- 4 CPU SCHEDULING AND ALGORITHMS
(TOTAL MARKS =14)
Q1. Explain the objective of scheduling.
Q2. Define CPU and I/O burst cycle.
Q3. Compare preemptive and non-preemptive scheduling.
Q4. Explain different criteria for cpu scheduling.
Q5. Explain FCFS with example.
Q6. Explain SJF with example.
Q7. Explain Priority scheduling algorithm with example.
Q8. Explain Round robin scheduling algorithm with example.
Q9. Explain multilevel queue scheduling.
Q10. Explain deadlock with system call.
Q11. Explain necessary condition for deadlock.
Q12. Explain deadlock prevention in detail.
Q13. Explain deadlock avoidance.
Q14 Explain bankers algorithm with all steps.
UNIT-5.
MEMORY MANAGEMENT (TOTAL MARKS =14)
Q1. Explaining multiprogramming with fixed and variable partition techniques.
Q2. Explain contiguous allocation of memory.
Q3. Explain internal and external fragmentation.
Q4. Explain process of compaction with the example.
Q5. Explain different free space management technique.
Q6. Describe bit map and linked list free space management technique.
Q7. Explain virtual memory in detail.
Q8. Explain paging concept.
Q9. Explain segmentation with example.
Q10. How demand paging is performed?
Q11. Define page fault.
Q12. Write an algorithm to for FIFO page replacement algorithm with example.
Q13. Write an algorithm to for LRU page replacement algorithm with example.
Q14. Write an algorithm to for OPTIMAL page replacement algorithm with example.
UNIT-06.
FILE MANAGEMENT (TOTAL MARKS =10)
Q1. Explain file concept in operating system
Q2. Explain file attributes.
Q3 Explain file access methods.
Q4 Explain linked allocation of files with its advantages.
Q5 Explain indexed allocation of files with advantages and disadvantages.
Q6 Describe different schemes for defining the logical structure of directory.
Q7 Explain physical structure of hard disk.
Q8 Explain logical structure of hard disk.
Q9 Explain RAID structure of disk.
