SEM VI OPERATING SYSTEM

LAB MANUAL SHITAL.PATIL

Course Subject Chapter in the syllabus Concept* to be delivered :

: : :

ELECTRONICS AND TELECOMMUNICATION

Sem Experiment No.

: :

III 1

EN

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

TO STUDY AND DETERMINE Y-PARAMETER OF GIVEN

NETWORK

Dc Power Supply ,Dc Current,Meters,Digital Meter,Bred Board,Circuit Components,Connecting Wires.

Generally any network may be represented schematically by rectangular box. A network may be used for representing either source or load or variety o purposes. A pair of terminal in which a signal enters or leaves a network is called port. A port is defined as any pair of terminals in which energy is supplied or from which energy is withdrawn or where to network variables may be measured. the y-parameter of two port for positive direction of voltage and current may be defined by expressing the port current i1 and i2 in terms of voltage v1 and v2 are independent variables, then [I1 I2]=[y][v1 v2] Where Y is a matrix of four element and each element represents admittance. Hence this matrix is also known as admittance matrix of matrix.Thus y- we have I=YV Where y=[y11 y12 y21 y22] I1=Y11v1 +Y12v2 I2=Y21v1+ Y22V2 Case 1: When o/p port is short circuited i.e V2=0 Y11=I1/V2.V2=0 Where y11 is driving point admittance with output port is short ci rcuitted.it is also known as short circuit i/p admittance. Also y21=i2/v1.v2=0 Where y21is transfer admittance with output port short circuited. it also known as short circuit forward transfer characteristics. CASE 2: When i/p port is open circuited i.e v1=0 Y12=I1/V2V1=0

Where y12 is transfer with i/p port short circuit or short ciruit transer admttance.

Diagrams

Results Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: : :

1.What is FCFS? 2.What are the advantages of FCFS ? 3.What are the disadvantages of FCFS ? 4. What is preemptive scheduling? 5.What is scheduling? 6.What is gantt chart? 7.explain fcfs with gantt chart. 8.explain example of preemptive scheduling. 9.what is I/O bound process and CPU bound process? 10. Calculate AVG waiting time for any FCFS example.

Course Subject

: :

Information technology OSCD

Sem Experiment No.

: :

VI 2

Chapter in the syllabus

Concept* to be delivered

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

To study shortest job first.

120 mins Shortest job next (SJN) (also known as Shortest Job First (SJF) or Shortest Process Next (SPN)) is a scheduling policy that selects the waiting process with the smallest execution time to execute next. Shortest job next is advantageous because of its simplicity and because it maximizes process throughput (in terms of the number of processes run to completion in a given amount of time). It also minimizes the average amount of time each process has to wait until its execution is complete. However, it has the potential for process starvation for processes which will require a long time to complete if short processes are continually added. Highest response ratio next is similar but provides a solution to this problem. Shortest job next can be effectively used with interactive processes which generally follow a pattern of alternating between waiting for a command and executing it. If the execution of a command is regarded as a separate "process", past behaviour can indicate which process to run next, based on an estimate of its running time.

Program Results Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: : : : Program is executed. Thus we have implemented Shortest job first.

1.what is SJF? 2.what are the advantages of SJF? 3. what are the disadvantages of SJF? 4.what are the difference between SJF and FCFS ? 5.Calculate AVG waiting time for SJF example. 6.What is non-preemetive scheduling? 7.Expalin example of non-preemetive scheduling. 8.draw gantt chart for SJF ? 9.calculate turn around time for SJF ? 10.compare waiting time of FCFS and SJF?

Course Subject Chapter in the syllabus

: : :

Information technology OSCD

Sem Experiment No.

: :

VI 3

Concept* to be delivered

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

Implementing Round robin algorithm.

120 mins Round-robin (RR) is one of the simplest scheduling algorithms for processes in an operating system, which assigns time slices to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is both simple and easy to implement, and starvation-free. Round-robin scheduling can also be applied to other scheduling problems, such as data packet scheduling in computer networks. Implementing round robin algo. Thus we have implemented round robin algorithm.

Program Results Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: : : :

1.what is round robin algo? 2.What are the different FCFS and RR? 3. What are the different SJF and RR 4. Explain the advantages of RR ? 5.Explain the disadvt of RR? 6 Calculate AVG waiting time for RR example. 7.Expalin example of non-preemetive scheduling for RR. 8.draw gantt chart for RR ? 9.calculate turn around time for RR ? 10.compare waiting time of RR and SJF?

Course Subject Chapter in the syllabus

: : :

Information technology OSCD

Sem Experiment No.

: :

VI 4

Concept* to be delivered

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

Implementation of round robin with priority SA.

