Official Bihar Engineering University examination question papers, marks distribution, and questions transcript. Available exam sessions: 2025, 2024, 2023, 2022, 2013.
Open BEU Connect Android app to solve any numerical or derive formulas step by step.
No paper transcript available.
Official BEU curriculum units & topics for this examination subject.
Unit 1.0: Introduction
Concept of Operating Systems • Generations of Operating systems • Types of Operating Systems • OS Services, System Calls • Structure of an OS: Layered, Monolithic, Microkernel • Concept of Virtual Machine • Case study on UNIX and WINDOWS Operating System
Unit 2.0: Processes
Definition, Process Relationship • Different states of a Process • Process State transitions • Process Control Block (PCB), Context switching • Thread: Definition, Various states • Benefits of threads, Types of threads • Concept of multithreads • Process Scheduling: Foundation and Scheduling objectives • Types of Schedulers • Scheduling criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time • Scheduling algorithms: Pre-emptive and Non pre-emptive, FCFS, SJF, RR • Multiprocessor scheduling • Real Time scheduling: RM and EDF
Unit 3.0: Inter-process Communication
Critical Section, Race Conditions • Mutual Exclusion • Hardware Solution, Strict Alternation, Peterson's Solution • The Producer - Consumer Problem • Semaphores, Event Counters, Monitors • Message Passing, Shared Memory • Classical IPC Problems: Reader's & Writer Problem, Dining Philosopher Problem etc.
Unit 4.0: Deadlocks
Definition • Necessary and sufficient conditions for Deadlock • Deadlock Prevention • Deadlock Avoidance: Banker's algorithm • Deadlock detection and Recovery
Unit 5.0: Memory Management
Basic concept, Logical and Physical address map • Memory allocation: Contiguous Memory allocation • Fixed and variable partition • Internal and External fragmentation and Compaction • Paging and Segmentation: Principle of operation • Page allocation, Hardware support for paging • Protection and sharing • Advantages and Disadvantages of paging and segmentation • Virtual Memory: Basics of Virtual Memory • Hardware and control structures • Locality of reference, Page fault, Working Set, Dirty page/Dirty bit • Demand paging • Page Replacement algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and Least Recently used (LRU)