Operating System Past Paper PDF - January 2024 - BCA

# RENAISSANCE UNIVERSITY ## Semester Examination ### Month: January-2024 ### Bachelor of Computer Application – III Semester ## Subject: Operating System ### Time: 03:00 Hrs. ### Sub. Code: BCA-302 ### Max. Marks: 60 ## Instructions: 1. Attempt all sections. 2. Figures to the right indicate the ma...

# RENAISSANCE UNIVERSITY ## Semester Examination ### Month: January-2024 ### Bachelor of Computer Application – III Semester ## Subject: Operating System ### Time: 03:00 Hrs. ### Sub. Code: BCA-302 ### Max. Marks: 60 ## Instructions: 1. Attempt all sections. 2. Figures to the right indicate the marks of group heading. ## Group – A (Attempt any five) ### (5x2 = 10) | Q. No. | Question | Marks | |---|---|---| | Q.1 | What do you understand by operating system? | 2 | | Q.2 | Define schedulers. | 2 | | Q.3 | Why memory management is required? | 2 | | Q.4 | Write the goal of disk scheduling. | 2 | | Q.5 | Why deadlock occurs? | 2 | | Q.6 | Define rotational latency. | 2 | | Q.7 | What is scheduling queue? | 2 | ## Group – B (Attempt any five) ### (5x4 = 20) | Q. No. | Question | Marks | |---|---|---| | Q.8 | Explain the concept of time-sharing in operating systems. | 4 | | Q.9 | Explain process states. | 4 | | Q.10 | Explain swapping. | 4 | | Q.11 | Explain file access methods. | 4 | | Q.12 | What is the role of mutual exclusion in the occurrence of deadlocks? | 4 | | Q.13 | Explain threads in OS. | 4 | ## Group - C (Attempt any three) ### (3x10 = 30) | Q. No. | Question | Marks | |---|---|---| | Q.14 | Explain distributed operating system in brief. | 10 | | Q.15 | Consider the set of 4 processes whose arrival time and burst time are given below- | 10 | | | Process Id | Arrival time | Burst time | | | P1 | 3 | 4 | | | P2 | 5 | 3 | | | P3 | 0 | 2 | | | P4 | 5 | 1 | | | P5 | 4 | 3 | | | If the CPU scheduling policy is FCFS, calculate the average waiting time and average turnaround time. | | | Q. No. | Question | Marks | |---|---|---| | Q.16 | Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB. These partitions need to be allocated to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. Perform the allocation of processes using | 10 | | | 1. First fit algorithm | | | | 2. Best fit algorithm | | | Q. No. | Question | Marks | |---|---|---| | Q.17 | What is directory structure? Explain. | 10 | | Q.18 | Differentiate between deadlock prevention and deadlock avoidance. | 10 | # RENAISSANCE UNIVEL SITY INDORE ## School Of Computer Science ## INTERNAL EXAMINATION –1 ### Class: BCA III ### Subject: - Operating System ### Time: 1 Hour ### M. Marks:-20 ## Instructions:- 1. Attempt all Sections. ## Group-A (Attempt any two) ### (2×2=4) | Q. No. | Question | Marks | |---|---|---| | Q1. | Define Operating System. | 2 | | Q2. | Define System Call. | 2 | | Q3. | Define Deadlock. | 2 | ## Group-B (Attempt any two) ### (2×3=6) | Q. No. | Question | Marks | |---|---|---| | Q1. | Write necessary conditions of Deadlock. | 3 | | Q2. | Explain Operating System Structure including simple and layered structure. | 3 | | Q.3 | What do you mean by Deadlock detection? | 3 | ## Group-tempt any two) ### 2×5=10 | Q. No. | Question | Marks | |---|---|---| | Q1. | Differentiate between Deadlock and Starvation | 5 | | Q2. | What do you mean by Batch Operating System Write its advantage and disadvantages. | 5 | | Q.3 | Explain types of system call in detail. | 5 | # Class: BCA III / BSC III ## Subject: - Operating System ### Time: 1 Hour ### M. Marks:-20 ## Instructions:- 1. attempt all Sections. ## School Of Computer Science ## INTERNAL EXAMINATION -11 – II ### SET A ## Group-A (Attempt any two) ### (2×2=4) | Q. No. | Question | Marks | |---|---|---| | Q1. | Define burst time and response time. | 2 | | Q2. | What do you mean by static loading and dynamic loading? | 2 | | Q3. | What is the file attributes? | 2 | ## Group-B (Attempt any two) ### (2×3=6) | Q. No. | Question | Marks | |---|---|---| | Q1. | What do you mean by process and program? | 3 | | Q2. | What do you mean by paging and page fault? | 3 | | Q.3 | Write a short note on file access methods. | 3 | ## Group-C (Attempt any two) ### (2×5=10) | Q. No. | Question | Marks | |---|---|---| | Q1. | Consider the set of 5 processes whose arrival time and burst time are given below. If the CPU scheduling policy is FCFS non-preemptive, calculate the average waiting time and average turnaround time. | 5 | | | Process Id | Arrival Time | Burst Time | | | P1 | 0 | 4 | | | P2 | 1 | 3 | | | P3 | 2 | 1 | | | P4 | 3 | 5 | | | PS | 4 | 2 | | Q. No. | Question | Marks | |---|---|---| | Q.2 | Explain LRU Algorithm in detail with example table. | | | Q.3 | Explain scan with algorithm with details. | |