0% found this document useful (0 votes)
78 views

OSY - (22516) AssignmentQuestions

Uploaded by

harshdpatil677
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
78 views

OSY - (22516) AssignmentQuestions

Uploaded by

harshdpatil677
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

(OSY - 22516) TYCO 2024-25

Assignment Questions
Unit 1 – Overview of Operating System [8M]
1. Define real time operating system. List its any four applications of it. 2M 19 – W
2. Differentiate between Multi programmed and Multitasking operating
system (Any two points) 22 – S
3. State any two features of Linux. 23 – S
4. Difference between Time sharing system and Real time system. (any 2 points) 23 – S
5. Enlist types of operating system. Explain multiprogramming OS in detail. 4M 19 – W
6. Write Unix command for following: 19 – W
i) Create a folder OSY.
ii) Create a file FIRST in OSY folder.
iii) List/display all files and directories.
iv) Write command to clear the screen.
7. Explain Time sharing O.S. 22 – S
8. Compare between command line and Graphical user interface. (Any four points) 22 – S
9. Describe multiprocessor OS with it's advantages. (any two) 23 – S
10. Explain real time OS. Explain it's types. 23 – S

Unit 2 – Services & Components of Operating System [10M]


1. List any 4 services provided by OS. 2M 19 – W, 22 – S
2. State any four services of operating system. 22 - W
3. List components of OS. Explain process management in detail. 4M 19 – W
4. What is purpose of system call? State two system calls with their functions. 19 – W
5. Write any four systems call related to file management. 22 – S
6. Explain different types of system calls. 23 – S
7. Explain different components of operating system. 23 – S
8. Enlist the operating system tools. Explain any two in detail. 6M 19 – W
9. Write two uses of following O.S. tools 22 – S
(i) Device Management
(ii) Performance monitor
(iii) Task Scheduler
10. Write two uses of following operating system tools. 23 – S
(i) Security policy
(ii) User Management
(iii) Task scheduler

Legends: M = Marks, S = Summer, W = Winter


(OSY - 22516) TYCO 2024-25

Unit 3 – Process Management [14M]


1. Draw process state diagram. 2M 19 – W
2. Write syntax for following commands: i) Sleep ii) Kill 19 – W, 22 – S
3. Define CPU and I/O burst cycle. 22 – S
4. With neat diagram explain inter process communication model. 4M 19 – W
5. Describe I/O Burst and CPU Burst cycle with neat diagram. 19 – W
6. Explain ‘PS’ command with any four options. 19 – W
7. Explain PCB with diagram. 19 – W
8. Explain shared memory model of Inter process communication (IPC) 22 – S
9. Draw and explain process state diagram. 22 – S, 23 – S
10. Draw and explain process control block in detail. 23 – S
11. Explain multithreading model in detail. 6M 19 – W
12. Writer the outputs of following commands 22 – S
(i) Wait 2385018
(ii) Sleep 09
(iii) PS -u Asha
13. Explain the working of inter-process communication considering
i) Shared memory
ii) Message passing
14. Consider the four processes P1, P2, P3 and P4 with length of CPO Burst time.
Find out Avg waiting time and Avg turn around time for the following Algorithms.
(i) FCFS (ii) RR (Slice-4ms) (iii) SJF

Unit 4 – CPU Scheduling & Algorithms [14M]


1. Explain any four scheduling criteria. 2M 19 – W
2. Write the difference between pre-emptive and non-preemptive scheduling. 23 – S
3. Explain deadlock? What are necessary conditions for deadlock? 4M 19 – W, 23 – S (for 2M)
4. State and describe types of scheduler. 19 – W, 23 – S
5. Explain Round Robin algorithm with suitable example. 19 – W
6. Describe different scheduling criteria. 22 – S, 23 – S
7. Describe conditions for deadlock prevention. 22 – S
8. Compare between Long term and short-term scheduler. (Any four points) 22 – S

Legends: M = Marks, S = Summer, W = Winter


(OSY - 22516) TYCO 2024-25

9. Solve given problem by using SJF and FCFS scheduling algorithm using Gantt chart.
Calculate the average waiting time for each algorithm. 22 – S

Process Burst Time (in ms)


P1 9
P2 7
P3 3
P4 7

10. Explain LRU page replacement algorithm for following reference string. 6M
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault. 19 – W
11. The jobs are scheduled for execution as follows: 19 – W

i) SJF
ii) FCFS Also find average waiting time using Gantt chart.
12. Given a page reference string with three (03) page frames. Calculate the page
faults with ‘Optimal’ and ‘LRU’ page replacement algorithm respectively.
7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 22 – S
13. Solve given problem by using
(i) Pre-emptive SJF
(ii) Round Robin (Time Slice = 3 ms)
Process A. T. B. T. (in ms)
P11 0 8
P12 1 4
P13 2 9
P14 3 5

Calculate average waiting time using Gantt Chart. 22 – S


14. With neat diagram explain multilevel queue scheduling. 23 – S

Legends: M = Marks, S = Summer, W = Winter


(OSY - 22516) TYCO 2024-25

Unit 5 – Memory Management [14M]


1. Define Virtual Memory & Paging. 2 M 19 – W, 23 – S
2. Explain partitioning and its types. 4 M 19 - W
3. Explain fixed size memory partitioning. 22 – S
4. Describe free space management technique. (Any two) 22 – S
5. Define fragmentation. Explain Internal and External Fragmentation. 23 – S
6. Differentiate between paging and segmentation (any 4 points) 22 – S (for 2M), 23 – S
7. Explain fixed and variable memory management. 23 – S
8. List free space management techniques? Describe any one in detail. 6 M 19 – W
9. Consider the following memory map and assume a new process P4 comes
with memory requirements of 6 KB. Locate (Draw) this process in memory using. 22 – S
i) First fit O.S.
ii) Best Fit P1
iii) Worst Fit <FREE> 12KB
P2
Memory
<FREE> 19KB
P3
<FREE> 7KB

10. For the page reference string [7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1] 23 – S


Calculate the page faults applying.
(i) Optimal (ii) LRU (iii) FiFo page
Replacement algorithms for a memory with three frames.

Unit 6 – File Management [10M]


1. Describe any four file attributes 2M 19 – W, 22 – S, 23 – S
2. Describe sequential and direct access method. 4M 19 – W
3. Explain linked file allocation method. 22 – S, 23 – W
4. Explain two level directory structure with suitable diagram. 23 – S
5. Enlist different file allocation methods? Explain contiguous 6M
allocation method in detail. 19 – W, 23 – S
6. Construct and explain directory structure of a file system in terms
of single level, two level and tree structure. 22 – S, 23 – W

Legends: M = Marks, S = Summer, W = Winter

You might also like