Built-in Objects

Interacting with The Browser

Windows and Frames
Document Object Model
Event Handling
Forms
Cookies
Handling Regular Expression
Client-Side Validation
 Nagarjuna College of Information Technology
Shankhamul -09, Lalitpur
SET - A Pre-Board Examination 2081
Bachelor in Computer Applications Full Marks: 60
Course Title: Operating System Pass Marks: 24
Code No: CACS 251 Time: 3 hours
Semester: IV
1.
Name:………………………………………….. Roll No:…………
Candidates are required to answer the questions in their own words as far as possible.
Group A
1. Circle (0) the correct answer. 10×1=10
i) Which of the following does not contain PCB?
a) code b) data c) stack d) bootstrap program
ii) The Test and Set instruction in executed:
a) Atomically b) periodically c) after a particular process d) none of these
iii) How circular wait condition can be prevented?
a) By using pipes b) by using threads
c) by resource grant on all or none basis d) by defining linear ordering of resource type.
iv) Which process can be affected by other processes executing in the system?
a) Parent process b) Init process c) cooperating process d) Child Process.
v) External fragmentation will not occur when?
a) first fit b) worst fit
c) best fit d) No matter which algorithm is used, it will always occur
vi) why is one-time password safe?
a) it is easy to generated b) it is different for every access
c) it cannot be shared d) it is complex encrypted password.
vii) How process on the remote system are identified.
a) host id b) host name and identifier
c)identifier d) process id
viii) In distributed system each process has its own:
a) Local memory b) clock
c) both local memory and clock d) none of these
ix) The main memory accommodates
a) CPU b) user processes c) OS d) all of the mention
x) In Unix, which system call creates the new process?
a) fork b) new
c) create d) none of the mentioned

 Nagarjuna College of Information Technology
Shankhamul -09, Lalitpur
SET - B Pre-Board Examination 2081
Bachelor in Computer Applications Full Marks: 60
Course Title: Operating System Pass Marks: 24
Code No: CACS 251 Time: 3 hours
Semester: IV
Name:………………………………………….. Roll No:…………
2.

Candidates are required to answer the questions in their own words as far as possible.
Group A
1. Circle (0) the correct answer. 10×1=10
i) What does OS X have?
a) Micro kernel b) monolithic kernel c) hybrid kernel d) monolithic kernel with
modules
ii) Which of the following is not the valid state of the thread?
a) new b) running
c) parsing d) blocked
iii) How circular wait condition can be prevented?
a) By using pipes b) by using threads
c) by resource grant on all or none basis d) by defining linear ordering of resource type.
iv) Which process can be affected by other processes executing in the system?
a) Parent process b) Init process
c) cooperating process d) Child Process.
v) The signal operations of the semaphore basically works on the basic system calls
a) wake-up() b) continue
c) start d) getup()
vi) Why is one-time password safe?
a) it is easy to generated b) it is different for every access
c) it cannot be shared d) it is complex encrypted password.
vii) How process on the remote system are identified.
a) host id b) host name and identifier
c)identifier d) process id
viii) In distributed system each process has its own:
a) Local memory b) clock
c) both local memory and clock d) none of these
ix) The main memory accommodates
a) CPU b) user processes c) OS d) all of the mentioned
x) Which of the following is not a major reason for building distributed systems?
a) Resource sharing b) Computation speedup
c) Reliability d) simplicity

 Nagarjuna College of Information Technology
