‭QUESTION BANK‬

‭ ourse Code : AL3452‬

C
‭Course Name : Operating Systems‬

‭ NIT I INTRODUCTION‬
U
‭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.‬

‭UNIT 1 - INTRODUCTION‬

‭Part A (Short Answer Questions with Answers & Time Test)‬

‭1.‬ ‭List and briefly define the four main elements of a computer.‬‭(Nov/Dec 2024)‬
‭Answer:‬‭The four main elements of a computer are:‬

‭ ‬ ‭Processor (CPU):‬‭Executes instructions and controls‬‭other components.‬

○
‭○‬ ‭Main Memory (RAM):‬‭Stores data and instructions temporarily‬‭for quick access.‬
‭○‬ ‭I/O Modules:‬‭Interface for input and output devices.‬
‭○‬ ‭System Bus:‬‭Communication pathway between CPU, memory,‬‭and peripherals.‬
‭2.‬ ‭Define the two main categories of processor registers.‬‭(Nov/Dec 2024)‬
‭Answer:‬

‭○‬ U ‭ ser-visible registers:‬‭Used by the programmer for storing data, addresses, and‬
‭condition codes.‬
‭○‬ ‭Control & Status registers:‬‭Used by the CPU to manage‬‭execution and store processor‬
‭state information.‬
‭3.‬ ‭In general terms, what are the four distinct actions that machine instructions can specify?‬
‭(Apr/May 2024)‬
‭Answer:‬

‭ ‬ ‭Data transfer:‬‭Move data between memory and registers.‬

○
‭○‬ ‭Arithmetic and logic operations:‬‭Perform computations.‬
‭○‬ ‭Control operations:‬‭Alter program execution (e.g.,‬‭jumps, branches).‬
‭○‬ ‭I/O operations:‬‭Communicate with input/output devices.‬
‭4.‬ ‭What is an Interrupt?‬‭(Apr/May 2024)‬
‭Answer:‬‭An interrupt is a signal sent to the processor‬‭to temporarily halt current execution and‬

‭1‬
 ‭handle an urgent task before resuming.‬

‭5.‬ ‭How are multiple interrupts dealt with?‬‭(Nov/Dec 2023)‬

‭Answer:‬

‭ ‬ ‭Priority-based handling:‬‭Higher priority interrupts‬‭are processed first.‬

○
‭○‬ ‭Interrupt masking:‬‭Disables lower priority interrupts‬‭until the current one is serviced.‬
‭○‬ ‭Vectored interrupts:‬‭Uses an interrupt vector table‬‭for efficient handling.‬
‭6.‬ ‭What characteristics distinguish the various elements of a memory hierarchy?‬‭(Nov/Dec‬
‭2023)‬
‭Answer:‬‭The memory hierarchy is distinguished by:‬

‭ ‬ ‭Speed:‬‭Registers > Cache > RAM > Disk Storage.‬

○
‭○‬ ‭Cost per bit:‬‭Registers are the most expensive, disks‬‭are the cheapest.‬
‭○‬ ‭Capacity:‬‭Registers hold the least data, disks hold‬‭the most.‬
‭7.‬ ‭What is Cache Memory?‬‭(Apr/May 2023)‬
‭Answer:‬‭Cache memory is a small, high-speed memory‬‭located close to the CPU that stores‬
‭frequently accessed data to reduce memory access time.‬

‭8.‬ ‭List and briefly define three techniques of I/O operation.‬‭(Apr/May 2023)‬
‭Answer:‬

‭ ‬ ‭Programmed I/O:‬‭CPU manages I/O directly, leading‬‭to inefficiency.‬

○
‭○‬ ‭Interrupt-driven I/O:‬‭CPU continues execution while‬‭I/O is handled asynchronously.‬
‭○‬ ‭Direct Memory Access (DMA):‬‭Data transfer occurs without CPU intervention.‬
‭9.‬ ‭What is the distinction between spatial locality & temporal locality?‬‭(Nov/Dec 2022)‬
‭Answer:‬

‭○‬ S ‭ patial locality:‬‭If a memory location is accessed,‬‭nearby locations are likely to be‬
‭accessed soon.‬
‭○‬ ‭Temporal locality:‬‭If a memory location is accessed, it is likely to be accessed again‬
‭soon.‬
‭10.‬‭Define Locality of Reference.‬‭(Nov/Dec 2022)‬
‭Answer:‬‭Locality of reference refers to the tendency‬‭of a program to access the same set of‬
‭memory locations repeatedly within a short period.‬

