Download Operating Systems Lab Manual (2003 Credit System)

CODE:CSE 317
MIT/CSE/LM/05/R0
CSE 317: OPERATING SYSTEM AND LINUX LAB
V SEM B.E (CSE)
2014
Submitted By: Dr. Dinesh Acharya U
Approved By: Dr.Renuka A
HOD, CSE
Dept. Of Computer Science & Engineering
MIT, MANIPAL
PROCEDURE FOR EVALUATION
The entire lab course consists of 100 marks. The marking scheme is as follows
Continuous Evaluation
60 marks
End Sem Lab Exam
40 marks
100 marks
Total
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
List of Reference Books :
1)
2)
3)
4)
Unix for Programmers and Users – A Complete Guide By Graham glass
Design of Unix Operating System by Morris bach
Operating System Concepts – silberschatz & Galvin
Unix System V – Rachel Morgan
PART III
Application Development for Android Operating
System
Note : All the students need to design and develop an application for Android. There is
tremendous opportunity for Android Developers. The application will carry total of 10
marks. Few of the application titles are shown below. However, this list is not
comprehensive. You can conceptualize and develop an application which is not in this
list.
1. Displaying current Date and Time on the screen and options for changing date
and time.
2. A suitable application which has menus representing various actions. On clicking
the menu, takes onto screens with Radio, Edit and List boxes.
3. A screen with options for browsing various sites. Here the Application should
embed a Web browser.
4. A screen which shows progress bar. The progress bar can show progress of
download information or file download activity.
5. Displaying the map given the latitude and longitude.
6. Development of a Honeycomb UI application for Akash.
7. Displaying temperature of Manipal using Web communication.
8. Displaying the map of Manipal.
9. Developing a location aware noti_cation. Say you would like to purchase some
items when you go to Udupi. The application provides a provision and notifies
when you along with your phone reach Udupi.
10. Developing an always open access to your regular email account.
List of Reference Books
1. Beginning Android 3 - Mark Murphy, Apress publishers.
2. Android Apps for Absolute Beginners -Wallace Jackson, Apress publishers.
3. Professional Android 2 Application Development - Reto Meier,Wrox Publishers.
WEEK 13 AND 14: Lab Exam.