Shankhamul -09, Lalitpur
SET - A Pre-Board Examination 2081
Bachelor in Computer Applications
Full Marks: 60
Course Title: Operating System
Pass Marks: 24
Code No: CACS 251
Time: 3 hours
Semester: IV
Candidates are required to answer the questions in their own words as far as
possible.
Group B
Short Answer Questions (Any SIX):
6×5=30
1. What is an operating system? Explain the functions of operating system.
2. Define the term semaphore. How does semaphore help in dining philosopher
problem?
3. What is system call? Discuss process of handling system calls briefly.
4. A system has two process and three resource. Each process needs a maximum of two
resources. Is deadlock possible? Explain with example.
5. Differentiate between internal and external fragmentation? Suppose that we have
memory of 100 MB with 5 partitions of size 150KB, 200KB, 250KB, 100KB and
300KB. Where the processes A and B of size 175KB and 125KB will be loaded, if we
used best-fit and worst-fit strategy?
6. Given references to the following pages by a program,
0,9,0,1,8,1,8,7,8,7,1,3,8,2,7,8,3,4,8,3 how many page fault will occur if the program
has three page frames for each of the following algorithms a) FIFO b) LRU
7. What is file? Explain how access control matrix provides resource protection that may
access process.
8. What do you mean by one-time password in authentication? How worms are differing
from virus.

Group C
Long Answer Questions (Any TWO):
2×10=20
9. What kind of problem arises with sleep and wake-up mechanism of achieving mutual
exclusion? Explain with suitable code snippet.
10. Write CPU scheduling criteria. For the processes listed in following table, draw Gannt
chart illustrating their execution and calculate average waiting time and turnaround
time using
a) first come first serve
b) long remaining time next
c) Round Robin (quantum = 1 sec)
 d) priority
Proc AT BT Priority
esses
P0 0.0 8 3
p1 2.01 7 1
p2 3.01 2 4
p3 3.02 2 2
11. Define term seek time and rotational delay in desk scheduling. Suppose that a disk has
100 cylinders, numbered 0 to 99. the drive is currently serving a request at cylinders
44 and previous request was at cylinder 26. the queue of pending request, in FIFO
order is: 86, 70, 13, 74, 48, 9, 22, 50, 30 Starting from the current head position, what
is total distance that the disk arm moves to satisfy all pending request for each of
following disk scheduling algorithms? a) FCFS b) SSTF c) SCAN d)LOOK

 Nagarjuna College of Information Technology
Shankhamul -09, Lalitpur
SET - B Pre-Board Examination 2081
Bachelor in Computer Applications
Full Marks: 60
Course Title: Operating System
Pass Marks: 24
Code No: CACS 251
Time: 3 hours
Semester: IV
Candidates are required to answer the questions in their own words as far as
possible.
Group B
Short Answer Questions (Any SIX):
6×5=10
1. What is an operating system? Explain the functions of operating system.
2. Define the term semaphore. How does semaphore help in dining philosopher
problem?
3. What is the importance of paging and segmentation in memory management?
4. A system has two process and three resource. Each process needs a maximum of two
resources. Is deadlock possible? Explain with example.
5. Differentiate between internal and external fragmentation? Suppose that we have
memory of 100 MB with 5 partitions of size 150KB, 200KB, 250KB, 100KB and
300KB. Where the processes A and B of size 175KB and 125KB will be loaded, if we
used best-fit and worst-fit strategy?

6. Given references to the following pages by a program,

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 .how many page fault will occur if
the program has three page frames for each of the following algorithms a) FIFO b)
LRU
7. What is file? Explain how access control matrix provides resource protection that may
access process.
8. Discuss various system threats to operating system. What is access control and
authentication?
 Group C
Long Answer Questions (Any TWO):
2×10=20
9. Explain the need of CPU management. Which are the different scheduling schemes?
10. Write CPU scheduling criteria. For the processes listed in following table, draw Gannt
chart illustrating their execution and calculate average waiting time and turnaround
time using
a) first come first serve
b) long remaining time next
c) Round Robin (quantum = 1 sec)
d) priority
Proc AT BT Priority
esses
P0 0 4 2
p1 1 3 3
p2 2 1 4
p3 3 5 5
p4 4 2 5
11. Define term seek time and rotational delay in desk scheduling. Suppose that a disk has
100 cylinders, numbered 0 to 99. the drive is currently serving a request at cylinders
44 and previous request was at cylinder 26. the queue of pending request, in FIFO
order is: 86, 70, 13, 74, 48, 9, 22, 50, 30 Starting from the current head position, what
is total distance that the disk arm moves to satisfy all pending request for each of
following disk scheduling algorithms? a) FCFS b) SSTF c) CSCAN d)CLOOK