‭Part B (Long Answer Questions - Only Questions & Time Test)‬

‭2‬
 ‭1.‬ ‭Explain Operating System Structure and components.‬‭(Nov/Dec 2024)‬

‭2.‬ ‭Discuss multiprocessor systems in detail.‬‭(Nov/Dec‬‭2024)‬

‭3.‬ E
‭ xplain in detail the types of system calls provided by a typical operating system.‬
‭(Apr/May 2024)‬

‭4.‬ E
‭ xplain the purpose of system calls and discuss the calls related to device management‬
‭and communications in brief.‬‭(Apr/May 2024)‬

‭5.‬ E
‭ xplain the concepts of virtual machines, their implementation, and benefits in detail.‬
‭(Nov/Dec 2023)‬

‭6.‬ W
‭ hat is a virtual machine? List out the advantages of virtualization. Explain the creation‬
‭of a Virtual machine with an architecture diagram.‬‭(Nov/Dec 2023)‬

‭7.‬ ‭Write short notes on operating system services and components.‬‭(Apr/May 2023)‬

‭8.‬ ‭Write in detail about the real-time system and multiprocessor system.‬‭(Apr/May 2023)‬

‭9.‬ ‭Explain the various types of system calls with an example for each.‬‭(Nov/Dec 2022)‬

‭10.‬‭Discuss about the functionality of system boot with respect to the operating system.‬
‭(Nov/Dec 2022)‬

‭ NIT II PROCESS MANAGEMENT‬

U
‭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.‬

‭UNIT 2 - PROCESS MANAGEMENT‬

‭Part A (Short Answer Questions with Answers & Time Test)‬

‭1.‬ ‭Define Process.‬‭(Nov/Dec 2024)‬

‭Answer:‬‭A process is a program in execution, consisting‬‭of program code, data, and system‬
‭resources such as registers, memory, and open files.‬

‭2.‬ ‭What is a process control block? List the data fields associated with PCB.‬‭(Nov/Dec 2024)‬
‭Answer:‬‭A‬‭Process Control Block (PCB)‬‭is a data structure‬‭maintained by the operating‬

‭3‬
 ‭system for each process, containing:‬

‭ ‬ ‭Process ID‬
○
‭○‬ ‭Process state‬
‭○‬ ‭CPU registers‬
‭○‬ ‭Memory management information‬
‭○‬ ‭I/O status information‬
‭3.‬ ‭What is meant by context switching?‬‭(Apr/May 2024)‬
‭Answer:‬‭Context switching is the process of saving‬‭the current state of a CPU process and‬
‭loading the saved state of another process. It allows multitasking in an operating system.‬

‭4.‬ ‭Define co-operating process and independent process.‬‭(Apr/May 2024)‬

‭Answer:‬

‭ ‬ ‭Co-operating process:‬‭A process that interacts with‬‭other processes by sharing data.‬

○
‭○‬ ‭Independent process:‬‭A process that does not share‬‭data with any other process.‬
‭5.‬ ‭What are the benefits of multithreaded programming?‬‭(Nov/Dec 2023)‬
‭Answer:‬

‭ ‬ ‭Improved responsiveness‬
○
‭○‬ ‭Faster execution due to parallelism‬
‭○‬ ‭Efficient resource utilization‬
‭○‬ ‭Simplified program structure‬
‭6.‬ ‭What is a thread?‬‭(Nov/Dec 2023)‬
‭Answer:‬‭A thread is the smallest unit of execution‬‭within a process, capable of running‬
‭independently but sharing memory with other threads in the same process.‬

‭7.‬ ‭Under what circumstances does a CPU scheduling decision take place?‬‭(Apr/May 2023)‬
‭Answer:‬‭CPU scheduling occurs when:‬

‭ ‬ ‭A process moves from running to waiting state.‬

○
‭○‬ ‭A process terminates.‬
‭○‬ ‭A process moves from running to ready state (preemptive scheduling).‬
‭○‬ ‭A process moves from waiting to ready state.‬
‭8.‬ ‭What are the various scheduling criteria for CPU scheduling?‬‭(Apr/May 2023)‬
‭Answer:‬

‭‬
○ ‭ PU Utilization:‬‭Maximize CPU usage.‬
C
‭○‬ ‭Throughput:‬‭Maximize number of processes executed‬‭per unit time.‬
‭○‬ ‭Turnaround Time:‬‭Minimize time from process submission‬‭to completion.‬
‭○‬ ‭Waiting Time:‬‭Minimize time spent in the ready queue.‬

