A.

Short questions----2 marks each

1. Explain process synchronization.

2. Define the term Waiting time and Turnaround time in reference to

scheduling algorithms.

3. Differentiate between Internal and External Fragmentation.

4. Write two advantages of virtual memory concept.

5. Differentiate between seek time and rotational latency.

6. Explain the term file system in brief.

7. Write a short note on “Process Control Block”.

8. Explain various types of program threats.

9. What is segmentation?

10. What is system call? Explain the types of system call.

11. Elaborate the concept of threats with example

12. Port scanning is not an attack but rather a means for a cracker
to detect system vulnerabilities to attack. Discuss the vulnerability if it
occurred in send mail.

13. Differentiate between various topologies.

14. Elaborate Distributed message passing with example.

15. Differentiate between peer to peer and client server model.

16. What is Session Hijacking and How it can be prevented.

17. What is DDOs? Explain the difference between DDOS and DOS attack
18. Attacks which are aimed not at gaining information or stealing
resources but rather at disrupting legitimate use of system or facility are
known as which type of attacks. Explain the working of the attack.

B. Broad questions----5/10 marks each

1. Explain in detail the following CPU scheduling algorithms: a) FCFS b) Round

Robin

2. Define the term security. Explain various goals of security.

3. Define the term deadlock. Explain various necessary conditions for a

deadlock to occur. Explain in brief about deadlock prevention.

4. What is the need of Page replacement? Consider the following reference

string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Find the number of Page
Faults with FIFO, Optimal Page replacement and LRU with four free frames
which are empty initially. Which algorithm gives the minimum number of page
faults?

5. Explain in detail the concept of Multiprocessor Operating Systems.

6. Write a detailed note on paging scheme of memory management.

7. Explain the different types of operating system.

8. Explain Process Control Block. Draw the block diagram of process transition
states.

9. Difference between process and thread.

10. What do you mean by CPU scheduling? Discuss CPU/IO burst cycle.

11. What do you mean by RAID Structure? Also discuss different types of RAID
levels.

12. Write a short note on disk scheduling algorithm

13. What do you mean by directory structure? Also discuss different types of
directory structures.

14. Explain Banker's deadlock-avoidance algorithm with an illustration

15. Five batch jobs A to E arrive at same time. They have estimated running
times 10,2,6,8,4 minutes. Their priorities are 3,2,5,4,1 respectively with 5 being
highest priority. For each of the following algorithm determine mean process
turnaround time. Ignore process swapping overhead. Round Robin (q=3),
Priority Scheduling, FCFS, SJF.

16.Draw Four Gantt charts illustrating the execution of these processes using
FCFS, SJF, priority (a small priority number implies a higher priority), and Round
Robin (quantum=1) scheduling.

17. What do you mean by Deadlock Avoidance? Explain the use of Banker’s
Algorithm for Deadlock Avoidance with illustration.

18. What is Deadlock? List the conditions that lead to deadlock. How Deadlock
can be prevented? 3. What is Deadlock? Explain Deadlock prevention &
Avoidance.

18.Five batch jobs A to E arrive at same time. They have estimated running
times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively
with 5 being highest priority. For each of the following algorithm determine
mean process turnaround time. Ignore process swapping overhead. Round
Robin, Priority Scheduling, FCFS, SJF.

19. Explain the goals of Operating System Security.

20. Explain the Access metrics mechanism

21. Explain Protection Mechanism illustrating use of Protection Domain and

Access Control List
22. Explain the Trojan Horse and Trap doors program threats

Explain the following disk scheduling algorithm with examples. i)SSTF ii) SCAN
iii)LOOK

A virtual memory system has the following specification: Size of the virtual
address space=64k Size of the physical address space=4k Page size=512 Virtual
page# physical frame# 0 0 3 1 7 2 4 3 10 4 12 5 30 6 31 7 i)find all the virtual
addresses that will generate a page fault compute the main memory addresses
for the following virtual addresses. 24,3784,10250,30780

Name the different file allocation methods. Explain the linked allocation of file
implementation with merits and demerits.

Consider a logical address space of 8 pages of 1024 words each, mapped on to

a physical memory of 32 frames. how many bits are there in the logical
address? How many bits are there in the physical address?

What is critical section problem and what are the requirements that need to
be satisfied by any solution to critical section problem? Give a solution to a 2
process critical section problem.

3rd Unit :

What are the Goals, principles and domain of protection?

What is Access matrix, implementation of access matrix?

What is the program, system and network threat and types?

what is different between Peer to Peer & Client server ?

What is topology and types?

What is the difference between connection oriented and connectionless?

What is the difference between OSI and TCP/IP?

What is OSI layer/model, what are types/functionalities of layers?

What are the functions of the Transport Layer? Explain briefly and also name a
few applications based on this layer

Write a short note on the function of Session & Applications layer

What is the implication of Topology’ in a network? Draw the different types of

Topologies and list their advantages and disadvantages.

Differentiate between LAN, MAN, WAN in terms of range and place where they
are used?

Briefly explain the various kinds of program threats and system threats.

What are protection goals and principles?

Explain the terms ‘WORMS’ and ‘VIRUSES’ with reference to system threats

Describe the access matrix model used for protection purpose.

 Miscellaneous Questions:(5/10 marks)

1. Can a multithreaded solution using multiple user-level threads achieve better

performance on a multiprocessor system than on a single-processor system? Explain.
2. What resources are used when a thread is created? How do they differ from those
used when a process is created?
3. Is it possible to have a deadlock involving only a single process? Explain your
answer.
4. Consider the following snapshot of a system:
Allocation Max Available
ABCD ABCD ABCD
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656

Answer the following questions using banker’s algorithm:

a.) What is the content of the matrix Need?
b.) Is the system in a safe state?
c.) If a request from process P1 arrives for(0,4,2,0), can the request be granted
immediately?
5. Consider a system that allocates pages of different sizes to its processes. What are
the advantages of such paging scheme? What modifications to the virtual memory
system provide this functionality?
6. Consider a demand –paged computer system where the degree of multi-
programming is currently fixed at four. The system was recently measured to
determine of the CPU and the paging disk. The results are one of the following of
the CPU and the paging disk. The results are one of the following alternatives. For
each case, what is happening? Can the degree of multiprogramming be increased to
increase the CPU utilization? Is the paging helping?
a.) CPU utilization 13 percent; disk utilization 97%
 b.) CPU utilization 87 percent; disk utilization 3%
c.) CPU utilization 13 percent; disk utilization 3%
7. A simplified view of thread states is Ready, Running, and Blocked, where a thread
is either ready and waiting to be scheduled, is running on the processor, or is
blocked(i.e. is waiting for I/O) This is illustrated in figure. Assuming a thread is in
the running state, answer the following questions:
a.) Will the thread change state if it incurs a page fault? If so, to what new state?

Ready

Blocked Running

Figure: Thread state diagram

b.) Will the thread change state if it generates a TLB miss that is resolved in the page
table? If so, to new state?
c.) Will the thread change state if an address reference is resolved in the page table?
If so, to what new state?
8. In some systems, a subdirectory can be read and written by an authorized user, just
an ordinary files can be.
a.) Describe the protection problems that could arise.
b.) Suggest a scheme for dealing with each of these protection problems.
9. The access- control matrix can be used to determine whether a process can switch
from, say, domain A to domain B and enjoy the access privileges of domain B. Is this
approach equivalent to including the access privileges of domain B in those of
domain A?
10. Consider a computer system in which “computer games” can be played by students
only between 10 P.M and 6 A,M., by faculty members between 5 P.M. and 8A.M.,
and by the computer center staff at all times. Suggest a scheme for implementing this
policy efficiently.
11. In what circumstances is the system-call sequence fork () exec() most appropriate?
When is vfork() preferable?
12. Suppose that the following processes arrive for execution at the times indicated. Each
process will run for the amount of time listed. In answering the questions, use non-
 pre-emptive scheduling, and base all decisions on the information you have at the
time the decision must be made.

Process Arrival Time Burst Time

P1 0.0 8
P2 0.4 4
P3 1.0 1
a. What is the average turnaround time for these processes with the FCFS
scheduling algorithm?
b. What is the average turnaround time for these processes with the SJF
scheduling algorithm?
c. The SJF algorithm is supposed to improve performance, but notice that we
chose to run process P1 at time 0 because we did not know that two shorter
processes would arrive soon. Compute what the average turnaround time will be
if the CPU is left idle for the first 1 unit and then SJF scheduling is used.
Remember that processes P1 and P2 are waiting during this idle time, so their
waiting time may increase.
13. Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB,
and 125 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms
place processes of size 115 KB, 500 KB, 358 KB, 200 KB, and 375 KB (in order)?
Rank the algorithms in terms of how efficiently they use memory.
14. Consider a logical address space of 256 pages with a 4-KB page size, mapped
onto a physical memory of 64 frames.
a. How many bits are required in the logical address?
b. How many bits are required in the physical address?

MEMORY MANAGEMENT

1. What is Virtual Memory? Explain. (2 marks)

2. Compare Multiprogramming with Fixed Partition and multiprogramming

with Variable Partitions with diagram. (2 marks)
3. What is paging? What is Page Table? Explain the conversion of Virtual
Address to Physical Address in Paging with example. (5 marks)

4. Explain the concept of Segmentation for Memory Management. Explain why

combined Paged Segmentation is used with illustration. (2 marks)

5. For the Page Reference String:

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0. 1. 7, 0, 1 Calculate the Page Faults
applying (i)Optimal(ii)LRU and(iii)FIFO Page Replacement Algorithms for
a Memory with three frames. (5 /10 marks)

6. Explain the various page replacement strategies / algorithms. (5 marks)

7. Given memory partition of 100K, 500K, 200K, 300K, and 600K in order,
how would each of the First-fit, Best-fit and Worst-fit algorithms place the
processes of 212K, 417K, 112K and 426K in order? Which algorithm makes
the most efficient use of memory? Show the diagram of memory status in each
case. (5 / 10 marks)

8. What is segmentation? Explain it with example. (2 marks)

9. Consider the following page reference string:

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would
occur for the following replacement algorithms, assuming four frames?
Remember all frames are initially empty, so your first unique pages will all cost
one fault each. LRU replacement, FIFO replacement (5 marks)

10. Explain swapping in memory management. (2 marks)

11. Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst-

fit. (5 marks)

12. What is the difference between logical and physical address? (2 marks)

13. What is page fault and page replacement? (2 marks)

14. Given six memory partitions of 300 KB, 600 KB, 350 KB, 200
KB, 750 KB, and 125 KB (in order), how would the first-fit, best-fit,
and worst-fit algorithms place processes of size 115 KB, 500 KB, 358
KB, 200 KB, and 375 KB (in order)? Rank the algorithms in terms of
how efficiently they use memory. (5 marks)

15. Consider a logical address space of 256 pages with a 4-KB page
size, mapped onto a physical memory of 64 frames. (5 marks)
a. How many bits are required in the logical address?
b. How many bits are required in the physical address?

16. What is Fragmentation and its type (internal vs external). (2 marks)

17. What is the difference between contiguous and non-contiguous

memory allocation? (2 marks)

18. On a simple paging system with 2^24 bytes of physical memory,

256 pages of logical address Space, and a, page size of 2^10 bytes, how
many bits are in logical address? (5 marks)

DISK MANAGEMENT

1. Explain various Disk Scheduling Algorithms (FIFO, SSTF, SCAN,

LOOK, C-SCAN, C-LOOK) with illustration (5 marks)

2. Explain RAID level system (2 marks)

3. Explain RAID structure and all the levels (0-6)? (5 marks)

4. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The
drive is currently serving a request at cylinder 143, and the previous
request was at cylinder 125. The queue of pending requests, in FIFO order,
is - 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130. Starting from the
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
disk scheduling – FCFS, SCAN (elevator). (5 marks)

5. Disk requests come in to the disk for cylinders 10, 22, 20, 2, 40, 6 and 38.
A seek takes 6 msec per cylinder move. How much seek time is for Closest
 cylinder next algorithm? Initially arm is at cylinder 20. Starting track at
100.The queue of pending request is, 55,58,39,18,90,160,150,38,184 –
FCFS, SCAN (elevator), SSTF, C SCAN. (5/10 marks)

6. Suppose that a disk drive has 1000 cylinders, numbered 0 to 999. Assume
last request received was at track 345 and the head is moving towards
track 0. The queue of pending requests, in FIFO order, is
123,874,692,475,105,367.
Perform following scheduling algorithm. FIFO, SSTF, SCAN, LOOK,
C-SCAN, C-LOOK. (5 marks)

FILE MANAGEMENT

1) What are file attributes (name, identifier, type, location, size)? (Marks 2)

2) What is file types name and extension? (Marks 2)

3) What is difference between sequential and direct access method? (Marks

2)

4) What are the directory structures (single, two, three levels directory,
acyclic and general graph)? (Marks 5)

5) What is file sharing? (Marks 2)

6) What is the memory allocation in file? (Marks 2)

7) What is free disk management? (Marks 2)

8) What are file operations (creating a file, reading, writing, deleting)?

(Marks 2)