III Year - I
SEMESTER 
Operating Systems & Linux Programming Laboratory
T P C
0 3 2
Operating Systems
1. Simulate the
following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
2. Multiprogramming-Memory
management- Implementation of fork (), wait (), exec() and exit (), System
calls
3. Simulate the
following
a)Multiprogramming with a fixed number of tasks (MFT)
b)Multiprogramming with a variable number of tasks (MVT)
4. Simulate Bankers
Algorithm for Dead Lock Avoidance
5.Simulate Bankers
Algorithm for Dead Lock Prevention.
6. Simulate the following page replacement algorithms.
a) FIFO b) LRU c) LFU
7. Simulate the
following File allocation strategies
a) Sequenced
b) Indexed
c) Linked
Linux Programming
1.
a) Study of Unix/Linux general purpose utility command list
man,who,cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo, more, date,
time, kill, history, chmod, chown, finger, pwd, cal, logout,
shutdown.
b) Study of vi editor.
c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating
system.
d) Study of Unix/Linux file system (tree structure).
e) Study of .bashrc, /etc/bashrc and Environment variables.
2. Write a C program that makes a copy of a file using standard I/O, and
system calls
3. Write a C program to emulate the UNIX ls -l command.
4. Write a C program that illustrates how to execute two commands
concurrently
with a command pipe.
Ex: - ls -l | sort
5. Write a C program that illustrates two processes communicating using
shared
memory
6. Write a C program to simulate producer and consumer problem
usingsemaphores
7. Write C program to create a thread using pthreads library and let it
run its function.
8. Write a C program
to illustrate concurrent execution of threads using pthreads library.
No comments:
Post a Comment