‭4‬
 ‭ ‬ ‭Response Time:‬‭Minimize time between request submission‬‭and first response.‬
○
‭9.‬ ‭Write down the definition of TestAndSet() instruction.‬‭(Nov/Dec 2022)‬
‭Answer:‬‭TestAndSet() is an atomic instruction used‬‭in synchronization to check and modify a‬
‭variable value without interruption.‬

‭10.‬‭Define busy waiting and spinlock.‬‭(Nov/Dec 2022)‬

‭Answer:‬

‭‬ B
● ‭ usy waiting:‬‭A process continuously checks for a‬‭condition instead of sleeping.‬
‭●‬ ‭Spinlock:‬‭A type of busy waiting where a thread keeps‬‭checking for a resource until it‬
‭becomes available.‬

‭Part B (Long Answer Questions - Only Questions & Time Test)‬

‭1.‬ E
‭ xplain the FCFS, preemptive and non-preemptive versions of Shortest-Job First and‬
‭Round Robin scheduling algorithms.‬‭(Nov/Dec 2024)‬

‭2.‬ D
‭ iscuss how scheduling algorithms are selected for a system and explain the different‬
‭evaluation methods.‬‭(Nov/Dec 2024)‬

‭3.‬ ‭Write in detail about several CPU scheduling algorithms.‬‭(Apr/May 2024)‬

‭4.‬ W
‭ hat is a critical section? Specify the requirements for a solution to the critical section‬
‭problem.‬‭(Apr/May 2024)‬

‭5.‬ ‭Explain how monitors help in process synchronization.‬‭(Nov/Dec 2023)‬

‭6.‬ D
‭ iscuss about the threading issues considered with multithreaded programs.‬‭(Nov/Dec‬
‭2023)‬

‭7.‬ D
‭ escribe the differences between User-Level Threads and Kernel-Level Threads.‬
‭(Apr/May 2023)‬

‭8.‬ E
‭ xplain the concept of process synchronization and explain the role of semaphores.‬
‭(Apr/May 2023)‬

‭9.‬ D
‭ iscuss in detail the Producer-Consumer problem and its solution using semaphores.‬
‭(Nov/Dec 2022)‬

‭10.‬‭Explain Deadlocks and the necessary conditions for their occurrence.‬‭(Nov/Dec 2022)‬

‭UNIT III MEMORY MANAGEMENT‬

‭5‬
 ‭ ain Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the Page Table -‬
M
‭Segmentation, Segmentation with paging; Virtual Memory - Demand Paging – Copy on Write -‬
‭Page Replacement - Allocation of Frames –Thrashing.‬

‭UNIT 3 - MEMORY MANAGEMENT‬

‭Part A (Short Answer Questions with Answers & Time Test)‬

‭1.‬ ‭What are the characterizations of deadlock?‬‭(Nov/Dec‬‭2024)‬

‭Answer:‬‭Deadlock is a situation where a set of processes‬‭are blocked because each process is‬
‭holding a resource and waiting for another resource acquired by another process. The four‬
‭necessary conditions for deadlock are:‬

‭‬ M
○ ‭ utual Exclusion‬‭: Only one process can use a resource‬‭at a time.‬
‭○‬ ‭Hold and Wait‬‭: A process holding at least one resource‬‭is waiting for additional‬
‭resources.‬
‭○‬ ‭No Preemption‬‭: A resource cannot be forcibly taken‬‭from a process.‬
‭○‬ ‭Circular Wait‬‭: A set of processes are waiting on each‬‭other in a circular chain.‬
‭2.‬ ‭Differentiate a Thread from a Process.‬‭(Nov/Dec 2024)‬
‭Answer:‬

‭‬ P
○ ‭ rocess‬‭: An independent execution unit with its own‬‭memory and resources.‬
‭○‬ ‭Thread‬‭: A lightweight execution unit that shares memory‬‭with other threads within the‬
‭same process.‬
‭3.‬ ‭What are the differences between user-level threads and kernel-level threads?‬‭(Apr/May‬
‭2024)‬
‭Answer:‬

‭○‬ U ‭ ser-Level Threads:‬‭Managed by user-level libraries,‬‭no kernel intervention. Faster‬

‭but lack OS support.‬
‭○‬ ‭Kernel-Level Threads:‬‭Managed by the OS, slower due to kernel involvement but can‬
‭utilize multiple CPUs.‬
‭4.‬ ‭What is the use of fork and exec system calls?‬‭(Apr/May‬‭2024)‬
‭Answer:‬

