Scribd
Upload
10 views2 pages

OS Exam

Uploaded by

hfaymsgya9
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
10 views2 pages

OS Exam

Uploaded by

hfaymsgya9
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/ 2

Exam.

Code:0505
Sub. Code: 3875
2123
Master of Computer Applications
First Sernester
CS-2114: Operating Systems
Time allowed: 3 Hours Max. Marks: 80
is
NOTE: Atempt five questions in all, including Question No. IX (Unit-V) which
compulsory and selecting one question each from Unit i-IV.
I-X-X

UNIT -I
a) List five services provided by an operating system. Explain how each provides
convenience to the users. Explain also in which cases it would be impossible for user

level programs to provide these services.


b) What is process synchronization? Describe the following problems in the context of
process synchronization:
(i) Reader-Writer problem
(ii) Dining Philosophers problem (2x8)

II. a) What do you mean be process in a computer system? What are the different process

states? Explain the prucess life cycle in an operating system.


b) Suppose that the three processes P1, P2 and P3 arrive for execution at the times
indicated as (Pl, 0.0, 7), (P2, 0.5, 4), (P3, 1.2, 2) where the second component of the
-triple is the timearrival and the thind comnonent the burst time. Each process will
run the listed armount of time. Use ncn-preemptive scheduling, and base all decisions
on the information that you have at the time the decision must be made.
i) What is the average turnaround time for these processes with the FCFS
scheduling algorithm?
i) What is the average turraround time for these processes with the SJF
scheduling algorithm? (2x8)
UNIT - II
III. What is disk scheduling? How is it different from disk management? Assume that the
disk head is currently at cylinder 0. (Where the totai cylinders are from 0 to 199). The
disk queue requests are 75, 120,155, 80, 170, 60, and 100. Calculate the total distance (in
cylinders) moved by the disk arm by thè SCAN, LOOK and SSTF algorithms. (16)

IV. a) Consider u paging hardwie wit: a TLB. As Ur:e that the entire page table and all the
pages are in the physical memory. It takes 10milliseconds to search the TLB and 80
milliseconds to access the physical nemory. If the TLB hit ratio is 0.6, compute the
effective memory access time (in milliseconds).
b) Consider a demand paging system with four page frames (initiaily epty) and LkU
page replacement policy. Compute the page fault rate (defined as the ratio of number
of page faults to the number of memory accesses) for the page reference string:
7,2, 7, 3, 2, 5, 3, 4, 6, 7, 7, 1, 5, 6, 1. (2x8)
P.T.O.
Sub. Code: 3875
(2)
UNIT -III

ss is Linux shell different from Linux kernel? Elaborate the salient features of
V.
Bourne Again Shell(BASH).
L le an ext2 Linux file system, an inode consists ot 12 Direct Disk Block Addresses
(DBA), 1 single indirect DBA, 1doubly indirect DBA and 1 triple jndirect DBA The
DBArequires 32 bits and the Disk block size is 1KB. Then what is the maximum file
size possible? (2x8)

VI. a) Write a Bourne shell script that prints the name and size of all files in the current
directory that are larger than bytes, where x is a command line argument. For
example. if the progran is saved to afile called "bigfiles, and we run it is "bigfiles
4096", then it will list all files larger than 4096 bytes.
b) Write a shel script that reads the input file, translates all the characters in the input file
into the uppercase, and then stores the results in the specified output file. Synopsis:
upper -i infile -o outfile. (2x8)
UNIT -IV
VII. What is Operating system administration? Explain the role and functions of a system
administrator in Linux. As a Linux administrator, how do you (i) administer user and
group accounts (ii) perform backup and restore operations. Explain with examples. (16)

VIII. a) Write a 'C' programn to create a child process as that it can generate Fibonacci
sequence using command line arguments i.e. the number of the sequence will be
provided in the command line. Make sure that parent process waits for the child to
execute first.

b) For cach of the following pairs of terms, define each term, making sure to clarify the
key difference(s) between the two terms:
i)signal() and kill()
ii) read) and writer() (2x8)
UNIT - V
IX. Attempt the following:

a) Explain the difference between preemptive and non-preemptive (or co-operative)


CPUscheduling. Which scheme is 'the best' for a general purpose OS, would you
say? Justify!
b) A byte-addressable memory system has 48-bit virtual addresses and 32-bit
physical addresses, with 8KB pages. Find the number of virtual pages that each
process's page table has.
C) What is the importance of regular exDressions in string handling? Give examples.
d) What is Linux system run level? HoN do vou move between the run leveis
(including shutdown)? How do you boot your computer (running LInux) m
single user mode? (4x4)
X-X-X

You might also like