120 mis Round-robin (RR) is one of the simplest scheduling algorithms for processes in an operating system, which assigns time slices to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is both simple and easy to implement, and starvation-free. Round-robin scheduling can also be applied to other scheduling problems, such as data packet scheduling in computer networks. Priority scheduling :- The basic idea is straightforward: each process is assigned a priority, and priority is allowed to run. Equal-Priority processes are scheduled in FCFS order. The shortest-Job-First (SJF) algorithm is a special case of general priority scheduling algorithm.

Priority scheduling can be either preemptive or non preemptive y A preemptive priority algorithm will preemptive the CPU if the priority of the newly arrival process is higher than the priority of the currently running process. A non-preemptive priority algorithm will simply put the new process at the head of the ready queue.

A major problem with priority scheduling is indefinite blocking or starvation. A solution to the problem of indefinite blockage of the low-priority process is aging. Aging is a technique of gradually increasing the priority of processes that wait in the system for a long period of time.

Program Results Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: : : : Implemented the RR with priority SA. Thus we have implemented RR with priority SA..

1.What is priority SA? 2.What is RR with priority SA? 3. Explain the advantages of RR with priority SA ? 5.Explain the disadvt of RR priority SA? 6 Explain difference between RR and RR with priority scheduling? 6. Calculate AVG waiting time for RR with priority scheduling example. 7. raw gantt chart for RR with priority. 9.calculate turn around time for RR with priority. 10.compare waiting time of RR with priority and SJF.

Course Subject Chapter in the syllabus

: : :

Information technology OSCD

Sem Experiment No.

: :

VI 6

Concept* to be delivered

Aim of the Experiment Apparatus required Estimated time to complete this experiment

: : :

Study of Linux os.

120 mins

Theory

Linux refers to the family of Unix-like computer operating systems using the Linux kernel.[7] Linux can be installed on a wide variety of computer hardware, ranging from mobile phones, tablet computers, routers and video game consoles, to desktop computers, mainframes and supercomputers.[8][9][10][11] Linux is a leading server operating system, and runs the 10 fastest supercomputers in the world. The development of Linux is one of the most prominent examples of free and open source software collaboration; typically all the underlying source code can be used, freely modified, and redistributed, both commercially and non-commercially, by anyone under licenses such as the GNU General Public License. : Standard directory structure of linux / - the topmost /dev - all the devices are accessible as files /var - variable data such as mails, log files, databases /usr - almost all the packages installed /etc - configuration files /home - home directories for all the users /root - home directory of the privileged user root /mnt - used to mount other directories/partitions.

Program Results Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: : : : Thus we have studied Linux OS.

1.What is Linux OS? 2.List out different versions of Linux. 3. what is partition. 4.what are different dir in linux? 5.what is root ? 6.explain file structure of linux. 7.difference between linux and windows. 8.list general commands for linux. 9.Advantages of linux. 10. Disadvt of linux.

Course Subject Chapter in the syllabus

: : :

Information Technology OSCD

Sem Experiment No.

: :

VI 6

Concept* to be delivered

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

Study of linux command.

120 mins Linux refers to the family of Unix-like computer operating systems using the Linux kernel.[7] Linux can be installed on a wide variety of computer hardware, ranging from mobile phones, tablet computers, routers and video game consoles, to desktop computers, mainframes and supercomputers.[8][9][10][11] Linux is a leading server operating system, and runs the 10 fastest supercomputers in the world. The development of Linux is one of the most

prominent examples of free and open source software collaboration; typically all the underlying source code can be used, freely modified, and redistributed, both commercially and non-commercially, by anyone under licenses such as the GNU General Public License. List various linux commands for file handling,user and group handling,basic commands to display date,calender,time,etc.

Program Results Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: : : : Thus we have studied the linux commands. Thus we have studied the linux commands.

1.what are the general used commands in linux? 2.What the commands for creating users?

3.what are the commands for changing password? 4.what are the command of roots? 5. What are the commands of dir? 6.What are the commands for changing permission? 8.What are chgrp? 9. What is the command for displaying date? 10.What is command for exit?

Course Subject Chapter in the syllabus

: : :

Information technology OSCD

Sem Experiment No.

: :

VI 7

Concept* to be delivered

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

Study of linux installation (partition)

Disk partitioning is the act of dividing a hard disk drive into multiple logical storage units referred to as partitions, to treat one physical disk drive as if it were multiple disks. Partitions are also termed "slices" for operating systems based onOn Unix-based and Unix-like operating systems such as Linux or Mac OS X, it is possible to use multiple partitions on a disk device. Each partition can be formatted with a file system or as a swap partition. Multiple partitions allow directories such as /tmp, /usr, /var, or /home to be allocated their own filesystems. Such a scheme has a number of advantages: y y y If one file system gets corrupted, the data outside that filesystem/partition may stay intact, minimizing data loss. Specific file systems can be mounted with different parameters e.g. readonly, or with the execution of setuid files disabled. A runaway program may use up all available space on a non-system filesystem does not fill up critical filesystems.