‭ ‬ ‭fork()‬‭: Creates a new child process by duplicating‬‭the parent process.‬

○
‭○‬ ‭exec()‬‭: Replaces the current process with a new program.‬
‭5.‬ ‭Define thread cancellation & target thread.‬‭(Nov/Dec‬‭2023)‬
‭Answer:‬

‭○‬ ‭Thread Cancellation:‬‭Terminating a thread before it‬‭has completed execution.‬

‭6‬
 ‭ ‬ ‭Target Thread:‬‭The thread that is requested to be‬‭cancelled.‬
○
‭6.‬ ‭What are the different ways in which a thread can be cancelled?‬‭(Nov/Dec 2023)‬
‭Answer:‬

‭ ‬ ‭Asynchronous Cancellation:‬‭Immediate termination of‬‭the thread.‬

○
‭○‬ ‭Deferred Cancellation:‬‭The thread checks periodically‬‭and terminates when requested.‬
‭7.‬ ‭Define PThreads.‬‭(Apr/May 2023)‬
‭Answer:‬‭PThreads (POSIX Threads) is a standardized‬‭threading API that allows‬
‭multi-threading in Unix-like operating systems.‬

‭8.‬ ‭What is a critical section problem?‬‭(Apr/May 2023)‬

‭Answer:‬‭The critical section problem occurs when‬‭multiple processes access shared resources‬
‭and lead to data inconsistency. Solutions ensure mutual exclusion, progress, and bounded‬
‭waiting.‬

‭9.‬ W
‭ hat are the requirements that a solution to the critical section problem must satisfy?‬
‭(Nov/Dec 2022)‬
‭Answer:‬

‭‬ M
○ ‭ utual Exclusion:‬‭Only one process should enter the‬‭critical section at a time.‬
‭○‬ ‭Progress:‬‭If no process is inside the critical section,‬‭then other processes should‬
‭proceed without waiting indefinitely.‬
‭○‬ ‭Bounded Waiting:‬‭There should be a limit on how long‬‭a process waits to enter the‬
‭critical section.‬
‭10.‬‭Define mutual exclusion.‬‭(Nov/Dec 2022)‬
‭Answer:‬‭Mutual exclusion ensures that only one process‬‭accesses a shared resource at a time‬
‭to prevent conflicts.‬

‭Part B (Long Answer Questions - Only Questions & Time Test)‬

‭1.‬ ‭Write in detail about deadlock avoidance.‬‭(Nov/Dec‬‭2024)‬

‭2.‬ ‭Write in detail about deadlock recovery.‬‭(Nov/Dec‬‭2024)‬

‭3.‬ E
‭ xplain the Banker’s algorithm for deadlock avoidance in detail with an example.‬
‭(Apr/May 2024)‬

‭4.‬ C
‭ onsider the following set of processes, with the length of the CPU-burst time given in‬
‭milliseconds and analyze different scheduling algorithms.‬‭(Apr/May 2024)‬

‭7‬
 ‭5.‬ ‭Discuss the threading issues considered with multithreaded programs.‬‭(Nov/Dec 2023)‬

‭6.‬ E
‭ xplain the different methods of memory allocation (Contiguous & Non-contiguous).‬
‭(Nov/Dec 2023)‬

‭7.‬ ‭Explain how paging and segmentation improve memory utilization.‬‭(Apr/May 2023)‬

‭8.‬ D
‭ escribe the concept of demand paging and explain its advantages and disadvantages.‬
‭(Apr/May 2023)‬

‭9.‬ ‭Explain different page replacement algorithms with examples.‬‭(Nov/Dec 2022)‬

‭10.‬‭Discuss the working of virtual memory and how it helps in memory management.‬
‭(Nov/Dec 2022)‬

‭ NIT IV STORAGE MANAGEMENT‬

U
‭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.‬

‭UNIT 4 - STORAGE MANAGEMENT‬

‭Part A (Short Answer Questions with Answers & Time Test)‬

‭1.‬ ‭What is meant by paging and segmentation?‬‭(Nov/Dec 2024)‬

‭Answer:‬

‭○‬ P ‭ aging‬‭: A memory management scheme that eliminates‬‭fragmentation by dividing‬

‭memory into fixed-size pages.‬
‭○‬ ‭Segmentation‬‭: Divides memory logically into variable-sized segments based on‬
‭program structure.‬
‭2.‬ ‭Define thrashing.‬‭(Nov/Dec 2024)‬
‭Answer:‬‭Thrashing occurs when a process spends more‬‭time swapping pages in and out of‬
‭memory than executing due to excessive page faults.‬

‭3.‬ ‭What are the types of page replacement algorithms?‬‭(Apr/May 2024)‬

‭Answer:‬

‭‬ F
○ ‭ IFO (First-In-First-Out)‬
‭○‬ ‭LRU (Least Recently Used)‬

‭8‬
 ‭ ‬ ‭Optimal Page Replacement‬
○
‭○‬ ‭Clock Algorithm‬
‭4.‬ ‭Define Demand Paging.‬‭(Apr/May 2024)‬
‭Answer:‬‭Demand paging loads a page into memory only‬‭when it is needed, reducing memory‬
‭usage and improving efficiency.‬

‭5.‬ ‭What is virtual memory?‬‭(Nov/Dec 2023)‬

‭Answer:‬‭Virtual memory is a memory management technique‬‭that creates an illusion of a‬
‭larger memory space by using disk storage as an extension of RAM.‬

‭6.‬ ‭Explain the concept of locality of reference.‬‭(Nov/Dec‬‭2023)‬

‭Answer:‬‭Locality of reference refers to the tendency‬‭of a program to access a set of memory‬
‭locations frequently within a short time, improving performance.‬

‭7.‬ ‭What is Belady’s anomaly?‬‭(Apr/May 2023)‬

‭Answer:‬‭Belady’s anomaly is a phenomenon in which‬‭increasing the number of page frames‬
‭leads to an increase in the number of page faults in the FIFO page replacement algorithm.‬

‭8.‬ ‭What is a frame in memory management?‬‭(Apr/May 2023)‬

‭Answer:‬‭A frame is a fixed-size block of physical‬‭memory into which pages are mapped‬
‭during paging-based memory management.‬

‭9.‬ ‭Define swapping.‬‭(Nov/Dec 2022)‬

‭Answer:‬‭Swapping is the process of moving a process‬‭between main memory and secondary‬
‭storage (disk) to free up memory space.‬

‭10.‬‭What are the different methods for memory allocation?‬‭(Nov/Dec 2022)‬

‭Answer:‬

‭‬ C
● ‭ ontiguous Allocation:‬‭Assigns consecutive memory‬‭blocks to a process.‬
‭●‬ ‭Non-Contiguous Allocation:‬‭Uses paging or segmentation to allocate memory.‬

‭Part B (Long Answer Questions - Only Questions & Time Test)‬

‭1.‬ ‭Explain the various memory management techniques in detail.‬‭(Nov/Dec 2024)‬

‭2.‬ ‭Discuss paging and segmentation with diagrams.‬‭(Nov/Dec‬‭2024)‬

‭3.‬ ‭Explain virtual memory management and its implementation.‬‭(Apr/May 2024)‬

‭9‬
 ‭4.‬ ‭Discuss various page replacement algorithms with examples.‬‭(Apr/May 2024)‬

‭5.‬ E
‭ xplain in detail about the concept of thrashing and how it can be avoided.‬‭(Nov/Dec‬
‭2023)‬

‭6.‬ D
‭ escribe the differences between contiguous and non-contiguous memory allocation.‬
‭(Nov/Dec 2023)‬

‭7.‬ E
‭ xplain the working of the Least Recently Used (LRU) page replacement algorithm.‬
‭(Apr/May 2023)‬

‭8.‬ ‭Discuss the advantages and disadvantages of paging and segmentation.‬‭(Apr/May 2023)‬

‭9.‬ ‭Compare and contrast demand paging and pre-paging.‬‭(Nov/Dec 2022)‬

‭10.‬‭Explain how memory fragmentation occurs and how it can be minimized.‬‭(Nov/Dec 2022)‬

‭ NIT V VIRTUAL MACHINES AND MOBILE OS‬

U
‭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.‬

‭UNIT 5 - VIRTUAL MACHINES & MOBILE OS‬

‭Part A (Short Answer Questions with Answers & Time Test)‬

‭1.‬ ‭What is a virtual machine?‬‭(Nov/Dec 2024)‬

‭Answer:‬‭A virtual machine (VM) is an emulated computer‬‭system that runs an operating‬
‭system and applications as if it were a physical machine.‬

‭2.‬ ‭Explain the types of virtualization.‬‭(Nov/Dec 2024)‬

