Download BCA_NEWOL operating system and more Assignments Operating Systems in PDF only on Docsity!
Course Code : MCS- 203
Course Title : Operating Systems
Assignment Number : BCA_NEWOL(II)/ 203 /Assignment/20 26
Maximum Marks : 100
Weightage : 30 %
Last Dates for Submission : 30 th^ April, 202 6 (For January Session)
31 st^ October, 2026 (For July Session)
This assignment has four questions. Answer all questions. Each question is of 20 marks.
Rest 20 marks are for viva voce. You may use illustrations and diagrams to enhance the
explanations. Please go through the guidelines regarding assignments given in the
Programme Guide.
Question 1: Consider the following jobs: Job # Arrival time Run time A 0 2 B 2 3 C 3 1 D 5 6 a) Using the FCFS method, compute the completion times of the above jobs, average turn around time and average waiting time. b) Using the SRTF (Shortest Remaining Time first) method, compute the completion times of the above jobs, the average turn around time and the average waiting time. Note that SRTF is SJF with preemption. (Hint: Completion time - arrival time = turnaround time). c) Using the Round Robin method (with Quantum = 2), compute the completion times of the above jobs and the average waiting time. (20 Marks) Question 2: a. Explain the Banker’s problem. Consider the following snapshot of a system: Allocation A B C D P0 0 0 1 2 P1 1 0 0 0 P2 1 3 5 4 P3 0 6 3 2 P4 0 0 1 4 Max A B C D 0 0 1 2 1 7 5 0 2 3 5 6 0 6 5 2 0 6 5 6 Available A B C D 1 5 2 0
Answer the following questions using Banker's algorithm: i. What is the content of the matrix need? ii. Is the system in a safe state? iii. If a request from P1 arrives for (0, 4, 2, 0), can the request be granted immediately? (10 Marks) b. Consider the following page-reference string: 1, 2, 3, 4, 2, 1, 3, 4, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 4 How many page faults would occur for following replacement algorithms assuming one, two, three, four, five, six or seven frames? Remember that all frames are initially empty, so your first unique pages will all cost one fault each. i. LRU replacement. ii. FIFO replacement. iii. Optimal replacement. (10 Marks) Question 3: a. Multiprocessor systems aim to improve both throughput and application speedup, yet these objectives often conflict with each other. Critically analyze how processor scheduling policies and task allocation strategies in multiprocessor operating systems attempt to balance this trade- off. Illustrate your answer with suitable scenarios where prioritizing one objective adversely affects the other. (10 Marks) b. Different multiprocessor interconnection architectures (bus-oriented, crossbar, hypercube, and multistage switch-based systems) exhibit varying scalability and contentioncharacteristics.Compare these architectures from the perspective of scalability, cost, fault tolerance, and communication overhead, and justify which architecture would be most suitable for large-scale parallel applications. (10 Marks) Question 4: a. Modern operating systems increasingly rely on virtual memory techniques to balance performance and resource utilization. Using Windows 10 and Linux as reference case studies, examine how demand paging, working sets, page caching, and memory compression contribute to efficient memory management. Evaluate the trade-offs involved when physical memory is constrained, and discuss how these strategies influence application performance. (10 Marks) b. File system design plays a crucial role in data integrity, performance, and security. Drawing from the case studies on Windows (NTFS) and Linux file systems, discuss how directory organization, file metadata handling, access control, and storage managementdiffer in philosophy and implementation. Assess how these differences affect scalability, fault tolerance, and system administration in enterprise environments. (10 Marks)
