Operating System and Data Storage

Assignment A
1. What is an operating system? Discuss the functions of an operating system? Give a general architecture of the operating system.    

2. What are the cooperating processes and how they communicate? Explain by taking a suitable example.
Answer:

3 .Write a note on the multi-processor scheduling.   

4.  What are the characteristics of a good scheduling algorithm? Give a comparison of FCFS 
And RR algorithm giving pros and cons of each with example.

5. Define deadlock. What are the necessary and sufficient conditions for deadlock to occur?    
6. What is the need for Page Replacement? Discuss different page replacement techniques giving a performance comparison.     

7. What is the requirement of Memory Management? How the address binding of instructions and data is carried to memory address.               

8. What is the purpose of directory structure in file system? Explain various types of directory structure with suitable diagram

Assignment B

What is the content of the Matrix Need? 

2. Is the system in a safe state? 
Answer:

3.     If a request from process P1 arrives for (0, 4, 2, 0) can this request be granted immediately? 

Assignment C
 

Question No: 1
___________ begins at the root and follows a path down to the specified file 
Relative path name
Absolute path name
Standalone name
All of the above
Question No: 2
Process State is a part of 
Process Control block
Encode
File Allocation Table
None of the above
Question No: 3
Virtual Memory is commonly implemented by __________. 
Segmentation
Swapping
Demand Paging
None of the above
Question No: 4
A ___________ contains information about the file, including ownership, permissions, and location of the file contents. 
File Control Block (FCB)
File
Device drivers
File system
Question No: 5
The operating system of a computer serves as a software interface between the user and the ________. 
Hardware
Peripheral
Memory
Screen
Question No: 6
If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37,14,124,65,67. 
310
324
315
321
Question No: 7
Multiprogramming systems ________. 
Are easier to develop than single programming systems
Execute each job faster
Execute more jobs in the same time
Are used only on large main frame computers
Question No: 8
Cryptography technique is used in ________. 
Polling
Job Scheduling
Protection
File Management
Question No: 9
In the ___________ method of data transfer, the participation of the processor is eliminated during data transfer. 
Buffering
Caching
Direct Memory Access
Indirect Memory Access
Question No: 10
A thread is a __________ process. 
Heavy Weight
Mutliprocess
Inter Thread
Light weight
Question No: 11
Which of the following is crucial time while accessing data on the disk? 
Seek time
Rotational time
Transmission time
Waiting time
Question No: 12
In ______ OS, the response time is very critical
Multitasking
Batch
Online
Real-time
Question No: 13
Inter process communication can be done through __________.
Mails
Messages
System calls
Traps
Question No: 14
Identify the odd thing in the services of operating system. 
Accounting
Protection
Error detection and correction
Dead lock handling
Question No: 15
Which of the following memory allocation scheme suffers from External fragmentation? 
Segmentation
Pure demand paging
Swapping
Paging
Question No: 16
Distributed OS works on the ________ principle. 
File Foundation
Single system image
Multi system image
Networking image
Question No: 17
Which file system does Windows 95 typically use? 
FAT16
FAT32
NTFS
LMFS
Question No: 18
Real time systems are ________. 
Primarily used on mainframe computers
Used for monitoring events as they occur
Used for program development
Used for real time interactive users
Question No: 19
The primary job of the operating system of a computer is to ________. 
Command Resources
Manage Resources
Provide Utilities
Be user friendly
Question No: 20
Consider the two statements.
(i) A network operating system, the users access remote resources in the same manner as local resource.
(ii) In a distributed operating system, the user can access remote resources either by logging into the appropriate remote machine or transferring data from the remote machine to their own machine. Which of the statement is true? 
(i) true, (ii) false
(ii) true, (i) false 
Both (i) and (ii) false
Both (i) and (ii) true
Question No: 21
Information about a process is maintained in a _________. 
Stack
Translation Lookaside Buffer
Process Control Block
Program Control Block
Question No: 22
Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively .
P1 : 10 : 3 ,
P2 : 1 : 1 , 
P3 : 2 : 4 ,
P4 : 1 : 5 ,
P5 : 5 : 2. 
8 milliseconds
8.2 milliseconds
7.75 milliseconds
3 milliseconds
Question No: 23
The operating system manages ________. 
Memory
Processor
Disk and I/O devices
All of the above
Question No: 24
The Hardware mechanism that enables a device to notify the CPU is called-_____
Polling
Interrupt
System Call
None of the above
Question No: 25
Virtual memory is __________. 
An extremely large main memory
An extremely large secondary memory
An illusion of extremely large main memory
A type of memory used in super computers
Question No: 26
A major problem with priority scheduling is _________. 
Definite blocking
Starvation
Low priority
None of the above
Question No: 27
Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called--
Static loading
Dynamic loading
Dynamic linking
Overlays
Question No: 28
Which of the following is not advantage of multiprogramming? 
Increased throughput
Shorter response time
Decreased operating system overhead
Ability to assign priorities to jobs
Question No: 29
_________ page replacement algorithm suffers from Belady's anomaly. 
LRU
MRU
FIFO
LIFO
Question No: 30
Paging _________. 
Solves the memory fragmentation problem
Allows modular programming
Allows structured programming
Avoids deadlock
Question No: 31
The term “Operating System“means ________. 
A set of programs which controls computer working
The way a computer operator works
Conversion of high-level language in to machine level language
The way a floppy disk drive operates
Question No: 32
The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________ 
Ready queue
Device queue
Input queue
Priority queue
Question No: 33
Mutual exclusion 
if one process is in a critical region others are excluded
prevents deadlock
requires semaphores to implement
is found only in the Windows NT operating system
Question No: 34
Which scheduler controls the degree of multiprogramming? 
Short term scheduler
Long term scheduler
Middle term scheduler
None of the above
Question No: 35
In memory management, a technique called as paging, physical memory is broken into fixed-sized blocks called ___________. 
Pages
Frames
Blocks
Segments
Question No: 36
In the running state 
only the process which has control of the processor is found
all the processes waiting for I/O to be completed are found
all the processes waiting for the processor are found
none of the above

Question No: 37
In a multi threaded environment _______. 
Each thread is allocated with new memory from main memory.
Main threads terminate after the termination of child threads.
Every process can have only one thread.
None of the above
Question No: 38
Which of the following statement is not true? 
Multiprogramming implies multitasking
Multi-user does not imply multiprocessing
Multitasking does not imply multiprocessing
Multithreading implies multi-user
Question No: 39
In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________ condition of deadlock 
Mutual exclusion
Hold and Wait
Circular Wait
No Preemption
Question No: 40
If all page frames are initially empty, and a process is allocated 3 page frames in real memory and references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page replacement is FIFO, the total number of page faults caused by the process will be __________. 
10
7
8
9