Operating system question paper

  1. 50 Operating System MCQs with Answers
  2. OS Computer Science Engineering B
  3. Department of Computer Science and Technology: Past exam papers: Operating Systems
  4. OS Computer Science Engineering DIPLOMA 5th
  5. Operating system past question paper
  6. Operating Systems Notes PDF, Syllabus [2021] B Tech


Download: Operating system question paper
Size: 69.9 MB

50 Operating System MCQs with Answers

Consider the following snapshot of a system running n processes. Process i is holding Xi instances of a resource R, 1 <= i <= n. currently, all instances of R are occupied. Further, for all i, process i has placed a request for an additional Yi instances while holding the Xi instances it already has. There are exactly two processes p and q such that Yp = Yq = 0. Which one of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock? Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlockfree order of invoking the P operations by the processes? (GATE CS 2013) Option A can cause deadlock. Imagine a situation process X has acquired a, process Y has acquired b and process Z has acquired c and d. There is circular wait now. Option C can also cause deadlock. Imagine a situation process X has acquired b, process Y has acquired c and process Z has acquired a. There is circular wait now. Option D...

OS Computer Science Engineering B

Our website provides solved previous year question paper for Operating system from 2005 to 2022. Doing preparation from the previous year question paper helps you to get good marks in exams. From our OS question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand. 1. Introduction to Operating system, Role of Operating System as resource manager, function of kernel and shell, operating system structures, views of an operating system. [5] 2. Process management: CPU scheduling, Scheduling Algorithms, PCB, Process synchronization, Deadlocks, Prevention, Detection and Recovery [5] 3. Memory Management: Overlays, Memory management policies, Fragmentation and its types, Partitioned memory managements, Paging, Segmentation, Need of Virtual memories, Page replacement Algorithms, Concept of Thrashing [8] 4. Device Management: I/O system and secondary storage structure, Device management policies, Role of I/O traffic controller, scheduler [5] 5. File Management: File System Architecture, Layered Architecture, Physical and Logical File Systems, Protection and Security: [5] 6. Brief study to multiprocessor and distributed operating systems. [4] 7. Case Studies: LINUX / UNIX Operating System and Windows based operating systems. Recent trends in operating system.

Department of Computer Science and Technology: Past exam papers: Operating Systems

Past exam papers: Operating Systems Solution notes are available for many past questions to local users. They were produced by question setters, primarily for the benefit of the examiners. These are not model answers: there may be many other good ways of answering a given exam question! The solution notes for the most recent two year’s worth of examinations (with exceptions for 2020 and 2021) are held back by the department and only made available to supervisors and other teaching staff (marked with 🔒). Supervisors are instructed not to release hardcopy or electronic versions of these notes to students, although they may be shown to students during supervisions when helpful. Access to any solution notes here requires a Raven login, i.e. they are not public. Making corrections: Question setters who want to amend solution notes can find the source files under /anfs/www/tripospapers/ and may email updated files to pagemaster. • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • 🔒 = access to solution notes is

OS Computer Science Engineering DIPLOMA 5th

Our website provides solved previous year question paper for Operating system from 2009 to 2022. Doing preparation from the previous year question paper helps you to get good marks in exams. From our OS question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

Operating system past question paper

Operating system all previous/ past question papers – Operating system – Operating system Sessional I in 2020 Q#1: Differentiate and explain the followings, (a) Multicore system and single core system (b) Harmony OS vs Google Android (c) Process and Control Block (PCB) (d) Direct Memory Access and Indirect Memory Access Q #2: How process changes its states? Explain in detail and draw state transition diagram. (4) Q#4: How the Degree of multiprogramming is controlled in Time Sharing system? Q# 5: Suppose there are three processes, P₁, P2 and Ps. CPU time slice 80ms, Short Term Scheduler (STS) 10ms, compute the CPU time in percentage used in processing User Jobs/process. Operating system Sessional II in 2020 Q#1: (a) Apply Shortest Job First (SJF) in Pre-emptive and Non-Pre-emptive Modes and compute waiting time for each of the process and average waiting time of the system.(5+5) (b) Write pseudo-code of SJF in Non-Preemptive mode.(5) Q #2: Apply Round Robin CPU algorithm on following processes with Quantum-3ms and Quantum-7ms while Context Switch time is 5 micro seconds.(5+5) Compute the CPU utilization time for user’s processes and system processes in both cases and identify which Quanta time is better in the above situation Operating system Final paper in 2020 Q#1: Apply Shortest Job First (SJF) in Pre-emptive and Non Pre-emptive Modes and compute waiting time for each of the process and average waiting time of the system. (5+5) Q#2: Write down short notes on the followin...

Operating Systems Notes PDF, Syllabus [2021] B Tech

• Home • Best Courses • Google Professional Certificates • Human Resource • Human Resource • Human Resource Management • Human Resource Planning • Organizational Culture • Organization Development • Organizational Behavior • Learning Deals • All Blog Post • Management • Business Statistics • Lean Six Sigma • Management • Operation Management • Research Methodology • Operations Research • Procurement Management • Production Management • Supply Chain • Strategic Management • Marketing • Economics • Brand Management • Business • Business Communication • Business Law • Entrepreneurship • Consumer Behaviour • Marketing Essentials • Marketing Management • Sales Management • Shark Tank India • Business Tech • Project Management • Business Analytics • Management Information System • Enterprise Resource Planning • Technologies • Cloud Computing • About • About Us • Cookie Policy • DMCA Policy • Disclaimer • Contact Us • Toggle website search Introduction: What is an Operating System, Simple Batch Systems, Multi-programmed Batches systems, Time-Sharing Systems, Personal-computer systems, Parallel systems, Distributed Systems, Real-Time Systems, OS – A Resource Manager. Memory Organization & Management: Memory Organization, Memory Hierarchy, Memory Management Strategies, Contiguous versus non- Contiguous memory allocation, Partition Management Techniques, Logical versus Physical Address space, swapping, Paging, Segmentation, Segmentation with Paging Virtual Memory: Demand Paging, Pag...