‭Answer:‬

‭○‬ F ‭ ull Virtualization:‬‭The guest OS runs unmodified‬‭in a completely virtual‬

‭environment.‬
‭○‬ ‭Para-Virtualization:‬‭The guest OS is modified to interact‬‭more efficiently with the‬
‭hypervisor.‬
‭○‬ ‭Hardware-Assisted Virtualization:‬‭Uses CPU extensions‬‭to improve VM‬
‭performance.‬

‭10‬
‭3.‬ ‭What are the benefits of virtualization?‬‭(Apr/May 2024)‬
‭Answer:‬

‭ ‬ ‭Efficient resource utilization‬

○
‭○‬ ‭Isolation and security‬
‭○‬ ‭Cost reduction and scalability‬
‭○‬ ‭Simplified disaster recovery‬
‭4.‬ ‭Compare iOS and Android operating systems.‬‭(Apr/May 2024)‬
‭Answer:‬

‭ ‬ ‭iOS:‬‭Closed-source, optimized for Apple devices, better‬‭security.‬

○
‭○‬ ‭Android:‬‭Open-source, supports a wide range of devices,‬‭highly customizable.‬
‭5.‬ ‭What is hypervisor?‬‭(Nov/Dec 2023)‬
‭Answer:‬‭A hypervisor is software that enables multiple‬‭virtual machines to run on a single‬
‭physical host by managing hardware resources.‬

‭6.‬ ‭Define hosted and bare-metal hypervisor.‬‭(Nov/Dec‬‭2023)‬

‭Answer:‬

‭ ‬ ‭Hosted Hypervisor:‬‭Runs on top of an existing OS (e.g.,‬‭VMware Workstation).‬

○
‭○‬ ‭Bare-Metal Hypervisor:‬‭Runs directly on hardware (e.g.,‬‭VMware ESXi).‬
‭7.‬ ‭Explain the structure of a virtual machine monitor.‬‭(Apr/May 2023)‬
‭Answer:‬‭A Virtual Machine Monitor (VMM) manages virtual‬‭machines and provides CPU,‬
‭memory, and I/O virtualization.‬

‭8.‬ ‭What is containerization?‬‭(Apr/May 2023)‬

‭Answer:‬‭Containerization is a lightweight virtualization‬‭technique where applications and‬
‭dependencies are packaged together but share the same OS kernel (e.g., Docker).‬

‭9.‬ ‭Explain the difference between a virtual machine and a container.‬‭(Nov/Dec 2022)‬
‭Answer:‬

‭ ‬ ‭Virtual Machines:‬‭Require a full OS and run on a hypervisor.‬

○
‭○‬ ‭Containers:‬‭Share the host OS kernel and are more‬‭lightweight.‬
‭10.‬‭What are the key features of mobile operating systems?‬‭(Nov/Dec 2022)‬
‭Answer:‬

‭‬
● ‭ ouchscreen support‬
T
‭●‬ ‭Power efficiency‬
‭●‬ ‭Mobile security‬
‭●‬ ‭App management and updates‬

‭11‬
‭Part B (Long Answer Questions - Only Questions & Time Test)‬

‭1.‬ D
‭ iscuss the evolution of virtual machines and explain how virtualization can be‬
‭implemented in operating systems.‬‭(Nov/Dec 2024)‬

‭2.‬ ‭Explain the structure of Direct Memory Access in detail.‬‭(Nov/Dec 2024)‬

‭3.‬ D
‭ escribe the differences between symmetric and asymmetric multiprocessing.‬‭(Apr/May‬
‭2024)‬

‭4.‬ ‭Explain different types of hypervisors and their working.‬‭(Apr/May 2024)‬

‭5.‬ C
‭ ompare and contrast the functionalities of iOS and Android operating systems.‬
‭(Nov/Dec 2023)‬

‭6.‬ D
‭ iscuss the advantages and disadvantages of using containers versus virtual machines.‬
‭(Nov/Dec 2023)‬

‭7.‬ E
‭ xplain the security challenges in mobile operating systems and how they are managed.‬
‭(Apr/May 2023)‬

‭8.‬ D
‭ escribe cloud-based mobile operating systems and their impact on computing.‬‭(Apr/May‬
‭2023)‬

‭9.‬ ‭Explain in detail about mobile application lifecycle management.‬‭(Nov/Dec 2022)‬

‭10.‬‭Discuss the role of AI and machine learning in mobile operating systems.‬‭(Nov/Dec 2022)‬

‭12‬