BCS451BCS451H

Operating System Lab

L-T-P0-0-2 Credits1 Session2023-24 TypeLab / Practical
Appears in 15 semesters · 15 branches

B.Tech Computer Science & Engineering · Sem 4 (Lab, code BCS451) · B.Tech Information Technology · Sem 4 (Lab, code BCS451) · B.Tech Artificial Intelligence & Machine Learning · Sem 4 (Lab, code BCS451) · B.Tech Artificial Intelligence & Data Science · Sem 4 (Lab, code BCS451) · B.Tech CSE (Artificial Intelligence) · Sem 4 (Lab, code BCS451) · B.Tech CSE (AI & ML) · Sem 4 (Lab, code BCS451) · B.Tech CSE (Data Science) · Sem 4 (Lab, code BCS451) · B.Tech CSE (Cyber Security) · Sem 4 (Lab, code BCS451) · B.Tech CSE (Internet of Things) · Sem 4 (Lab, code BCS451) · B.Tech Computer Science & Design · Sem 4 (Lab, code BCS451) · B.Tech Computer Science (Hindi) · Sem 4 (Lab, code BCS451H) · B.Tech Computer Science & Business Systems · Sem 4 (Lab, code BCS451) · B.Tech Cyber Security · Sem 4 (Lab, code BCS451) · B.Tech Data Science · Sem 4 (Lab, code BCS451) · B.Tech Electronics & Computer Engineering · Sem 4 (Lab, code BCS451)

List of Experiments / Activities

  1. List of Experiments (Indicative & not limited to)
  2. 1Study of hardware and software requirements of different operating systems (UNIX,LINUX,WINDOWS XP, WINDOWS7/8
  3. 2Execute various UNIX system calls for i. Process management ii. File management iii. Input/output Systems calls
  4. Implement CPU Scheduling Policies: i. SJF ii. Priority iii. FCFS iv. Multi-level Queue
  5. Implement file storage allocation technique: i. Contiguous(using array) ii. Linked –list(using linked-list) iii. Indirect allocation (indexing)
  6. 5Implementation of contiguous allocation techniques: i. Worst-Fit ii. Best- Fit iii. First- Fit
  7. 6Calculation of external and internal fragmentation i. Free space list of blocks from system ii. List process file from the system
  8. 7Implementation of compaction for the continually changing memory layout and calculate total movement of data
  9. 8Implementation of resource allocation graph RAG)
  10. 9Implementation of Banker‟s algorithm
  11. 10Conversion of resource allocation graph (RAG) to wait for graph (WFG) for each type of method used for storing graph.
  12. 11Implement the solution for Bounded Buffer (producer-consumer)problem using inter process communication techniques-Semaphores
  13. 12Implement the solutions for Readers-Writers problem using inter process communication technique - Semaphore

Official AKTU syllabus

This subject is on page 16, 17 of the original AKTU PDF.

Official AKTU syllabus PDF ↗