o m

r .c
pe m
p a c o
r r .
b pe
pa
b r
 o m
r .c
pe m
p a c o
r r .
b pe
pa
b r
 o m
r .c
pe m
p a c o
r r .
b pe
pa
b r
 o m
r .c
pe m
p a c o
r r .
b pe
pa
b r
 o m
r .c
pe m
p a c o
r r .
b pe
pa
b r
Roll No. Total No. of Pages : 02
Total No. of Questions : 16
BCA (2014 to 2018) (Sem.–4)
OPERATING SYSTEMS
Subject Code : BSBC-403
M.Code : 10068
Time : 3 Hrs. Max. Marks : 60

INST RUCT IONS T O CANDIDAT ES :

1. SECTION-A is COMPULSORY cons is ting of TEN questions carrying TWO marks
each.
2. SECTION-B c ontains SIX questions ca rrying TEN mark s each a nd students hav e
to attempt any FOUR questions .

SECTION-A

Write briefly :

o m
1.
c
Differentiate between application programs and system programs.

r .
2.
e
What are Threads? What are its applications?

p m
3.
a
What is Context Switching?

p c o
4.
r
What is CPU - I/O Burst Cycle?
r .
5. b
What is the difference between FIFO and Socket?
p e
6.
p a
Write two major advantages of Round Robin Scheduling.

7. What is Demand Paging?

b r
8. Briefly discuss any one page replacement algorithm.

9. What are the objectives of file management?

10. What is a Firewall? What is its purpose?

1 | M-10068 (S3)-297
 SECTION-B

11. Define Operating system. Why an operating system is called a resource - manager? What
are various types of operating systems? Which one you feel is better and why?

12. Define a Process. How it is different from a program? What is the relation between a
process and a program? Explain various processes states.

13. Define Thrashing. What are the reasons of thrashing and what are the solutions of
handling thrashing?

14. What is segmentation technique of memory management and discuss how it

implemented? Also differentiate between paged segmentation and segmentation with
paging.

15. Discuss in detail the various disk scheduling algorithms.

16. Discuss in detail the various directory structures.

o m
r . c
p e m
p a c o
r r .
b p e
p a
b r

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
page of Answer Sheet will lead to UMC against the Student.

2 | M-10068 (S3)-297
Roll No. Total No. of Pages : 02
Total No. of Questions : 07

BCA (2013 & Onward) (Sem.–4)

OPERATING SYSTEMS
Subject Code : BSBC-403
M.Code : 10068
Time : 3 Hrs. Max. Marks : 60

INSTRUCTION TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
each.
2. SECTION-B contains SIX questions carrying T EN marks each and a student has
to attempt any FOUR questions.

SECTION-A

1. Answer briefly :
o m
a) What are Application Programs?
.r c
e
b) What is multi user operating systems?
p m
a o
.r c
c) Discuss the address space in Threads.

r p
b
d) What is the purpose of socket?

e) Give main objectives of context switching.

p e
p a
f) Define Virtual memory concept.

g) Show the concept of Thrashing. br

h) What is disk scheduling?

i) List file access methods used in OS.

j) Write the functioning of Firewalls.

1 | M-10068 (S3)-1532
 SECTION-B

2. Explain the following :

a) Middle Layer Subsystems in OS

b) Shared Memory Model

3. What is thread management in operating system? Explain the applications of thread.

4. Explain the need of CPU Management. Which are the different scheduling schemes?

5. What is the importance of paging and segmentation in memory management? Explain

with diagram.

6. Define concept of File Operations. Give the process of directory structures and File
management.

7.
m
Discuss various system threats to Operating System. What is access control and
authentication?
o
.r c
p e m
a o
r p .r c
b p e
p a
b r

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
page of Answer Sheet will lead to UMC against the Student.

2 | M-10068 (S3)-1532
Roll No. Total No. of Pages: 02
Total No. of Questions: 07

BCA (2011 & Onwards) (Sem. – 4)

OPERATING SYSTEMS
M Code: 10068
Subject Code: BSBC-403
Paper ID: [B0242]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATES:
1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains SIX questions carrying TEN marks each and students have to
attempt any FOUR questions.

SECTION A

o m
.r c
1. Briefly answer the following:

m
a) Differentiate between Multi-programming and multi-processing systems.

p e
b) What do you mean by context switching?
o
a .r c
c) Differentiate between preemptive and non - preemptive process scheduling.

r p
d) Write short note on Threads.

e
b
e) Distinguish between logical address space and physical address space.
f) Briefly explain the inter-process communications.

a p
rp
g) Differentiate between internal and external fragmentation.

b
h) What are the various criteria for CPU scheduling?
i) What is virtual memory? What is its need?
j) Briefly discuss the hash table implementation of directory structure.

M-10068 Page 1 of 2
 SECTION B
10x4=40
2. What is an operating system? What is the need for an operating system? Discuss the major
functions of an operating system with examples.
3. Using the given information about the processes, calculate Average Waiting Time and
Average Turnaround Time of each process under following scheduling algorithms:
a) First Come First Served
b) Shortest Job First
c) Round Robin (With time slice of 4 units)

Process Burst Priority Arrival time

P1 19 3 0

P2 15 2 3

o m
.r c
P3 10 1 12

P4 6 4 12

P5 3 3

p e 15

o m
a .r c
4. Define and distinguish between paging and segmentation methods of memory management
giving suitable examples.
p
b r p e
5. What do you mean by a file system? Discuss the various file access methods in detail.

a
6. Discuss the following disk scheduling algorithms in brief giving their advantages and
disadvantages:
a) SSTF
b) C-SCAN
b rp
7. What are the various threats to security of a system? Elaborate in detail the different
mechanisms of protection and security.

M-10068 Page 2 of 2