MCSSE103 Operating System Design M.Tech Model Question Paper : mgu.ac.in

Name of the College : Mahatma Gandhi University
Department : Computer Science and Engineering
Subject Code/Name : MCSSE 103/Operating System Design
Sem : I
Website : mgu.ac.in
Document Type : Model Question Paper

Download Model/Sample Question Paper :
I : https://www.pdfquestion.in/uploads/mgu.ac.in/5026-1-MCSSE%20103%20Operating%20System%20Design%20-1.pdf
II : https://www.pdfquestion.in/uploads/mgu.ac.in/5026-2-MCSSE%20103%20Operating%20System%20Design%20-2.doc

MGU Operating System Design Question Paper

M.TECH. Degree Examination :
Branch: Computer Science & Engineering
Specialization: Computer Science & Systems Engineering

Related : MGU MCSIS106-4 Software Project Management M.Tech Model Question Paper : www.pdfquestion.in/5025.html

Paper – I
First Semester :
MCSSE 103 : Operating System Design
(Regular – 2013 Admissions)
Time: 3 hours
Maximum Marks: 100
Explain the following :
a. Synchronous Write b. Asynchronous Write c. Delayed Write
With a neat diagram, explain the high-level architecture of the UNIX System
Explain the building block primitives in UNIX.
OR

Explain how reading and writing of a disk block is done.
Explain the algorithm for releasing a buffer.
Explain how a disk node is assigned to a newly created file. Explain the implementation of READ system call.
OR

Explain the algorithm for creating a file.
Describe implementation of pipes in UNIX
With neat diagrams, explain the process state model for the UNIX system and set of state transitions. Explain the context switch.
OR

Explain the layout of system memory.
Explain how to allocate a new region during system calls

Explain the fork and exec in a paging system.
Explain how streams provide greater modularity and flexibility for the I/O System.
OR

Explain the user-level aspects of sockets.
Explain the algorithm for reading a terminal and algorithm for writing data to a terminal

M.TECH. DEGREE EXAMINATION :
MCSSE 103
(Regular – 2013 Admissions)
Time: 3 hours
Maximum Marks: 100
List the advantages and disadvantages of buffer cache. List the reasons behind the popularity of UNIX. With a neat block diagram, explain the components of the UNIX System Kernel.
OR

With neat diagrams, explain the five scenarios for retrieval of a buffer.
Explain the Block Read Ahead Algorithm and mention how it improves the performance.
List the contents of disk inodes and in-core inodes. Compare the fields of in-core inode and buffer header. Explain the structure of a regular file.
OR

Explain the layout of a directory in UNIX.
Explain how a given path name can be converted into an inode.
With neat diagrams, explain the process state model for the UNIX system and set of state transitions.
Explain the context switch.
OR

Explain the process creation using the fork system call. (15)
(b) Explain the algorithm for booting the system. (10)
Describe how the swap space is managed on the swap device and processes are swapped out of main memory.
Explain the algorithm for opening a device.
OR

Explain the algorithm for opening a device.
Explain how one process traces and controls the execution of another process.

Syllabus
Module 1 :
General Overview of the System : History – System structure – User perspective – Operating system services – Assumptions about hardware. Introduction to the Kernel : Architecture of the UNIX operating system – Introduction to system concepts – Kernel data structures – System administration.

The Buffer Cache : Buffer headers – Structure of the buffer pool – Scenarios for retrieval of a buffer – Reading and writing disk blocks – Advantages and disadvantages of the buffer cache.

Module 2 :
File Subsystems : INODES – Structure of a regular file – Directories – Conversion of a path name to an INODE – Super block – INODE assignment to a new file – Allocation of disk blocks.

System Calls for the file system : Open – Read – Write – File and record locking – Adjusting the position of file I/O – Lseek – Close – File creation – Creation of special files – Changing directory, root, owner, mode – stat and fstat – Pipes – Dup – Mounting and unmounting file systems – link – unlink – File system abstraction and maintenance

Module 3 :
Processes : Process states and transitions – Layout of system memory – The context of a process – Saving the context of a process – Manipulation of the process address space – Sleep.

Process Control : Process creation – Signals – Process termination – Awaiting process termination – Invoking other programs – user id of a process – Changing the size of a process – Shell – System boot and the INIT process– Process Scheduling.