Operating System

Model Question Paper

Operating System

Key Features | मुख्य विशेषताएँ

• Bilingual Model Paper | द्विभाषी मॉडल पेपर
• Enough MCQ for Practice | अभ्यास के लिए पर्याप्त MCQ 
• Exam Practice Paper with Mock Tests | मॉक टेस्ट के साथ परीक्षा अभ्यास पत्र
• Latest Syllabus as per NEP | NEP के अनुसार नवीनतम पाठ्यक्रम
• Designed by Experts | विशेषज्ञों द्वारा तैयार किया गया

The given MCQs cover only 10% of the syllabus | दिए गए बहुविकल्पीय प्रश्न केवल 10% पाठ्यक्रम को कवर करते हैं।

To cover 100% of the syllabus with summaries, upgrade to our Advanced Model Paper.| पूरा सिलेबस और सारांश कवर करने के लिए हमारा एडवांस मॉडल पेपर जॉइन करें।  Join Advanced Model Paper

• Program Class: Certificate/ B.SC.		Year: First		Semester: Second
  Subject: Computer Science
  Course Title: Operating System
  Course Learning Outcomes: The purpose of this course is to understand the mechanisms of the Operating Systems like Process Management, Process Synchronization, Memory Management, File System Implementation, Storage Structures used in OS and Protection Principles.
  Credits: 4			Core Compulsory
  Max. Marks: –25+75			Min. Passing Marks: 33
  Unit	Topics
  I	Operating System: Operating System Structure, Simple Batch, Multi-programmed, Time shared, Personal Computer, Parallel, Distributed Systems, Real- Time Systems, System components, Operating system services, System calls. Process Management: Process Scheduling, Pre-emptive and non-pre-emptive Algorithms (FCFS, SJFS, RRS, Priority), Interprocess Communication, Process Synchronization, Critical Section Problem, Peterson’s Solution, Semaphores, Synchronization.
  II	Process Synchronization: Concurrent Processes, Race condition, Shared data, Critical section problem, Mutual exclusion, Progress, Bounded Waiting, software solution, Busy form of waiting, lock and unlock primitives, Peterson’s solution, Synchronization: Semaphores, Monitors, Reader Writer Problem, Producer Consumer Problem, Dining Philosopher Problem.
  III	Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention (Mutual Exclusion, Hold and Wait, No pre-emption, Circular Wait), Deadlock Avoidance (Safe state, unsafe state, Resource allocation graph Algorithm, Banker’s Algorithm) and Detection, Recovery from Deadlock (Wait- for- graph).
  IV	Memory management and Allocation: Hierarchy of memory types, Cache memory Types: Associative, direct mapped, set associative memory. Contiguous and Non- Contiguous allocation, Swapping, Fragmentation, Virtual Memory: Demand Paging, Page Replacement Algorithms: FIFO, Optimal, LRU, LFU, MFU, Thrashing.
  V	File System Interface and Operations: File(s) Attributes, Operations, Types, Structure, Access Methods: Sequential, Direct access, Index, File System Structure, Allocation methods: Contiguous Allocation, Linked Allocation, Indexed Allocation, Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK.