CS3451 INTRODUCTION TO OPERATING SYSTEMS

UNIT I INTRODUCTION

Computer System - Elements and organization; Operating System Overview - Objectives

and Functions - Evolution of Operating System; Operating System Structures – Operating
System Services - User Operating System Interface - System Calls – System Programs -
Design and Implementation - Structuring methods.

PART – A

1. What is an operating system? [CO1,LOT,K1]

2. List the services of operating system function. [CO1,LOT,K1]
3. List and briefly define the four main elements of a computer. [CO1,LOT,K1]
4. What is an interrupt? [CO1,LOT,K1]
5. Define cache memory. [CO1,LOT,K1]
6. What are the three objectives of an OS design? [CO1,LOT,K1]
7. List the techniques of I/O operation. [CO1,LOT,K1]
8. Define the term locality of reference. [CO1,LOT,K1]
9. List the types of system call. [CO1,LOT,K1]
10. What is Boot strapping? [CO1,LOT,K1]
11. State the difference between Monolithic and Microlithic. [CO1,LOT,K1]
12. What is the purpose of system programs? [CO1,LOT,K1]
13. What does the CPU do when there are no user programs to run? [CO1,LOT,K1]
14. Compare and contrast DMA and cache memory. [CO1,LOT,K2]
15. Why API’s need to be used rather than system calls? [CO1,LOT,K1]
16. Define Real time systems. [CO1,LOT,K1]
17. Mention the categories of system programs. [CO1,LOT,K1]
18. What are the advantages of peer to peer systems over client-server [CO1,LOT,K1]
systems?
19. Outline the Traditional UNIX system structure. [CO1,LOT,K2]
20. Define GUI. [CO1,LOT,K1]
 PART – B &C

1. Describe in detail about Elements and Organization of a computer [CO1,HOT,K6]

system.
2. Explain the various structures of an operating system. [CO1,HOT,K5]
3. Discuss the following: [CO1,HOT,K6]
i) Views of an OS.
ii) Objectives and functions of OS.
4. Describe evolution of operating system. [CO1,HOT,K6]
5. Discuss about direct memory access in detail. [CO1,HOT,K6]
6. Give reason why caches are useful. What problems do they solve? [CO1,HOT,K4]
What problems do they cause? If a cache can be made as large as
the device for which it is caching why not make it that large and
eliminate the device?
7. Discuss about Operating system services. [CO1,HOT,K6]
8. Explain about User operating system interface with neat sketch. [CO1,HOT,K5]
9. Discuss about various system calls and in detail. [CO1,HOT,K6]
10. Explain the following: [CO1,HOT,K5]
i) System programs
ii) OS design and implementation
 UNIT II PROCESS MANAGEMENT

Processes - Process Concept - Process Scheduling - Operations on Processes - Inter-

process Communication; CPU Scheduling - Scheduling criteria - Scheduling algorithms:
Threads - Multithread Models – Threading issues; Process Synchronization - The
Critical-Section problem - Synchronization hardware – Semaphores – Mutex - Classical
problems of synchronization - Monitors; Deadlock - Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock.

PART – A

1. Define a Process. [CO2,LOT,K1]

2. Define context switch. [CO2,LOT,K1]
3. What is medium term scheduling? [CO2,LOT,K1]
4. Why thread is called a weight process? [CO2,LOT,K1]
5. Differentiate between user level threads and kernel level threads. [CO2,LOT,K2]
6. Define multithreading. What are the benefits of multithreading? [CO2,LOT,K1]
7. What do you mean by short term scheduler? [CO2,LOT,K1]
8. List the various states of process with neat diagram. [CO2,LOT,K1]
9. Define PCB. [CO2,LOT,K1]
10. Give the necessary conditions for deadlock to occur. [CO2,LOT,K1]
11. What is IPC? [CO2,LOT,K1]
12. Define deadlock. [CO2,LOT,K1]
13. What is starvation? [CO2,LOT,K1]
14. List the criteria used for CPU scheduling. [CO2,LOT,K1]
15. State Mutual Exclusion. [CO2,LOT,K1]
16. Define throughput and turnaround time. [CO2,LOT,K1]
17. Differentiate between preemptive and non-preemptive scheduling. [CO2,LOT,K2]
18. Define race condition. [CO2,LOT,K1]
19. What is a resource allocation graph? [CO2,LOT,K1]
20. Distinguish between CPU and I/O bounded processes. [CO2,LOT,K2]
 PART – B &C

