PART A

1. List the services provided by an Operating System.

2. What is the Kernel?
3. What are the advantages of an Operating system?
4. What is meant by system call?
5. Illustrate the purpose of system programs/system calls.
6. Define process control block.
7. List the types of CPU Scheduling techniques.
8. Define Semaphore.
9. Compare wait () and signal().
10. What are the algorithms available for Deadlock avoidance?
11. What is meant by Page Fault?
12. What is Paging?
13. What is Compaction?
14. How is a physical address different from a Logical address?
15. Difference between External Fragmentation and Internal Fragmentation?
16. Enlist different types of the directory structure.
17. What is Seek Time?
18. Distinguish between file and directory.
19. What are different attributes of a file?
20. Why is Disk Scheduling necessary?
21. List the features of the Linux file system.
22. Outline the use of kernel modules in Linux.
23. What is concurrency?
24. What kind of tool is used to simulate Android applications?
25. List any four Mobile OS.

Part B
1. Explain the different operating system structures with a neat sketch.
2. Categorize the various types of system calls and explain with examples.
3. What is Interrupt and how it is handled by an operating system.
4. Interpret the concept of multiprocessor and Multicore organization.
5. Explain computer system Organization with a neat sketch.
6. Illustrate the basic functions of an operating system and the role of DMA in
leveraging its load.
7. Define the process and explain various process states with a suitable diagram
8. Analyze in detail the concept of Deadlock with relevant examples to explain its types.
Consider the following resource allocation graph:
P = {P1, P2, P3, P4} R = {R1, R2, R3}
E = {R1 --> P1, P1 --> R2, R2 --> P2, P2 --> R3, R3 --> P3, P3 --> R1, R1 --> P4}
resource type R1 has two instances;
resource type R2 has one instance
resource type R3 has one instance;
Draw a resource allocation graph and analyze the possibility of a deadlock.
9. Consider the following set of processes, with the length of the CPU burst time given
in ms. Draw Gantt charts illustrating the execution of these processes using FCFS,
SJF scheduling. Also, calculate average waiting time and average turnaround time for
each scheduling algorithms.

10. Define semaphore and explain how semaphore is used in Producer and Consumer
problem
11. Consider the following five processes, with the length of the CPU burst time given in
milliseconds.
Process Burst time
P1 8
P2 10
 P3 3
P4 7
P5 2
Consider the First come First serve (FCFS), Non-Pre-emptive Shortest Job First
(SJF), Round Robin (RR) (quantum=4ms) scheduling algorithms. Illustrate the
scheduling using a Gantt chart. Which algorithm will give the minimum average
waiting time? Discuss.
12. What is interprocess communication? Explain its type with suitable examples.
13. Explain any three-page replacement algorithm with an example. Compare the
algorithm concerning page faults.
14. Explain the Segmentation and Paging memory management scheme with a neat
diagram.
15. Explain the paging memory management scheme with a neat diagram. Identify the
advantages and disadvantages of the scheme.
16. Explain the Segmentation memory management scheme with a neat diagram. Identify
the advantages and disadvantages of the scheme.
17. Explain the various structures of the page table in detail.
18. Given memory partitions of 10KB, 50KB, 20KB, 30KB and 60KB (in order), how
would each of the first-fit, best-fit and worst-fit algorithms place processes 22KB,
47KB, 12KB and 46KB (in order)? Which algorithm makes the most efficient use of
memory?
19. Explain various directory structures with examples.
20. Examine the structure of mass storage with a neat diagram and explain its
functionality.
21. Discuss file concept, file operation and file type with suitable examples.
22. Compare the FCFS, SSTF and SCAN disk scheduling with suitable examples.
23. Discuss the various file access methods with suitable examples.
24. Describe in detail File Allocation methods with neat examples.
25. Discuss the design principles of Linux system
26. What are the core components of Android OS? Describe any three components in
detail
27. Explain the Unix file system with suitable example
28. Determine how two Android applications can share the same Linux user ID and the
VM?
29. Describe Android activity life cycle methods with a neat diagram
 30. Illustrate the components of the Linux system.

Part c
Compare various Operating Systems structures with its advantage and disadvantages
Explain the evolution of the operating system with a suitable example
 Consider the following snapshot of resource allocation at time t1.

 What is the content of the need matrix?

 Show that the system is not deadlock by generating one safe sequence
 At instance t, P2 makes one additional for instance of type C. Show that the system is
deadlocked if the request is granted. Write down deadlocked-processes

Explain in detail the solutions to classical problem synchronization.

Assume that there are 4-page frames that are initially empty. If the page reference
string is 4,3,3,4,5,6,3,4,2,1,3,2,4,5 find the number of page faults using the FCFS,
LRU and optimal replacement policy. Identify the best algorithm.
Explain the concept of demand paging in detail with a neat diagram.

Compare various file allocation methods with suitable diagrams.

Consider a disk queue with requests for I/O to blocks on cylinders
82,170,43,140,24,16,190. If the disk head starts at 50, find out the total head
movement for FCFS, SSTF, SCAN, C-SCAN and LOOK scheduling. Analyze the
total head movement and find the best scheduling algorithm.

Analyze the requirements needed to become a Linux System Administrative

Explain SDK framework of Mobile OS.