Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
15 views5 pages

Os Pyq Analysis

The document provides a comprehensive analysis of the GTU OS PYQ papers, organized by units in accordance with the GTU syllabus. Each unit covers key topics related to Operating Systems, including definitions, comparisons, algorithms, and programming tasks, along with the frequency of questions asked and their respective marks. The analysis serves as a study guide for students preparing for examinations in Operating Systems.

Uploaded by

kavyamishra317
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)
15 views5 pages

Os Pyq Analysis

The document provides a comprehensive analysis of the GTU OS PYQ papers, organized by units in accordance with the GTU syllabus. Each unit covers key topics related to Operating Systems, including definitions, comparisons, algorithms, and programming tasks, along with the frequency of questions asked and their respective marks. The analysis serves as a study guide for students preparing for examinations in Operating Systems.

Uploaded by

kavyamishra317
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/ 5

Perfect — here is the complete analysis in chat, based on all 5 GTU OS PYQ papers you

provided, organized unit-wise as per the GTU syllabus.

Unit 1 – Introduction to Operating System

1. What is Operating System? Explain basic functions of OS.


o Asked: 2 times
o Marks: 3, 3
2. Compare Multiprogramming and Multiprocessing.
o Asked: 2 times
o Marks: 3, 3
3. Explain any three main functions of an Operating System.
o Asked: 1 time
o Marks: 3
4. Describe the features of a distributed operating system.
o Asked: 1 time
o Marks: 4
5. Discuss the variety of task types that the operating system performs.
o Asked: 1 time
o Marks: 7

Unit 2 – Process and Threads Management

1. Explain process and thread. Explain process state diagram.


o Asked: 3 times
o Marks: 7, 7, 7
2. Draw and explain seven state process state transition diagram.
o Asked: 1 time
o Marks: 7
3. What is a process? Explain various fields of Process Control Block.
o Asked: 2 times
o Marks: 7, 7
4. Write a program for process creation using C.
o Asked: 1 time (in lab list)
5. Differentiate user-level and kernel-level thread.
o Asked: 1 time
o Marks: 3
6. Describe long-term, short-term and medium-term scheduling.
o Asked: 1 time
o Marks: 4
7. Define dispatcher. What is its function?
o Asked: 1 time
o Marks: 3

Unit 3 & 4 – Concurrency + IPC

1. Define: Critical Section, Race Condition, Mutual Exclusion.


o Asked: 2 times
o Marks: 3, 3
2. Explain Peterson’s Solution to achieve mutual exclusion.
o Asked: 2 times
o Marks: 7, 7
3. What is Semaphore? Explain producer-consumer using semaphore.
o Asked: 2 times
o Marks: 7, 7
4. Explain Dining Philosopher Problem using semaphore.
o Asked: 2 times
o Marks: 7, 7
5. Explain Readers-Writers Problem.
o Asked: 1 time
o Marks: 7
6. Difference between Mutex and Binary Semaphore.
o Asked: 1 time
o Marks: 3
7. Explain Monitor and how it achieves mutual exclusion.
o Asked: 1 time
o Marks: 4
8. Explain Inter-Process Communication via Shared Memory.
o Asked: 1 time
o Marks: 3

Unit 5 – Deadlock

1. What is Deadlock? List the conditions for deadlock.


o Asked: 2 times
o Marks: 3, 4
2. Explain Banker’s Algorithm with example.
o Asked: 3 times
o Marks: 7, 7, 7
3. Deadlock Prevention vs Avoidance.
o Asked: 2 times
o Marks: 4, 4
4. Explain Deadlock Detection Algorithm with example.
o Asked: 1 time
o Marks: 7
5. Explain Resource Allocation Graph.
o Asked: 1 time
o Marks: 3

Unit 6 – Memory Management

1. What is Virtual Memory? How are virtual addresses converted to physical?


o Asked: 1 time
o Marks: 4
2. Explain Page Replacement Algorithms (FIFO, LRU, Optimal).
o Asked: 2 times
o Marks: 7, 7
3. Explain First Fit, Best Fit, Worst Fit with examples.
o Asked: 2 times
o Marks: 7, 7
4. Explain Paging hardware with TLB.
o Asked: 1 time
o Marks: 7
5. Compare Paging and Fragmentation.
o Asked: 1 time
o Marks: 3
6. What is Thrashing?
o Asked: 1 time
o Marks: 3
7. What is Page Fault? How does OS handle it?
o Asked: 2 times
o Marks: 7, 7

Unit 7 – I/O and Disk Scheduling

1. Explain I/O buffering.


o Asked: 2 times
o Marks: 3, 3
2. Disk Scheduling Algorithms (FCFS, SCAN, C-SCAN, LOOK, etc.).
o Asked: 3 times
o Marks: 7, 7, 7
3. Explain DMA with diagram.
o Asked: 1 time
o Marks: 7
4. Explain RAID levels.
o Asked: 2 times
o Marks: 7, 7

Unit 8 – Security and Protection

1. Define Authentication. How does OS ensure it?


o Asked: 1 time
o Marks: 4
2. Access Control List.
o Asked: 2 times
o Marks: 4, 4
3. Domain of Protection.
o Asked: 1 time
o Marks: 3
4. System Threats and Program Threats.
o Asked: 2 times
o Marks: 4, 4
5. OS Security Design Principles.
o Asked: 1 time
o Marks: 4

Unit 9 – Unix/Linux and Shell

1. Write shell script to display all executable, zero-size files and directories.
o Asked: 1 time
o Marks: 4
2. Shell script to calculate factorial.
o Asked: 1 time
o Marks: 4
3. Shell script for marksheet, prime, Fibonacci, menu, sorting, etc.
o Covered in lab list
4. Explain synchronization in Linux.
o Asked: 1 time
o Marks: 7

Unit 10 – Virtualization

1. What is Virtualization? Benefits?


o Asked: 2 times
o Marks: 3, 7
2. Explain true virtualization with example.
oAsked: 1 time
oMarks: 3
3. Advantages and Disadvantages of Virtual Machines.
o Asked: 1 time
o Marks: 3

Would you now like this full list compiled into a downloadable PDF?

You might also like