1. Explain briefly about Inter Process Communication. [CO2,HOT,K5]

2. Discuss how scheduling algorithms are selected for a system. What [CO2,HOT,K6]
are the criteria considered?
3. Explain about various CPU scheduling algorithms with suitable [CO2,HOT,K5]
examples.
4. Describe in detail about Process scheduling. [CO2,HOT,K6]
5. Explain the following: [CO2,HOT,K5]
i) Process creation
ii) Process termination
6. Discuss about threading models and threading issues in detail. [CO2,HOT,K6]
7. Write a short note on readers-writers problem and dining [CO2,HOT,K4]
philosopher’s problem in detail.
8. Discuss about Banker’s algorithm with an example. [CO2,HOT,K6]
9. Explain how a system can recover from deadlock. [CO2,HOT,K5]
10. Briefly describe about semaphores and monitors. [CO2,HOT,K6]
11. Explain the following: [CO2,HOT,K5]
i) Deadlock Prevention
ii) Deadlock Detection
 UNIT III MEMORY MANAGEMENT

Main Memory – Swapping – Contiguous Memory Allocation – Paging – Structure of the

Page Table Segmentation, Segmentation with paging; Virtual Memory – Demand Paging
– Copy on Write – Page Replacement – Allocation of Frames –Thrashing.

PART – A

1. Define cache. [CO3,LOT,K1]

2. What is address binding? [CO3,LOT,K1]
3. Define MMU. [CO3,LOT,K1]
4. State Logical address space and physical address space. [CO3,LOT,K1]
5. What do you mean by dynamic loading? [CO3,LOT,K1]
6. What is swapping? [CO3,LOT,K1]
7. List the disadvantages of contiguous memory allocation. [CO3,LOT,K1]
8. Differentiate between external and internal fragmentation. [CO3,LOT,K2]
9. Explain the basic method of paging. [CO3,LOT,K1]
10. What is TLB? List the uses of TLB. [CO3,LOT,K1]
11. What is lazy swapper? [CO3,LOT,K1]
12. How can you calculate Effective Memory Access Time? [CO3,LOT,K1]
13. State Demand paging. [CO3,LOT,K1]
14. List the various page replacement algorithms. [CO3,LOT,K1]
15. What is Virtual memory? [CO3,LOT,K1]
16. What do you mean by page fault? [CO3,LOT,K1]
17. Define Compaction. [CO3,LOT,K1]
18. What is meant by Belady’s anomaly? [CO3,LOT,K1]
19. What is meant by thrashing? [CO3,LOT,K1]
20. What is Zero-fill-on-Demand? [CO3,LOT,K1]
 PART – B &C

1. Discuss about Main memory in detail. [CO3,HOT,K6]

2. Explain the concept of Swapping. [CO3,HOT,K5]

3. Describe in detail about Contiguous memory allocation. [CO3,HOT,K6]

4. Explain the concept of paging and its hardware support. [CO3,HOT,K5]

5. Outline the various structure of page table with neat diagram. [CO3,HOT,K2]

6. Write a short note on segmentation and segmentation with paging. [CO3,HOT,K5]

7. Explain the concept of demand paging with neat sketch. [CO3,HOT,K5]

8. Discuss about the page replacement algorithms in detail. [CO3,HOT,K6]

9. Discuss the given memory management techniques. [CO3,HOT,K6]
i) Allocation of frames
ii) Translation Look-aside Buffer

10. Explain the cause of thrashing and working set model with a neat [CO3,HOT,K5]
diagram.
 UNIT IV STORAGE MANAGEMENT

Mass Storage system – Disk Structure - Disk Scheduling and Management; File-System
Interface - File concept - Access methods - Directory Structure - Directory organization -
File system mounting - File Sharing and Protection; File System Implementation - File
System Structure - Directory implementation - Allocation Methods - Free Space
Management; I/O Systems – I/O Hardware, Application I/O interface, Kernel I/O
subsystem.

