MUFFAKHAM JAH COLLEGE OF ENGINEERING AND TECHNOLOGY

COMPUTER SCIENCE AND ENGINEERING

UNIT-1
Short type:
1. Define OS.
2. List the different functions performed by OS.
3. List or state the goals of OS.
4. Define a system call. OR What is the purpose/use of system call.
5. List the different types of system calls. OR List systems calls related to any one category.
6. Differentiate between system call and systems program.
7. List the different types of OS structures.
8. What is dual mode operation?
9. Define Swapping?
10. Define the following terms
a) Multiprogramming
b) Multitasking or Time sharing
c) Multiprocessing
d) Real Time Systems
Long type:
1. Describe OS w.r.t the functions performed by it.
2. Describe the different services provided by OS. OR Discuss the different OS services. OR Explain
the different OS services.
3. Explain about any one system calls. [ process/file/communication/device / information maintenance]
4. Describe or write about the different OS structures.
5. What are the different types of Operating Systems, explain in detail? Also specify the difference
between multiprogramming and multitasking operating system.

Unit-2
Short type:
1. Define a process.
2. Differentiate between a program and a process.
3. Define process control block (PCB). OR Define task control block.
4. List the different states of a process.
5. What is/state the purpose of medium term scheduler?
6. Define context switch.
7. Define thread.
8. Differentiate between a process and a thread.
9. List the different thread models.
10. Define CPU burst and I/O burst cycle.
11. What is the use of dispatcher module?
12. List the functions of dispatcher module.
13. Differentiate between pre-emptive and non-pre-emptive scheduling.
14. List the different CPU scheduling criteria.
15. Define a) CPU utilization b) Throughput c) Waiting time d) Turnaround time
Long type:
1. Explain process transition diagram. (Or) Draw the process state diagram and explain the transitions
among the various states
2. Describe the different scheduling queues using queuing-diagram representation for process
scheduling.
3. Write about/differentiate b/w the different types of schedulers. [Long term, short term, medium term]
4. Describe the different thread models.
5. For the given processes compute the TAT, WAT, ATAT, AWT using the given CPU scheduling
algorithms. [Would be given the required data set]
6. Discuss about multi-level queue and multi-level feedback queue processor/CPU scheduling.
Unit-3
Short type:
1. Define the terms:
a. IPC
b. Cooperating Process
c. Race Condition
d. Critical Section code
e. Semaphore
f. Mutual Exclusion
g. Busy-wait or spin-lock condition w.r.t semaphore
h. Deadlock
i. Safe state, safe sequence
j. Wait-for graph
k. Wait and signal
l. monitor
2. Explain the Process structure of Critical Section Problem solution.
3. List the Critical Section Problem Solution criteria.
4. State the problems associated with Semaphore usage.
5. List the criteria/ necessary conditions for deadlock occurrence.
6. Describe Resource Allocation Graph using an example.
Long type:
1. Explain Classical Synchronization Problem solutions:
Bounded Producer-Consumer
Reader’s-Writer
Dining Philosopher
2. Describe deadlock prevention approaches.
3. Write and explain Bankers algorithm for deadlock avoidance (or) Problem on this.
4. Describe deadlock detection and recovery mechanism.
5. Describe about inter process communication mechanisms in detail with block diagrams

Unit-4
Short type:
1. Define the terms:
a. Base – Limit registers usage
b. Address Binding
c. Absolute Addresses, relocatable Addresses
d. Logical vs. Physical addresses, Logical vs. Physical Address spaces.
e. Memory Management Unit/ Dynamic Loading Dynamic Linking
f. Use of relocation register
g. Paging vs Segmentation
i. Fragmentation, Internal vs. External Fragmentation
j. Compaction
k. Page Table
l. Inverted Page Table
m. Demand Paging(DP), Pure DP
m. Page Fault, Page replacement
n. Belady’s Anamoly
o. Thrashing
p. Locality of reference, Locality model
p. Working Set model
q. Dirty Bit
2. State the hardware support required for Paging.
Long type:
1. Explain Paging or/and Segmentation memory management technique.
2. Describe the different ways to structure Page Table.
3. Discuss the different ways to store the Page Table.
4. Explain how virtual memory implementation is done using demand paging.
5. Describe the steps involved to service a page fault.
6. Calculate the total number of page faults generated for the given page reference string using the
following page replacement algorithms: FIFO, LRU, Optimal, MRU, LFU or MFU.
7. Explain how thrashing is overcome using the working set model.
8. Explain/Problem on First fit / Best fit / Worst fit memory allocation methods

Unit-5
Short type:
1. Define or State or write about the following:
a. File b. File Access method c. File Operations d. Directory operations
e. Directory structures f. Directory implementation methods
g. List the allocation or disk block allocations methods for files. Or list the disk space allocation
methods for files
h. DMA i. Seek Time j. Rotational Latency k. FCB
2. List the methods for free space management with example.
3. What is RAID? What are its advantages
4. Differentiate blocking and non-blocking I/O
5. Differentiate random and sequential access of a file.
Long Type:
1. Explain File system structure in detail.
2. Explain the different space allocation methods for storing files on disks and the type of file access
they support.
3. For the given cylinder requests for a disk drive having n cylinders in the range x1..x2, calculate the
total arm distance moved in the serving the pending cylinder requests a1, a2, a3, a4, a5, a6, a7, a8, a9
using the following disk scheduling algorithms. FCFS, SSTF, SCAN, C-SCAN, LOOK, CLOOK.
(can be asked any of the algorithms)
4. Describe the disk space allocation methods for files with a neat diagram.
5. Describe the free-space management approaches with examples.
6. Explain the levels of RAID with a neat diagram.
7. Write about the on-disk and in-memory structures maintained to implement file system.
8. Discuss various directory structures with suitable examples.