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.   
Answer:

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.
Answer:

5. Define deadlock. What are the necessary and sufficient conditions for deadlock to occur?    
Answer:

6. What is the need for Page Replacement? Discuss different page replacement techniques giving a performance comparison.     
Answer:

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

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

Answer:

Assignment B

What is the content of the Matrix Need? 

Answer:

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? 

Answer:

Assignment C
 

Question 1

Which of the following memory unit that processor can access more rapidly
Read Only Memory 
Cache memory 
Main Memory 
Virtual Memory 
 
Question 2

A page fault occurs when
the Segmentation starts 
the page is found in the memory 
the Deadlock happens 
the page is not found in the memory 
 
Question 3
0 / 0.75 pts
"Bringing a page into memory only when it is needed, this mechanism is called"
Deadlock 
Dormant Paging 
Page Fault 
Demand Paging 
 
Question 4

First-in-First-Out (FIFO) scheduling is
Non Preemptive Scheduling 
Deadline Scheduling 
Fair Share Scheduling 
Preemptive Scheduling 
 
Question 5

Copying a process from memory to disk to allow space for other processes is Called
Deadlock 
Demand Paging 
Page Fault 
Swapping 

Question 6

The necessary conditions needed before deadlock can occur?
"Mutual Exclusion, No Hold and wait, Preemption, Circular Wait"
"  Mutual Exclusion, Hold and wait, No Preemption, Circular Wait"
"No Mutual Exclusion, Hold and wait, Preemption, Circular Wait"
"  Mutual Exclusion, Hold and wait, Preemption, No Circular Wait"
 
Question 7

A program in execution is called
A Demand Page 
Paging 
A virtual memory 
A Process 
 
Question 8

Which of the following started out as separate program from operating systems but usually is included as part of the OS later on?
Resource allocator 
Dispatcher 
text Editor 
Command processor 
 
Question 9
0 / 0.75 pts
An operating system that allows several processors to perform computation as the same time is call
Real time processing 
Multitasking 
Multiprocessing 
Single program 
 
Question 10

The kind of interface with icons and menu bars for user to point at with mouse instead of entering commands for operating system to perform certain tasks is called
User friendly programming 
Command line interface 
GUI 
None of the above 
 
Question 11

Round robin scheduling is essentially the preemptive version of ________.
FIFO 
Longest time first 
Shortest remaining 
Shortest job first 
 
Question 12

Which of the following will determine your choice of systems software for your computer?
Is it expensive? 
Is it compatible with your hardware? 
Both a and c 
Is the applications software you want to use compatible with it? 

Question 13

"Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________ ."
Signal 
Semaphore 
Deadlock 
Interrupt 
 
Question 14

What is a shell ?
It is a hardware component 
It is a tool in CPU scheduling 
It is a command interpreter 
It is a part in compiler 

Question 15

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 _________
Overlays 
Dynamic loading 
Dynamic linking 
Static loading 
 
Question 16

In the blocked state
none of the above 
the process which is running is found 
the processes waiting for I/O are found 
the processes waiting for the processor are found 
 
Question 17

What is the memory from 1K - 640K called?
Extended Memory 
Conventional Memory 
Low Memory 
Normal Memory 

Question 18

Virtual memory is __________.
An extremely large main memory 
An extremely large secondary memory 
A type of memory used in super computers. 
An illusion of extremely large main memory 
 
Question 19

"The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________."
Compilers 
Editors 
System Call 
Caching 
 
Question 20

"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."
321 
324 
310 
315 
 
Question 21

Multiprogramming systems ________.
Execute more jobs in the same time 
Execute each job faster 
Are used only on large main frame computers 
Are easier to develop than single programming systems 
 
Question 22

Which is not the state of the process?
Privileged 
Ready 
Running 
Blocked 

Question 23

"The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting."
The statement is contradictory. 
The statement is true. 
The statement is false 
None of the above 
 
Question 24

The problem of thrashing is effected scientifically by ________.
Program structure 
Primary storage size 
Program size 
None of the above 
 
Question 25

The state of a process after it encounters an I/O instruction is __________.
Blocked/Waiting 
Ready 
Idle 
Running 

Question 26

The number of processes completed per unit time is known as __________.
Efficiency 
Capacity 
Throughput 
Output 
 
Question 27

" _________ is the situation in which a process is waiting on another process,which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress."
Dormant 
Deadlock 
Starvation 
None of the above 
 
Question 28

Which of the following file name extension suggests that the file is Backup copy of another file?
COM 
BAK 
BAS 
TXT 
 
Question 29

Information is stored and transmitted inside a computer in
alphanumeric form 
ASCII code form 
binary form 
decimal form 

Question 30

A critical region
is a region prone to deadlock 
is a piece of code which only one process executes at a time 
is found only in Windows NT operation system 
is a piece of code which only a finite number of processes execute 

Question 31

The mechanism that brings a page into memory only when it is needed is called _____________
  Page Replacement 
  Fragmentation 
  Demand Paging 
  Segmentation 
 
Question 32

A parity bit is
is the first bit in a byte 
used to detect errors 
used to indicate uppercase letters 
is the last bit in a byte 
 
Question 33

Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________.
None of the above 
Process Blocking 
Time Sharing 
Context Switch 

Question 34

A thread
none of the above 
is used to speed up paging 
is a lightweight process where the context switching is low 
is a lightweight process where the context swithching is high 

Question 35

______ is a high level abstraction over Semaphore.
Message passing 
Mutual exclusion 
Shared memory 
Monitor 
 
Question 36

A tree sturctured file directory system
is not essential when we have millions of files 
allows easy storage and retrieval of file names 
is a much debated unecessary feature 
none of the above 
 
Question 37

Which directory implementation is used in most Operating System?
Two level directory structure 
Acyclic directory structure 
Tree directory structure 
Single level directory structure 

Question 38

A set of processes is deadlock if
each process is blocked and will remain so forever
all processes are trying to kill each other
none of the mentioned
each process is terminated

Question 39

Which one of the following is a synchronization tool?
socket 
thread
semaphore
pipe 
 
Question 40

Mutual exclusion can be provided by the
binary semaphores
mutex locks
both (1) and (2)
none of the mentioned