Operating Systems Lab Manual (2003 Credit System) by HC12100103421

VIEWS: 52 PAGES: 4

									    CODE:CSE 315                                           MIT/CSE/LM/05/R0




           CSE 315: OPERATING SYSTEM AND LINUX LAB
                         V SEM B.E (CSE)
                              2012




Prepared By: Govardhan Hegde

Approved By: Dr.Renuka A
             HOD, CSE




                       Dept. Of Computer Science & Engineering
                                  MIT, MANIPAL
                                                      PART I

Objectives: To learn LINUX commands, shell functionality and LINUX system calls,
shell programming and usage of VI editor.

WEEK 1:

UNIX for non-programmers: Testing the use of LINUX commands such as date, clear, chmod,
man, mail, passwd, pwd, cat, ls, mv, mkdir, cd, rm, rmdir, wc etc, introduction to Vi editor.

WEEK 2:

UNIX shell: Illustration of shell function such as wild cards, redirection, pipes, sequencing,
grouping, background processing, command substitution, sub shells.

WEEK 3:

Shell programming: Write shell scripts with the help of variables, loops (for, while), and
conditional statements (if else, case). Shell variables, arguments to shell procedure, test
command, arithmetic with EXPR command, interactive shell procedures with read.

WEEK 4:

LINUX system calls: C programs to illustrate the use of various LINUX system calls.

               File system calls: -
                        Open( ), close( ), creat( ), read( ), write( ), dup( ), lseek( ).
               Process Management System calls: -
                        Fork( ), exec( ), exit( ), wait( ), signal( ), kill( ), alarm( ).



                                               PART II

   Objectives: Simulation of OS Algorithms

   WEEK 5 AND 6:

    CPU scheduling algorithms: To calculate the turnaround time and waiting time of each process
along with average turnaround and waiting times using the following scheduling algorithms.

                 FCFS
                 Shortest Job First Scheduling (non-pre-emptive & pre-emptive)
                 Priority Scheduling (non-pre-emptive & pre-emptive)
                 Round Robin scheduling (Pre-emptive)
WEEK 7 AND 8:

Deadlock detection and avoidance algorithms:

Simulate the following algorithms assuming that given m resource types, n processes and
allocation, request and available matrices.

           Deadlock avoidance using Banker’s algorithm.
           Deadlock detection using Banker’s algorithm.

WEEK 9 AND 10:

 Page Replacement and allocation algorithms:

         1) For a particular page reference string find out how many page faults would occur
            for the following page replacement algorithms for a given number of frames.

           LRU replacement
           FIFO replacement
           Optimal replacement

         2) For a given memory requirement, show how memory would be allocated using the
            following allocations:

           Best Fit
           Worst fit
           First fit

WEEK 11 :

       Disk Scheduling Algorithms :

         For a disk drive with a given number of cylinders , current request and the previous
       request find the total movement of the disk arm in cylinders when a queue of pending
       requests is given using the following scheduling algorithms .

             FCFS
             SSTF
             SCAN
             LOOK
             CSCAN
WEEK 12:
LINUX System V    IPC (Inter Process Communication)

Write and execute programs using each of the following IPC mechanisms:

    Pipes
    Messages
    Unix sockets

WEEK 13 AND 14: Lab Exam.

References :


   1)   Unix for Programmers and Users – A Complete Guide By Graham glass
   2)   Design of Unix Operating System by Morris bach
   3)   Operating System Concepts – silberschatz & Galvin
   4)   Unix System V – Rachel Morgan


                            

								
To top