Download GTU (Gujarat Technological University Ahmedabad) B.Tech/BE (Bachelor of Technology/ Bachelor of Engineering) 2020 Summer 4th Sem 2140702 Operating System Previous Question Paper
Seat No.: ________
Enrolment No.___________
GUJARAT TECHNOLOGICAL UNIVERSITY
BE - SEMESTER? IV EXAMINATION ? SUMMER 2020
Subject Code: 2140702 Date:26/10/2020
Subject Name: Operating System
Time: 10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
MARKS
Q.1
(a) Define following terms:
03
1) Starvation
2) Process
3) Mutual Exclusion
(b) Explain the different types of operating system.
04
(c) Explain PCB with all parameters in details.
07
Q.2
(a) Explain different services provided by operating system.
03
(b) Differentiate between process and thread.
04
(c) Explain the IPC Problem known as Dining Philosopher Problem.
07
OR
(c) Explain IPC Problem ? Readers & Writers Problem.
07
Q.3
(a) Discuss in brief different types of scheduler.
03
(b) What is deadlock? Define necessary conditions that lead to
04
deadlock.
(c) Assume you have following jobs to execute with one processor.
07
Apply shortest job first with preemptive scheduling algorithm.
Process Burst time
Arrival Time
0
8
0
1
4
1
2
9
2
3
5
3
a. Dra
w Gantt chart for process execution.
b. What is the average turnaround time?
c. What is the average wait time?
OR
Q.3
(a) List parameters to be considered while selecting scheduling
03
algorithms.
(b) What is semaphore? Describe types of semaphore.
04
(c) Explain the use of Banker's algorithm for multiple resources for
07
deadlock avoidance with illustration.
Q.4
(a) Differentiate between preemptive and non preemptive
03
scheduling algorithm.
(b) Define deadlock. Describe deadlock prevention in detail.
04
(c) Write short note: RAID levels.
07
1
OR
Q.4
(a) Explain file attributes in detail.
03
(b) Explain the following UNIX commands
04
1. Grep
2. Chmod
(c)
What is Paging? Explain paging mechanism in MMU with
07
example.
Q.5
(a) What is thrashing? Explain it with respect to degree of
03
multiprogramming.
(b) Define fragmentation. Describe types of fragmentation.
04
(c) Explain continuous memory allocation algorithms:
07
1) First-fit 2) Best-fit 3) Worst-fit
OR
Q.5
(a) Describe any one page replacement algorithm.
03
(b) Explain working set model.
04
(c) Explain any two File Allocation Methods from the following: (i)
07
Contiguous Allocation (ii) Linked Allocation (iii) Indexed
Allocation
*************
2
This post was last modified on 04 March 2021