Study like there’s no tomorrow because if you keep putting off your studies for tomorrow, you’ll probably be too late.
--Your friends at LectureNotes

Previous Year Exam Questions for Operating Systems - OS of 2018 - bput by Bput Toppers

  • Operating Systems - OS
  • 2018
  • PYQ
  • Biju Patnaik University of Technology Rourkela Odisha - BPUT
  • Electrical and Electronics Engineering
  • B.Tech
  • 313 Offline Downloads
  • Uploaded 1 year ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

Registration No : Total Number of Pages : 02 B.Tech. PCCS4304 6th Semester Back Examination 2017-18 OPERATING SYSTEM BRANCH : AEIE, BIOMED, CSE, ECE, EEE, EIE, ELECTRICAL, ETC, FASHION, FAT, IEE, IT, ITE, METTA, MME Time : 3 Hours Max Marks : 70 Q.CODE : C538 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Answer all parts of a question at a place. Q1 a) b) c) d) e) f) g) h) i) j) Q2 a) b) Q3 a) Answer the following questions : What are the main advantages of multiprogramming? What is Throughput, Turnaround time, Waiting time and Response time? Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free. Differentiate between a page and a segment Differentiate between internal and external fragmentation. What is a Process control block? Explain all its components. What is the difference between synchronization and mutual exclusion? What is swapping and what is its purpose. Differentiate between Logical and Physical file system. What do you mean by logical address and physical address? (2 x 10) Distinguish between multiprogramming and multiprocessing. What is the key motivation for the development of each? Differentiate between long-term scheduler and short-term scheduler. What is the purpose of medium-term scheduler? (5) Assume, we have the workload as shown below. All 5 processes arrive at time 0, in the order given. The length of the CPU burst time is given in milliseconds (5) Process : P1 Burst Time : 10 b) Q4 P2 29 P3 3 P4 7 P5 12 Considering the FCFS, SJF and RR (time quantum=10 ms) scheduling algorithms, which algorithm would give the minimum average waiting time. State the Producer-Consumer Problem. Give a solution to the problem using Semaphore. Consider the following snapshot of a system : P0 P1 P2 P3 P4 Allocation A B C 0 1 0 2 0 0 3 0 2 2 1 1 0 0 2 MAX A B 7 5 3 2 9 0 2 2 4 3 C 3 2 2 2 3 (5) Available A B C 3 3 2 (5) (10)

Text from page-2

Answer the following questions using the Banker’s algorithm (a) What is the content of the matrix Need? (b) Is the system in safe state? If so, what is the safe sequence? (c) If a request from a process P1 arrives for (1, 0, 2) can the request be granted immediately? Q5 a) b) Q6 a) b) Q7 a) b) Q8 a) b) c) d) Give an example of a simple resource deadlock involving three processes and three resources. Draw the appropriate resource allocation graph. Explain the principles of segmentation with examples. (5) When do page fault occurs? Describe the actions taken by the operating system, when a page fault occurs? Given the memory partitions of 600K, 200K, 250K, 500K (in order) how would each of the first-fit, best-fit and worst-fit algorithms place processes of 128K, 581K, 411K, 221K(in order)? Which algorithm makes the efficient use of memory? (5) Suppose that the head of a moving hard disk with 200 tracks, numbered 0 to 199, is currently serving a request at track 143 and has just finished a request at track 125. The queue of requests is kept in the FIFO order- 86, 147, 91, 177, 94, 150,102, 175, 130. What is the total number of head movements needed to satisfy these requests for the following disk-scheduling algorithms? (a) FCFS Scheduling (b) SSTF Scheduling (c) SCAN Scheduling Describe the need of device management. Explain techniques used for managing and allocating devices. (5) Answer any TWO : Disk Structure RAID Structure Thrashing I-Nodes (5) (5) (5) (5 x 2)

Lecture Notes