BCA-13
December Examination 2016
BCA Pt. III Examination
Operating System II
Paper BCA-13
Time 3 Hours Max. Marks 100
Note: The question paper is divided into three sections B and C. Write answers as per given instructions.
Section A 10 × 2 20
(Very Short Answer Questions)
Note: Answer all questions. As per the nature of the question you delimit your answer in one word, one sentence or maximum upto 30 words. Each question carries 2 marks.
If a process is executing in its critical section, then no other processes can be executing in their critical section. This is known as.
What is Firmware?
What is Dispatcher?
Name five scheduling criteria's.
Name different modes of Distributed Computing.
What is Context Switch?
002
BCA-13 100 3 (P.T.O.)
BCA-13 100 3 (Contd.)
002
When two or more processes attempt to access the
same resource simultaneously. Name the problem which
occurs.
(viii) Name features of Concurrency Control in Distributed
Computing Environment.
What "sudo" command do in Linux?
Why the "root" is called root?
Section B 4 × 10 40
(Short Answer Questions)
Note: Answer any four questions. Each answer should not
exceed 200 words. Each question carries 10 marks.
Differentiate between a process and a programme.
What are the types of files system in the Linux?
What is the difference between listing the contents of
directory play with Is and Is
How do you do number comparison in shell scripts? Give an
example.
Differentiate between su, dudo and gksu.
Explain chmod command with syntax and example. A file
has got protection 744 (octal). What protections does it really
have?
Discuss NIS server and client in brief. Write steps of
implementing NIS server.
Explain the features of Concurrency Control in Distributed
Computing Environment.
BCA-13 100 3
002
Section C 2 × 20 40
(Long Answer Questions)
Note: Answer any two questions. You have to delimit your each
answer maximum upto 500 words. Each carries 20 marks.
10) What are the desirable issues in IPC by Message Passing and
Synchronization?
11) What are the main issues involve in the design of a distributed
system?
12) Write script of determine whether given file exist or not, file
name is supplied as command line argument, also check for
sufficient number of command line argument.
13) Suppose that a disk drive has 500 cylinders, numbered 0 to
499. The drive is currently serving a request at cylinder 123,
and the previous request was at cylinder 105. The queue of
pending requests, in FIFO order, is
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
Starting from a current head position, what is the total
distance (in cylinders) that the disk arm moves to satisfy
all the pending requests, for each of the following diskscheduling
algorithms?
FIFO SSTF SCAN C-SCAN