PART – A

1. Define a mass storage structure. [CO4,LOT,K1]

2. What are the levels of file system? [CO4,LOT,K1]
3. What is File? [CO4,LOT,K1]
4. List the various file attributes. [CO4,LOT,K1]
5. What are the various file operations? [CO4,LOT,K1]
6. What is a directory? [CO4,LOT,K1]
7. Mention the operations that can be performed on a directory. [CO4,LOT,K1]
8. List the different accessing methods of a file. [CO4,LOT,K1]
9. What are the most common schemes for defining the logical [CO4,LOT,K1]
structure of a directory?
10. Define UFD and MFD. [CO4,LOT,K1]
11. Give the allocation methods of a disk space. [CO4,LOT,K1]
12. List the pros and cons of contiguous allocation. [CO4,LOT,K1]
13. What is garbage collection? [CO4,LOT,K1]
14. Define polling. [CO4,LOT,K1]
15. Differentiate between rotational latency and disk bandwidth. [CO4,LOT,K2]
16. List the various disk scheduling algorithms. [CO4,LOT,K1]
17. What is spooling? [CO4,LOT,K1]
18. Give the importance of swap space management. [CO4,LOT,K1]
19. How does DMA increase system concurrency? [CO4,LOT,K1]
20. What is double buffering? [CO4,LOT,K1]
 PART – B &C

1. Explain the various disk scheduling algorithms with example. [CO4,HOT,K5]

2. Write a short note on disk management. [CO4,HOT,K5]

3. Explain the following: [CO4,HOT,K5]

i) File types
ii) File attributes and
iii) File operations
4. Explain about various file accessing methodology. [CO4,HOT,K5]

5. Discuss about the various file directory structures with neat sketch. [CO4,HOT,K6]

6. Briefly explain about file sharing and file protection. [CO4,HOT,K5]

7. Explain the concept of file system implementation. [CO4,HOT,K5]

8. Describe in detail about file allocation techniques. [CO4,HOT,K6]

9. Discuss about free space management and list its advantages and [CO4,HOT,K6]
disadvantages.
10. Explain about I/O systems in detail. [CO4,HOT,K5]
 UNIT V VIRTUAL MACHINES AND MOBILE OS

Virtual machines – History, Benefits and Features, building blocks, Types of Virtual
machines and their implementations, Virtualization and Operating System components;
Mobile OS- iOS and Android.

PART – A

1. Define virtualization. [CO5,LOT,K1]

2. List out the characteristics of virtualization. [CO5,LOT,K1]
3. Mention the types of virtualization. [CO5,LOT,K1]
4. What are the requirements of virtualization? [CO5,LOT,K1]
5. What are the different types of mode in VM? [CO5,LOT,K1]
6. Define Emulation. [CO5,LOT,K1]
7. What is para virtualization? [CO5,LOT,K1]
8. Explain the categories of I/O devices. [CO5,LOT,K2]
9. List out the functions of I/O. [CO5,LOT,K1]
10. What are the two main types of hypervisors? [CO5,LOT,K1]
11. Define VM cloning. [CO5,LOT,K1]
12. Specify the key components of VM infrastructure. [CO5,LOT,K1]
13. What is live migration? [CO5,LOT,K1]
14. What are the pros and cons of iOS? [CO5,LOT,K1]
15. List the advantage and disadvantages of Android OS. [CO5,LOT,K1]
16. What are the features of Android OS? [CO5,LOT,K1]
17. What are the different versions of Android OS that you remember? [CO5,LOT,K1]
18. Name the language supported for Android development. [CO5,LOT,K1]
 PART – B &C

1. Describe the benefits and features of VM. [CO5,HOT,K6]

2. Explain the detailed note on Virtualization and its types. [CO5,HOT,K5]

3. Explain the building blocks of VM. [CO5,HOT,K5]

4. Discuss about Virtualization and OS components in detail. [CO5,HOT,K6]

5. Explain the following: [CO5,HOT,K5]
i) Para virtualization
ii) Emulation
6. Discuss the features of iOS in detail. [CO5,HOT,K6]
7. Explain the architecture of Android with neat sketch. [CO5,HOT,K5]