BCA-13
June Examination 2017
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 delimit your answer in one word, one sentence or maximum upto 30 words. Each question carries 2 marks.
What are the desirable characteristics of real time system?
What is bash?
Give an example of chmod command.
List five applications of multimedia.
Which scheduling algorithm suffers from starvation?
What is the full form of NTFS?
What do you mean by compression?
002
BCA-13 200 3 (P.T.O.)
BCA-13 200 3 (Contd.)
002
(viii) Why 'thread' is known as light weight process?
What is the use of ls command?
Define rotational latency.
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.
Write short note on distributed memory management.
What are the advantages of distributed system over centralized
system?
Write script, using case statement to perform basic math
operations like addition, subtraction, multiplication and division.
Differentiate between Su, Sudo and gksu.
Describe password file and shadow password file used to track
the user in Linux.
Discuss . NIS server and client in brief. Write steps of
implementing NIS server.
What do you mean by multiprocessor system? Distinguish
tightly coupled system and loosely coupled system.
Describe the architecture of sun network file system
with neat diagram.
BCA-13 200 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 question carries
20 marks.
10) What is remote procedure call? Explain its working. Also give
the advantages of using RPC in distributed system.
11) What do you mean by distributed file system? Discuss the
system. Design issues related to DFS.
12) Suppose that a disk drive has 200 cylinders, numbered 0 to
199. The head starts at cylinder 53. The queue of pending
requests; in FIFO order, is
98, 183, 37, 122, 14, 124, 65, 67
What is the total distance (in cylinder's) that the disk arm moves
to satisfy all the pending requests, for each of the following
disk-scheduling algorithms?
FIFO
SSTF
SCAN
13) What are the features of Linux OS? Explain the file and
directory structure of Linux OS.