1.

Disk scheduling is done by operating systems to schedule I/O

requests arriving for the disk. Disk scheduling is also known as I/O scheduling.
Disk scheduling is important because:

• Multiple I/O requests may arrive by different processes and only one I/O
request can be served at a time by the disk controller. Thus other I/O
requests need to wait in the waiting queue and need to be scheduled.
• Two or more request may be far from each other so can result in greater disk
arm movement.
• Hard drives are one of the slowest parts of the computer system and thus
need to be accessed in an efficient manner.
Important terms in disk scheduling
1.Seek Time: Seek time is the time taken to locate the disk arm to a specified track
where the data is to be read or write
2.Rotational Latency: Rotational Latency is the time taken by the desired sector of
disk to rotate into a position so that it can access the read/write heads
3.Transfer Time: Transfer time is the time to transfer the data. It depends on the
rotating speed of the disk and number of bytes to be transferred.
4.Disk Access Time: Disk Access Time is:
Disk Access Time = Seek Time + Rotational Latency + Transfer Time

5.Disk Response Time: Response Time is the average of time

spent by a request waiting to perform its I/O operation.
2.Types of disk scheduling algorithms
1.FCFS- First come first serve (start from R/W which is 50 here and then
go according to the sequence given like 82,170...(does not touch ends
like 0-199))

2.SSTF-shortest seek time first (starting from 50(given in question) go

to point which is close to it like for 50 43 is closer than 82 so it
goes to 43 until it reaches minimum value and then goes to 82 and so
on(does not touch the ends like 0 or 199))

3.SCAN- this algorithm works as an elevator and hence also known as

elevator algorithm. (in the question there might be given go to larger
value or go to smaller value or right side or left side the line will
go in that direction from 50 upto the end on that side (199))
4.CSCAN- the disk arm again scans the path that has been scanned, after
reversing its direction
(same as Scan but from the end point it jumps to other end as given in
diagram)

5.LOOK- arm of the disk goes only to the last request and then
reverses its direction from there only(just like scan but this
doesn’t touches ends like 0 or 199)
6.CLOOK- the disk arm goes only to the last request to be
serviced in front of the head and then from there goes to the
other end’s last request.(just like cscan but does not touches
ends like 0 or 199)
3.GOALS OF DISTRIBUTED SYSTEM
A distributed system should easily connect users to resources, it should hide the fact that
resources are distributed across a network, must be open, and must be scalable
. The four important goals that should be met for an efficient distributed system are as follows:
1. Connecting Users and Resources:

• The main goal of a distributed system is to make it easy for users to acces remote
resourses and to share them with others in a controlled way.
• Collaborating and exchanging information can be made easier by connecting users and
resource.

2. Transparency:

• A distributed system that can portrat itself as a single system is said to be transparent.
• The various transparencies need to be considered are access, location, migration,
relocation, replication, concurrency, failure and persistence.

3. Openness:

• Openness is an important goal of distributed system in which it offers services

according to standard rules that describe the syntax and semantics of those services.
• Open distributed system must be flexible
• An open distributed system must also be extensible.

4. Scalable:

• Scalability is one of the most important goals which are measured along three different
dimensions.
• First, a system can be scalable with respect to its size which can add more user and
resources to a system.
• Second, users and resources can be geographically apart.
• Third, it is possible to manage even if many administrative organizations are spanned.
4.Types of Distributed Systems
1. Client-Server Systems
2. Peer-to-Peer Systems
3. Middleware
4. Three-tier
5. N-tier

Client-Server System
This type of system requires the client to request a resource, after which the server gives the
requested resource. When a client connects to a server, the server may serve multiple clients at
the same time.
Client-Server Systems are also referred to as "Tightly Coupled Operating Systems".
it can be divided into two parts:

1. Computer Server System

2. File Server System

Peer-to-Peer System
− The nodes play an important role in this system.
− The task is evenly distributed among the nodes.
− Additionally, these nodes can share data and resources as needed. Once again, they
require a network to connect.
− The Peer-to-Peer System is known as a "Loosely Couple System".

Middleware
− Middleware enables the interoperability of all applications running on different operating
systems.
− Those programs are capable of transferring all data to one other by using these services.

Three-tier
− The information about the client is saved in the intermediate tier rather than in the client,
which simplifies development.
− This type of architecture is most commonly used in online applications.

N-tier
− When a server or application has to transmit requests to other enterprise services on the
network, n-tier systems are used.
5.Cluster, Grid and cloud(agr explaination aya kisi ek ka still
yahi points likho)
 6. Difference Between NFS and CIFS(as explanation bhi
likh sakte ho)
NFS
1. NFS is an abbreviation of the Network File
System.
2. This protocol is used for sharing the files by
Unix and Linux Operating systems.
3. It is highly scalable.
4. The speed of communication is fast.
5. The network File system is not a secure
protocol.
6. NFS is not a reliable protocol.
7. This protocol does not provide the session.
8. This protocol is easy to implement and set
up.
9. This protocol uses 111 port for both TCP and
UDP.
CIFS
1. CIFS is an abbreviation of the Common
Internet File system.
2. This protocol is used for sharing the files by
Windows Operating systems.
3. It is low scalable.
4. The speed of communication is medium.
5. Common Internet File System is more
secure than the Network File System.
6. CIFS is a reliable protocol.
7. This protocol provides the sessions.
8. Its implementation is complex.
9. This protocol uses 139 and 445 TCP ports
and 137 and 138 UDP ports.