A common default for Linux desktop systems is to use two partitions: one holding a file system mounted on "/" (the root directory) and a swap partition. BSD, Solaris or GNU Hurd. A partition editor software program can be used to create, resize, delete, and manipulate these partitions on the hard disk. Program Results Conclusion : : : Thus we have studied proceducer for os installation. Thus we have studied proceducer for os installation (partition)

Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

1.What do you mean by partition? 2.Why we do partition? 3.Where it is done? 4.commands for partition 5.explain partition process? 6.What is procedure for os(linux) installation ? 7. how to format partition? 8.Explain advantages of partitioning? 10.what are disadvt of multiple partitioning?

Course Subject Chapter in the syllabus

: : :

Information Technology OSCD

Sem Experiment No.

: :

VI 8

Concept* to be delivered

: To bankers algorithm.

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

120 mins The Banker's algorithm is run by the operating system whenever a process requests resources. The algorithm avoids deadlock by denying or postponing the request if it determines that accepting the request could put the system in an unsafe state (one where deadlock could occur). When a new process enters a system, it must declare the maximum number of instances of each resource type that may not exceed the total number of resources in the system. Also, when a process gets all its requested resources it must return them in a finite amount of time.

Program Results Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: : : : Thus we executed bankers algorithm Thus we studied bankers algorithm.

1.what is deadlock? 2.how to handle deadlock ? 3. why bankers algorithm used? 4.What are the resources it required ? 5.explain data structure for bankers algorithm ? 6.What are safe and unsafe states ? 7.explain bankers algorithm with example? 8.limitation of bankers algorithm ? 9.how bankers algorithm detect deadlock? 10. how bankers algorithm prevent deadlock?

Course Subject Chapter in the syllabus

: : :

Information technology Oscd

Sem Experiment No.

: :

VI 10

Concept* to be delivered

: To study and implement IPC.

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

120 mins Inter-process communication (IPC) is a set of methods for the exchange of data among multiple threads in one or more processes. Processes may be running on one or more computers connected by a network. IPC methods are divided into methods for message passing, synchronization, shared memory, and remote procedure calls (RPC). The method of IPC used may vary based on the bandwidth and latency of communication between the threads, and the type of data being communicated.

There are several reasons for providing an environment that allows process cooperation: y y y y y Information sharing Speedup Modularity Convenience Privilege separation

IPC may also be referred to as inter-thread communication and interapplication communication

Program Results

: :

Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: :

Thus we implemented IPC.

1.What is IPC? 2.process of IPC? 3.what are the advantages of IPC? 4.how IPC implemented? 5. what is inter process communication? 6why IPC used for inter process communication? 7.what is intra process communication? 8.how ipc works? 9. explain IPC using shared memory ? 10.explain IPC using message passing?

Course Subject Chapter in the syllabus

: : :

Information technology Oscd

Sem Experiment No.

: :

VI 10

Concept* to be delivered

: To study and implement RPC.

Aim of the Experiment Apparatus required Estimated time to complete this experiment Theory

: : :

120 mins Microsoft Remote Procedure Call (RPC) is an interprocess communication (IPC) mechanism that enables data exchange and invocation of functionality residing in a different process. That process can be on the same computer, on the local area network (LAN), or across the Internet. The Microsoft RPC mechanism uses other IPC mechanisms, such as named pipes, NetBIOS, or Winsock, to establish communications between the client and the server. With RPC, essential program logic and related procedure code can exist on different

computers, which is important for distributed applications. RPC Processes and Interactions The RPC components make it easy for clients to call a procedure located in a remote server program. The client and server each have their own address spaces; that is, each has its own memory resource allocated to data used by the procedure. The following figure shows the RPC process. RPC Process

The RPC process starts on the client side. The client application calls a local stub procedure instead of code implementing the procedure. Stubs are compiled and linked with the client application during development. Instead of containing code that implements the remote procedure, the client stub code retrieves the required parameters from the client address space and delivers them to the client runtime library. The client runtime library then translates the parameters as needed into a standard Network Data Representation (NDR) format for transmission to the server.

Program Results

: :

Conclusion Actual/Possible application* of this set up in real life Visits to a place using this concept Possible questions related to oral examination

: :

Thus we implemented IPC.

1.What is RPC? 2.process of RPC? 3.what are the advantages of RPC? 4.how RPC implemented?

5. what are the RPC components? 6what is marshelling in RPC? 7.what is stub in RPC? 8.explain RPC architecture ? 9. explain RPC process? 10.list RPC supported network protocols?