Operating Systems Quiz

Subject: Lab Assignment - Operating System

• Student name: Suwarnika Srivastava
• Registration number: 23BSA10092
• Course code: CSE3003
• Slot: A21 + A22 + A2
• Assignment ID: 3

Question 1: Process Creation and Management

• Objective: Understand process creation, termination, and management in the operating system.
• Tasks: Write a C program to create a new process using fork().
  • Implement the parent-child process relationship.
  • Demonstrate process termination.
  • Use exec() to replace a process image.
  • Demonstrate the use of process IDs and status handling.

Question 2: Basic OS Commands

• Objective: Learn and practice basic operating system commands.
• Tasks:
  • File management (e.g., ls, cp, mv, rm, touch).
  • Process management (e.g., ps, kill, top).
  • Directory navigation (e.g., cd, pwd, mkdir).
  • I/O redirection and piping (e.g., |, >, >>).

Question 3: CPU Scheduling Algorithms

• Objective: Simulate different CPU scheduling algorithms.
• Tasks:
  • Write a program to simulate First-Come-First-Served (FCFS) scheduling.
  • Implement Shortest Job First (SJF) scheduling (with or without preemption).
  • Simulate Round Robin (RR) scheduling and calculate turnaround and waiting times.
  • Implement Priority Scheduling and test with different sets of priorities.

Question 4: Inter-Process Communication (IPC)

• Objective: Implement communication between processes.
• Tasks:
  • Write a program using pipes for IPC between parent and child processes.
  • Implement shared memory for communication between multiple processes.
  • Use message queues to exchange data between processes.
  • Demonstrate use of semaphores for synchronization.

Question 5: Thread Creation and Synchronization

• Objective: Work with multithreading in an operating system.
• Tasks:
  • Create multiple threads using POSIX threads (pthreads) in C.
  • Implement thread synchronization using mutexes or semaphores.
  • Write a program to demonstrate race conditions and resolve them using locks.
  • Simulate the producer-consumer problem using multithreading.

Question 6: Deadlock Detection and Prevention

• Objective: Implement deadlock avoidance and detection techniques.
• Tasks:
  • Write a program to simulate a system with multiple resources and processes.
  • Implement Banker's Algorithm for deadlock avoidance.
  • Demonstrate deadlock detection using a resource allocation graph.
  • Analyze a situation where deadlock occurs and suggest ways to resolve it.

Question 7: Memory Management Techniques

• Objective: Implement and simulate different memory management techniques.
• Tasks:
  • Simulate paging and segmentation using C or Java.
  • Implement page replacement algorithms (FIFO, LRU, Optimal).
  • Write a program to simulate allocation and deallocation of memory blocks using First Fit, Best Fit, and Worst Fit algorithms.

Question 8: File System Implementation

• Objective: Understand file system operations and implement basic file management.
• Tasks:
  • Write a program to simulate the creation, deletion, and manipulation of files in a directory.
  • Implement file allocation methods (Contiguous, Linked, Indexed).
  • Simulate disk scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN).

Question 9: Virtual Memory Management

• Objective: Work with virtual memory and page management.
• Tasks:
  • Implement a simulation of virtual memory using paging.
  • Write a program to simulate the demand paging concept.
  • Simulate page replacement policies (FIFO, LRU).
  • Implement a program to track page faults during process execution.

Question 10: Disk Scheduling Algorithms

• Objective: Understand and implement various disk scheduling algorithms.
• Tasks:
  • Simulate First-Come-First-Served (FCFS) disk scheduling.
  • Implement Shortest Seek Time First (SSTF) disk scheduling.
  • Write a program to simulate SCAN, C-SCAN disk scheduling.