Q1. Write different types of system calls?

This is question 1 (4 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q2. Explain Fragmentation.

This is question 2 (3 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Operating System and Virtualization | B.E. Semester IV Winter 2021 | GTU Papers

Q: Q1. Differentiate between Multi-Programming and Multi-Processing System.

This is question 1 (3 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q: Q1. What is scheduler? Explain queuing diagram representation of process scheduler.

This is question 1 (7 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q: Q2. Define the following terms. 1. Throughput 2. Waiting Time 3. Turnaround Time 4. Response Time

This is question 2 (4 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q: Q2. Consider the following set of processes, with the length of the CPU-burst 0 time given in milliseconds: Process burst Time Priority P1 10 P2 1 1 P3 2 P4 1 P5 5 For each of the scheduling algorithms, FCFS, Shortest-Job-First (SJF, nonpreemptive), Priority (smaller priority number implies higher scheduling priority), and RR (quantum = 1) do the following: a. Draw a Gantt chart to show how these processes would be scheduled. b. Give the turnaround time (total time from first arrival into ready state until cpu-burst is completed) of each process. c. Give the waiting time (total time spent in the Ready state) of each process. d. Give the average waiting time of all the processes. Which of these scheduling algorithm gives the smallest average waiting Time?

This is question 2 (2 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q: Q2. What is Process? Draw Five State Process Model and Explain it. Page 1 of

This is question 2 (2 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q: Q3. Give the functions of following UNIX commands: 1. grep 2. cat 3. cmp

This is question 3 (3 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q: Q3. Explain concept of Demand Paging in memory management.

This is question 3 (4 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Q: Q3. What is Critical Section Problem and list the requirements to solve it. Write Peterson’s Solution for the same.

This is question 3 (7 marks) from the GTU Operating System and Virtualization BE Winter 2021 question paper. Subject code: 3141601.

Questions25

Differentiate between Multi-Programming and Multi-Processing System.

[3 marks]

Write different types of system calls?

[4 marks]

What is scheduler? Explain queuing diagram representation of process scheduler.

[7 marks]

Explain Fragmentation.

[3 marks]

Define the following terms. 1. Throughput 2. Waiting Time 3. Turnaround Time 4. Response Time

[4 marks]

Consider the following set of processes, with the length of the CPU-burst 0 time given in milliseconds: Process burst Time Priority P1 10 P2 1 1 P3 2 P4 1 P5 5 For each of the scheduling algorithms, FCFS, Shortest-Job-First (SJF, nonpreemptive), Priority (smaller priority number implies higher scheduling priority), and RR (quantum = 1) do the following: a. Draw a Gantt chart to show how these processes would be scheduled. b. Give the turnaround time (total time from first arrival into ready state until cpu-burst is completed) of each process. c. Give the waiting time (total time spent in the Ready state) of each process. d. Give the average waiting time of all the processes. Which of these scheduling algorithm gives the smallest average waiting Time?

[2 marks]

What is Process? Draw Five State Process Model and Explain it. Page 1 of

[2 marks]

Give the functions of following UNIX commands: 1. grep 2. cat 3. cmp

[3 marks]

Explain concept of Demand Paging in memory management.

[4 marks]

What is Critical Section Problem and list the requirements to solve it. Write Peterson’s Solution for the same.

[7 marks]

What is deadlock? List the conditions that lead to deadlock.

[3 marks]

Explain Hypervisor.

[4 marks]

Explain Dining-philosophers Solution Using Monitors.

[7 marks]

What is interrupt? How it is handle by operating system.

[3 marks]

What is device driver? Explain its function in brief.

[4 marks]

Explain VMware ESXi architecture.

[7 marks]

What is called TLB?

[3 marks]

Describe RAID level 4.

[4 marks]

Explain the events that cause processes to be created.

[7 marks]

Write about Resource Allocation Graph algorithm.

[3 marks]

Write benefits of Virtual Machines.

[4 marks]

Write Banker’s Algorithm.

[7 marks]

Define following Terms: 1. Mutual Exclusion 2. Thrashing 3. Thread

[3 marks]

List Deadlock Recovery Techniques and explain one of them.

[4 marks]

What is Semaphore? Give the implementation of Bounded Buffer. Page 2 of

[2 marks]

Operating System and Virtualization — Winter 2021

Questions25