4th Sem, IT

Operating Systems Laboratory It 4th Sem Syllabus for BE 2017 Regulation Anna Univ

Operating Systems Laboratory detail syllabus for Information Technology (It), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (CS8461), Category (PC), Contact Periods/week (4), Teaching hours/week (0), Practical Hours/week (0). The total course credits are 4.

For all other it 4th sem syllabus for be 2017 regulation anna univ you can visit It 4th Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for operating systems laboratory is as follows.”

Course Objective:

  • To learn Unix commands and shell programming
  • To implement various CPU Scheduling Algorithms
  • To implement Process Creation and Inter Process Communication.
  • To implement Deadlock Avoidance and Deadlock Detection Algorithms
  • To implement Page Replacement Algorithms
  • To implement File Organization and File Allocation Strategies

List of Experiments:

  1. Basics of UNIX commands
  2. Write programs using the following system calls of UNIX operating system
  3. fork, exec, getpid, exit, wait, close, stat, opendir, readdir

  4. Write C programs to simulate UNIX commands like cp, ls, grep, etc.
  5. Shell Programming
  6. Write C programs to implement the various CPU Scheduling Algorithms
  7. Implementation of Semaphores
  8. Implementation of Shared memory and IPC
  9. Bankers Algorithm for Deadlock Avoidance
  10. Implementation of Deadlock Detection Algorithm
  11. Write C program to implement Threading and Synchronization Applications
  12. Implementation of the following Memory Allocation Methods for fixed partition
    1. First Fit
    2. Worst Fit
    3. Best Fit
  13. Implementation of Paging Technique of Memory Management
  14. Implementation of the following Page Replacement Algorithms
    1. FIFO
    2. LRU
    3. LFU
  15. Implementation of the various File Organization Techniques
  16. Implementation of the following File Allocation Strategies
    1. Sequential
    2. Indexed
    3. Linked

Course Outcome:

At the end of the course, the student should be able to

  • Compare the performance of various CPU Scheduling Algorithms
  • Implement Deadlock avoidance and Detection Algorithms
  • Implement Semaphores
  • Create processes and implement IPC
  • Analyze the performance of the various Page Replacement Algorithms
  • Implement File Organization and File Allocation Strategies

For detail syllabus of all other subjects of BE It, 2017 regulation do visit It 4th Sem syllabus for 2017 Regulation.

Dont forget to download iStudy for latest syllabus and results, class timetable and more.

Leave a Reply

Your email address will not be published. Required fields are marked *

*