Exercise 1

1.Write a shell script to show various system configurations like: a) your OS and version, release number, kernel version b) all available shells c) computer CPU information like processor type, speed etc d) memory information e) hard disk information like size of hard-disk, cache memory, model etc f) File system (Mounted)

2.Write a shell script to implement a menu driven calculator with following functions: a) Addition b) Subtraction c) Multiplication d) Division e) Modulus

3.Write a shell script to print the n terms in a Fibonacci Series.

4.Write a shell script to read a file and search for the occurrence of a particular word in it.

5.Write a shell script that accepts two numbers as command line arguments and prints all the palindrome numbers between the given two numbers.

Exercise 2

1. Write a program which creates a child process and the parent process waits for the child process to exit after printing the process id of the child and parent process. (Use: fork, wait, getpid, getppid, exit System Calls).

2. Write a program where a parent process creates a child process and then the child process loads another program to add two numbers into its memory space. The parent process should wait for the child process to exit. (Use: fork, execlp, wait, exit System calls).

3. Write a program which opens the directory in which it is executed, reads the file contained in it and displays the status of each file contained in it. (Use: opendir, readdir, closedir and stat System calls).

Exercise 3

Write programs using the I/O system calls of Linux operating system (open, read, write).

Exercise 4

Implement CPU scheduling algorithms: (i)First Come First Serve (ii)Shortest Job First (iii)Priority Scheduling (iv)Round Robin Scheduling

Exercise 5

Implement a chat server using two different processes using shared memory.

Exercise 6

Implement semaphores in matrix multiplication.

Exercise 7

Implement the banker's algorithm for deadlock detection.

Exercise 8

Implementation of the memory allocation methods for fixed partitioning: (i)First Fit (ii)Best Fit (iii)Worst Fit

Exercise 9

Implement page replacement algorithms: (i)First In First Out (ii)Least Recently Used (iii)Least Frequently Used

Exercise 10

Simulate disk scheduling algorithms: (i)First Come First Serve(FCFS) (ii)SCAN (iii)C-SCAN