×
Start where you are. Use what you have. Do what you can.
--Your friends at LectureNotes
Close

Previous Year Exam Questions of Operating Systems of bput - OS by Verified Writer

  • Operating Systems - OS
  • 2017
  • PYQ
  • Biju Patnaik University of Technology Rourkela Odisha - BPUT
  • Computer Science Engineering
  • B.Tech
  • 5358 Views
  • 142 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. PCS5G001 5th Semester Regular Examination 2017-18 Operating Systems BRANCH : CSE Time: 3 Hours Max Marks: 100 Q.CODE: B305 Answer Question No.1 and 2 which are compulsory and any four from the rest. The figures in the right hand margin indicate marks. Q1 a) b) c) d) e) f) g) h) i) j) Q2 a) b) c) d) e) f) g) h) i) Answer the following questions: The interval from the time submission of a process to the time of completion is termed as _______. (a). Throughput (b). Turnaround Time (c). Waiting Time (d). Response Time Each process in a system has a segment of code, called _______, in which the process may be changing common variables, updating a table, writing a file. (a). Critical section (b). semaphore (c). race condition (d). segment table A solution to the problem of indefinite blockage of low-priority process is _______. (a). Priority Scheduling (b). Paging (c). aging (d). None Of These Which page replacement algorithm is not practically possible? (a). FIFO (b). LRU (c). Optimal (d). None Of These The hole created within a block of memory is fragmentation. (a). External (b). Internal (c). Immediate (d). None of These Which section is shared by a Process and its thread? (a). stack (b). register (c). code (d). both a and b. Which scheduler is responsible for selecting a good process mix of I/O-bound and CPU-bound? (a). short-term (b). long-term (c). medium-term (d). average-term Which one mapthe logical address to physical address? (a). processor (b). MMU (c). memory address register (d). none of these Which makes possible transfer of data from and to the memory without help of main CPU? (a). Bus (b). DMA (c). IDE (d). none of these Which of the scheme describe that the IO device are accessed by generating a memory address? (a). Shared memory (b). IPC (c). Memory-Mapped IO (d). IO-Mapped Memor (2x10) Answer the following questions: What is the difference between binary and counting semaphores? What is the purpose of medium-term-scheduler and short-term-scheduler? What are the basic functions of an operating system? What is belady’sanamoly ? Define Thrasing. A computer has 6 tape drives among n programs. Each need two tape drives. For a system to be deadlock free what is maximum value of n What is spooling? What is the difference between multiprogramming and multitasking? What is a process? What is a PCB? (2×10)

Text from page-2

Q3 j) What is the advantage of using threads compared to processes? a) Discuss the Multilevel feedback Scheduling and write its advantages. For the three processes P1,P2,P3 with CPU burst time of 30 ms, 6 ms, and 8 ms respectively, find the average TAT, average waiting time and average ressopnse time with time quantum 5ms.Assume all the jobs are available at the same time. Write about Segmentation with example. Discuss basic difference between paging and Segmentation. (10) What is deadlock? What are the necessary and sufficient conditions for deadlock to occur in a system? For the following data Allocation Max P0 010 753 P1 200 322 P2 302 902 P3 211 2 22 P4 002 433 Is the system safe? If so find the safety sequence. What do you mean by inter-process communication mechanism? Describe different models associated with IPC? (10) Write about Fragmentation, types of Fragmentation and their solution. Given memory partitions of 100k, 500k, 200k, 300k and 600k (in order),how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212k, 417k, 112k and 426k (in order)? Which algorithm makes the most efficient use of memory? If hit ratio to a TLB is 80% and it takes 15 ns to search the TLB and 150 ns to access main memory, then what must be the effective memory access time in ns? (10) What is the basic operational difference between SCAN, C-SCAN and LOOK scheduling algorithm? What will be the total head movement if disk queue with request for I/O is in order 98,153,37,122,14,124,65,67 and uses SSTF disk scheduling algorithm? Define RAID and describe their levels. (10) What is Pure Demand Paging and how it differs from Demand Paging? Consider the following page reference string:1,2,3,4,5,6,1,2,3,4,5,1,2,3,4,1,2,3,1,2,1.If the process is allocated four frames how many page faults would occur if page replacements are done using FIFO and LRU algorithms. Write about Paging with TLB by a suitable example? (10) Explain different file allocation method. Write about different file access method with example. Explain the role of Storage Area Network. (10) Write short answer on any TWO : i) Swap-Space Management ii) VM ware iii) Domain Name Systems iv) Kernel I/O Subsystem Explain Distributed systems and Real-time systems. (10) b) Q4 a) b) Q5 a) b) Q6 a) b) Q7 a) b) Q8 a) b) Q9 a) b) (5) (5) (5) (5) (5) (5) (5)

Lecture Notes