The document outlines a set of examination questions related to operating systems, covering topics such as command line vs GUI, memory management, file management, process scheduling, deadlock avoidance, and various operating system services. It includes multiple sections with specific tasks, diagrams, and examples required for answering the questions. The instructions emphasize the necessity of neat sketches, compulsory questions, and the prohibition of electronic devices during the exam.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
7 views
osye
The document outlines a set of examination questions related to operating systems, covering topics such as command line vs GUI, memory management, file management, process scheduling, deadlock avoidance, and various operating system services. It includes multiple sections with specific tasks, diagrams, and examples required for answering the questions. The instructions emphasize the necessity of neat sketches, compulsory questions, and the prohibition of electronic devices during the exam.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3
SET-A a) Differentiate between command line based operating system and GUI
3 Hours / 70 Marks . based operating system (Any four points)
Instructions – b) Describe various activities performed by following operating system (1) All Questions are Compulsory. components. (2) Answer each next main Question on a new page. i) Main memory management (3) Illustrate your answers with neat sketches wherever necessary. ii) File management (4) Figures to the right indicate full marks. c) With suitable diagram, describe use of scheduling queues in process (5) Assume suitable data, if necessary. scheduling. (6) Mobile Phone, Pager and any other Electronic Communication d) Write steps required for Banker’s algorithm to avoid deadlock. devices are not permissible in Examination Hall. e) With suitable example, describe any one free space management Marks 10 technique. 1. Attempt any FIVE of the following: a) State and describe any two advantages of multiprocessor system. 5. Attempt any TWO of the following: 12 b) State any four types of system calls. a) Calculate average waiting time for following data using First Come First c) Draw a neat labeled diagram for process state. Served (FCFS) and Shortest Job First (SJF)algorithms. d) State difference between preemptive scheduling and non-preemptive scheduling. Process Burst time Arrival time e) Define the term fragmentation in terms of memory. f) Give commands to perform following tasks: P0 08 0 i) To add delay in script P1 04 1 ii) To terminate a process P2 05 2 g) List any four operations performed on a file. P3 03 3
2. Attempt any THREE of the following: 12
a) Describe working of time sharing system with neat diagram. b) List and describe any four services of operating system. c) Differentiate between shared memory system and message passing system of inter-process communication. d) State and describe any two scheduling criteria. 3. Attempt any THREE of the following: 12 a) Describe use of ps and wait commands with suitable example. b) Describe prevention of deadlock occurrence with respect to hold and wait necessary condition. c) With suitable diagram, describe the concept of variable partitioning of memory. d) Describe linked file allocation method with suitable example. Also list its one advantage.
4. Attempt any THREE of the following: 12
SET B e) Explain PCB with diagram. 3 Hours / 70 Marks Instructions – (1) All Questions are Compulsory. 5. Attempt any TWO of the following: 12 (2) Answer each next main Question on a new page. a) Enlist the operating system tools. Explain any two in detail. (3) Illustrate your answers with neat sketches wherever necessary. b) Explain multithreading model in detail. (4) Figures to the right indicate full marks. c) Explain LRU page replacement algorithm for following reference string. (5) Assume suitable data, if necessary. (6) Mobile Phone, Pager and any other Electronic Communication devices 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 are not permissible in Examination Hall. 6. Attempt any TWO of the following: 12 Marks a) The jobs are scheduled for execution as follows 1. Attempt any FIVE of the following: 10 a) Define real time operating system. List any four applications of it. Process Arrival Time Burst Time b) Explain any four services provided by OS. P1 0 7 c) Draw process state diagram. d) Explain any four scheduling criteria. P2 1 4 e) Define virtual memory. P3 2 10 f) Write syntax of following commands: P4 3 6 (i) Sleep (ii) Kill P5 4 8 g) Describe any four file attributes. Solve the problem using: (i) SJF 2. Attempt any THREE of the following: 12 (ii) FCFS a) Enlist types of operating system. Explain multiprogramming OS in detail. Also find average waiting time using Gantt chart. b) List components of OS. Explain process management in detail. b) List free space management techniques? Describe any one in detail. c) With neat diagram explain inter process communication model. c) Enlist different file allocation methods? Explain contiguous allocation d) Describe I/o burst and CPU burst cycle with neat diagram. method in detail. 3. Attempt any THREE of the following: 12 a) Explain ‘PS’ command with any four options. b) Explain deadlock? What are necessary conditions for deadlock? c) Explain partitioning and its types. d) Describe sequential and direct access method. 4. Attempt any THREE of the following: 12 a) Write unix command for following: (i) Create a folder OSY (ii) Create a file FIRST in OSY folder (iii) List / display all files and directories. (iv) Write command to clear the screen b) What is purpose of system call? State any two system calls with their functions. c) State and describe types of scheduler. d) Explain Round Robin algorithm with suitable example. SET C 3) abort( ) 4) end( ) 3 Hours / 100 Marks. (iv) Write benefits of using threads. Instructions – (1) All Questions are Compulsory. (2) Illustrate your answers with neat sketches wherever necessary. b) Attempt any ONE of the following: 6 (3) Figures to the right indicate full marks. (i) With neat diagram, explain many to one and many to many multithreading (4) Assume suitable data, if necessary. model with its advantages and disadvantages. (5) Mobile Phone, Pager and any other Electronic Communication devices (ii) Explain any two file allocation methods with the help of diagram. are not permissible in Examination Hall. 5. Attempt any TWO of the following: 16 1. a) Attempt any THREE of the following: M -12 a) With neat diagram, explain Message passing system. Also describe the (i) With neat diagram, explain real time system. List its any four application. following: (ii) State any four types of system calls provided by an operating system. (i) Naming (iii) Explain Bit map free-space management technique. (ii) Synchronization (iv) Describe first generation of operating system with its advantages and (iii) Buffering disadvantages. b) Consider the following set of processes, with the length of the CPU burst b) Attempt any ONE of the following: 6 given in milliseconds. (i) Differentiate between paging and segmentation. (any six points) (ii) State and describe services provided by an operating system. Process Burst Time Priority P.T.O. P1 10 3 2. Attempt any FOUR of the following: 16 P2 1 1 a) With neat diagram, explain structure of unix operating system. b) Explain multiprocessor system and its two types. P3 2 3 c) Explain file structure with example. P4 1 4 d) Describe stepwise booting process of unix along with diagram. e) Describe the following: P5 5 2 (i) Schedulers (ii) Context switch 6. Attempt any FOUR of the following: 16 f) State and explain four scheduling criteria. a) What is system call? With the help of diagram explain open( ) system call. 3. Attempt any FOUR of the following: 16 b) Compare UNIX and LINUX. a) Describe activities of I/O system and secondary storage management. c) Explain multiprogrammed O.S. with suitable diagram. (four each) d) Explain two level Directory Structure with suitable diagram. b) With neat diagram, explain file access methods. e) Describe Process in memory with diagram. c) Describe the critical-section problem. d) State and describe necessary conditions for dead lock. e) With neat diagram, explain multilevel queue scheduling. 4. a) Attempt any THREE of the following: 12 (i) With neat diagram, Explain Monolithic structure of operating system. (ii) Describe Process Control Block (PCB) with suitable diagram. (iii) Write use of following system calls. 1) fork( ) 2) exec( )