Oslab List Of Experiments(1).docx

Department of Computer Science & Engineering Operating Systems Lab List of Experiments Semester-Even (IVth) 1. Basic Unix Commands 2. UNIX shell: Illustration of shell function such as wild cards, redirection, pipes, sequencing, grouping, background processing, command substitution, sub shells. 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. 4. (a) Write a program to copy the content of one file to another file using system calls. (b) Write a program to append contents of one file to another file. (c) Write a program for reverse copy the content of one file to another file (use lseek system call). (d) Write C program to illustrate cat command using system calls. 5. (a) Write a program to create a process and display its process identification number and parent process identification number. (b) Write a program to print process identification numbers of parent process and ten of its child processes. (c) Write a program to execute binary executable file for e.g. ls, ls-l, wc, etc.

(d) Write a program for input and output redirection wc < f1 > f2 (e) Write a program to implement (ls; ls –l)>f1. (f) Write simple programs for creating orphan and zombie. Also write programs to create different process trees of your choice. 6. (a) Write a program to implement who | wc –l. (b) Write a program to implement ls | sort | wc. (c) Write a program to implement (ls | sort) > file. 7. Write simple Pthread programs. 8. Write a program in ‘C’ to implement FCFS, SJF, RR CPU scheduling algorithm. 9. Write program to show solution of producer consumer problem. 10. Write program to show solution of Readers-Writer Problem. 11. Write a program in ‘C’ to implement Bankers algorithm for deadlock avoidance. 12. Write a program in ‘C’ to illustrate memory allocation strategies (First-Fit, Next-Fit, Best-Fit and Worst-Fit). 13. Write a program in ‘C’ to illustrate page replacement algorithms (FIFO, Optimal, LRU). 14. Lab Exam