0% found this document useful (0 votes)
21 views3 pages

Operating System

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views3 pages

Operating System

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

University Institute of Engineering & Technology

(Recognised Under Section 2(f) and 12B of UGC)


Kurukshetra University, Kurukshetra

THEORY EXAMINATION – JAN 2022 TIME – 4 Hrs.

B.TECH – ECE SEMESTER - VII


M.M. - 75

PAPER - ECO-11 SUBJECT- Operating System

INSTRUCTIONS TO BE FOLLOWED

 The candidates will be required to attempt All questions in Part-A and Part-B
(Compulsory Sections). Attempt any four questions from Part-C selecting at least one
from each unit.
 Allotted time for examination is 4 hours that includes time for downloading the
question paper, writing answers, scanning of answer sheets and uploading the sheets
on the Attendance Sheet Cum Answer Sheet Uploading google form.
 The PDF files should be saved as Roll No. and Subject Code.
 Maximum Page Limit should be 36 (Thirty Six) for attempting the question paper on
A4 sheets which could be downloaded and printed from the sample sheets given in
the UIET Website.
 Over-attemptation should be avoided.
 Handwriting should be neat and clean and diagrams should be clear and contrasted.
 The candidate should not write their Mobile No. otherwise Unfair Means Case will
be made.
 While attempting the paper, the candidate will use blue/black pen only.
 Before attempting the paper, the candidate will ensure that he/she has downloaded
the correct question paper. No complaint for attempting wrong question paper by the
candidate will be entertained.
 Candidate must ensure that he/she has put his/her signature on each page of the
answer sheet used by him/her. Answer sheet without the signature of the candidate
will not be evaluated.
 Candidate should ensure before submitting the google form that the correct answer
sheet has been uploaded.
 Attempt parts A, B & C separately. Do not inter-mix them. Write neatly & mention the
question number clearly.
PART-A (15 Marks)

Q. No. – 1 Answer the following questions. 15x1=15

(i) Explain in brief about process synchronization?

(ii) Define the term kernel. What are its functions?

(iii) Differentiate between Logical and Physical address space.

(iv) Explain the term Waiting time and Turnaround time in terms of CPU scheduling algorithms.
.
(v) What is the role of dispatcher?

(vi) Define resource. List some resources that a process might need for its execution.

(vii) What are the different types of operating systems?

(viii) How does the Semaphores help in the process Synchronization?

(ix) Add( 53+91 ) which flag is set?

(x) Define the following terms with respect to disk I/O – seek time and latency time.

(xi) Distinguish between I/O bound process and CPU bound process.

(xii) Write various goals of Security.

(xiii) Define the term file. List various attributes of a file.

(xiv) Define the term Disk Bandwidth.

(xv) What do you mean by Dead lock?

PART-B (20 Marks)

UNIT-I
2 Explain in detail the role of Operating system as a resource Manager. 5
UNIT-II
3 Explain about Inter Process communication. 5
UNIT-III
4 Explain about the Context Switch & Operations on processes? 5
UNIT-IV
5 What is Round Robin Scheduling? Illustrate with an example. Can it be useful for a 5
single user system?
PART-C (40 Marks)

UNIT-I
6 Explain different operations performed by the operating system. Explain system calls with 10
Examples.
7 Explain evolution of OS & its Structure & future trends? 10
UNIT-II
8 Explain PSW & Interrupt priority? 10
9 Explain in detail the concept of controlling I/O?. 10
UNIT-III
10 Define process. How many different states a process has? Explain when a process change a state 10
with a state diagram ?
11 Explain process state transition.& Schedulers? 10
UNIT-IV
12 Consider the following four processes, with the length of the CPU burst time given in 10
milliseconds.
Process Arrival Time(ms) Burst Time (ms)
P1 1 6
P2 1 5
P3 2 5
P4 2 3
Find Average Waiting Time and Turnaround time for given Process using FCFS and SJF?
13 Explain deadlock detection algorithm with an example. & explain resource allocation graph. 10

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy