OPERATING SYSTEMS DESIGN (OSD) QUESTION BANK

QUESTION BANK

UNIT I

2 MARKS QUESTIONS

1. Write short note on Master Boot Record.

2.Explain the term inode.

3.Define swap space management.

4.What is difference between MBR and GRUB.

4 MARKS QUESTIONS

1    1. Explain the techniques used for free space management in a file system.

      2. Write briefly about file attributes, operations, types and structure.

      3. Explain  a) Open() b) read() c) write() d) close(). 

      4. Explain in detail monolithic and micro kernel.

J    6 MARKS QUESTIONS

1. Explain the neat diagram UNIX system architecture

2. Explain buffer management in UNIX.

3. Define operating system booting process in detail.

UNIT II

2 MARKS QUESTIONS

1. Define BASH in detail.

2. How we debug shell scripts?

3. Differentiate process and threads

4. What is wait for graph and its use in deadlock handling.

5. Define U area in reference to a process.

4 MARKS QUESTIONS

1. What is deadlock? What are necessary conditions for deadlock to occur?

2. Explain the concept of region. What does the region table entry consists of?

3. What is TLB? Why it is used?

4. Define UNIX process states in detail.

5. Define the terms  a) shell b) system calls for time

6. How we can manipulate process address space

7. Explain deadlock recovery in brief.

6 MARKS QUESTIONS

1. With given matrices explain how banker algorithm helps to determine safe state

Claim matrix C	Allocation matrix A	Resource vector R
R1       R2       R3 P1       3          2          2 P2       6          1          3 P3       3          1          4 P4       4          2          2	R1      R2       R3 P1            1        0          0 P2            6        1          2 P3            2        1           1 P4            0        0           2	R1    R2    R3             9       3       6

Available vector V: R1-0, R2-1, R3-1

2. Explain deadlock handling techniques in detail.

3. What is thread? Explain types of threads, advantages of threads and thread library in detail.

4. What is signal? How a process deals with signal?

5. Consider the following set of processes, with the length of cpu burst time given in milliseconds

Process	Burst Time	Priority
P1 P2 P3 P4 P5	10 1 2 1 5	3 1 3 4 2

The processes have assumed to have arrived in the order P1, P2, P3, P4 and P5 all at time 0

a)      Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms : FCFS, SJF, PRIORITY & ROUND ROBIN( quantum =1).

b)      Calculate average turn around time and average waiting time.

c)      Which of the algorithms result in the minimum average waiting time.

UNIT- III

2 MARKS QUESTIONS

1. Define memory management in operating systems.

2. Explain thrashing.

3. Define virtual memory concept in memory management.

4. Explain difference between compile time and load time.

5. What do you understand by logical address space and physical address space.

6. What is swapping in UNIX?

7. Explain android memory management in brief.

8. Define page faults and its types.

9. Explain Balady’s anomaly in brief

4 MARKS QUESTIONS

1.What do you understand by paging? Explain in brief with suitable diagram. Also define its advantages and disadvantages.

2. Differentiate between segmentation and paging.

3. Differentiate between internal fragmentation and external fragmentation.

4. How you can define requirements for memory management?

5. Explain data structures for demand paging.

6. Given memory partitions of  250K, 600K, 400K, 300K, 500K and 100K  (in order) how would each of the first-fit, Best-fit and Worst-fit algorithms take place processes of  232K, 419K, 99K, 576K, 315K (in order)? Which algorithm makes the most efficient use of memory?

6 MARKS QUESTIONS

1.Explain with diagram address translation in paging and segmentation system.

2. Consider the following page reference. Indicate page faults and calculate total number of page faults for optimal and LRU page replacement algorithms. The total number of available frames is 4.

              1, 2, 3, 2, 5, 6, 3, 4, 6, 3, 7, 3, 1, 5, 3, 6, 3, 4, 2, 4, 3, 4, 5, 1

3. Write an algorithm for the swapper in UNIX and explain the situations when the processes gets        swapped in and swapped out.

4. Define in brief a) LINUX memory management b) WINDOWS8 memory management.

5. If the page address stream is (2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2), and frame size is 3, identify the page       faults occurred using FIFO and LRU.