Sr. No L.J. Institute of Engineering & Technology Semester: IV (26) Subject Name: Operating System Subject Code:21402 Faculties: Prof. Saurin Dave CHAPTER NO - 1 : Introduction: TOPIC:1 Basics of Operating System 1 Define Kernel. (Dec-22) 2 Define System Call. (Dec-22) 3 Define i-node. (Dec-22) 4 Explain the main purpose of an operating system? 5 What are the advantages of a multiprocessor system? Marks 6 What is multitasking? 7 Why is partitioning and formatting a prerequisite to installing an operating system? 1 List the types of operating systems and explain any one in detail. (June-23) What is an operating system? List the types of operating system and explain in brief. (June- 22) (June-25) Define operating system. Explain the different views of operating system. Also explain types of operating system. [New](June-25) Explain different types of OS and also Explain different types of tasks done by OS. (Dec- 20) [New](Dec-25) 2 Explain evolution of operating system in detail with suitable diagrams. [New](June-25) 3 Explain the objectives and functions of operating systems. (June-24) What is Operating System? Give functions of Operating System. (Dec-23) (Dec-25) 4 Write short notes on Real Time Operating System. (June-20) (Dec-21) Explain features of Time Sharing System (June-20) Write short notes on: Real Time Operating System, Timesharing Operating System. (Dec- 23) (Dec-25) 5 Define distributed system. Explain the characteristics of distributed system. (Dec-20) (June-24) 6 Explain basic services provided by Operating System on bare hardware machine. (Dec- 20) (Dec-24) 7 What is system call in OS? Expalin fork () system call to create new process in unix OS. (Dec-24) 8 Give the advantages of Distributed Operating System. (Dec-21) Distributed Operating Systems. (June-23) (Dec-23) 9 Write short notes on Multithreading and Multitasking. (Dec-21) Differentiate Multi-Programming, Multi-tasking, Multiprocessing & Distributed Operating System. (Dec-22) 06,,,, 3.5, Operating System (21402) 26 Page 1, 3.5, 3.5 02, 3.5, 02, 3.5,, 3.5, 02, 3.5, 3.5 3.5, 10 What is system call? What is interrupt? How it is handled by OS? (June-22) 11 Give the features of Batch Operating System. (Dec-21) 02 12 What is operating System? Explain the abstract view of the components of a computer system. (June-21) 13 Explain multiprocessor operating system types in brief. (Dec-20)
L.J. Institute of Engineering & Technology Semester: IV (26) 14 What is Operating System? Give the view of OS as Resource Manager. (June-20) TOPIC:2 Operating System Structure 1 How are server systems classified? 1 What is virtual machine? Explain virtual machine & Client/Server architecture of Operating System. (Dec-22) (Dec-24) CHAPTER NO - 2 : Process Management: TOPIC:1 Process 1 Define Process. (June-24) 2 Define Thread. (Dec-22) 3 Define Interrupt Service Routine. (Dec-22) 4 Give some benefits of multithreaded programming. 5 What is a socket? 6 What are interrupts? 7 What are the Long term scheduler? 8 What are the Medium term scheduler? 9 What are the Short term scheduler? 10 List out some reasons for process termination. 11 What are the reasons for process suspension? 12 What is process migration? 13 What is an idle thread? 14 What is the state of the processor, when a process is waiting for some event to occur? 15 What is Dispatcher? 16 What is CPU Scheduler? 17 Process is A. program in High level language kept on disk B. contents of main memory C. a program in execution D. a job in secondary memory E. None of the above 1 Explain 5 State Process State Transition Diagram with illustration. (Dec-23) (Dec- 25) Differentiate process and thread. How do you create and terminate the process? Draw a diagram which indicates the state of processes. (June-25) Define a process. Explain the process state transition with a neat diagram. (June-24) (Dec-24) [New](Dec-25) 2 What is Process State? Explain different states of a process with various queues generated at each stage. (June-20) 3 Define process. Differentiate between a process and a program. (June-20) (Dec-21) [New](June-25) 4 Explain thread in brief. (Dec-20) Explain threads in brief with its types. What is multithreading? Explain. [New](June-25) 5 Explain the classical thread model with its implementation strategies. (June-23) [New](Dec-25) Operating System (21402) 26 Page 2, 3.5, 3.5,,,, 02, 02, 04 3.5,,
L.J. Institute of Engineering & Technology Semester: IV (26) 6 What is thread and what are the differences between user-level threads and kernel supported threads? Under what circumstances is one type better than the other? (June-24) 7 What is PCB? Discuss its major fields. (Dec-20) (June-23) [New](Dec-25) 3.5,, 8 Define Process and Thread. What is Process Control Block? Explain its various entries with 3.5, their usefulness. (Dec-23) (Dec-25) 9 Define Process. List the major events for creation of a process and explain them. (June- 23) 10 Draw process state diagram for THREE states and explain all states. (June-23) 11 What is process? What are the different type of states Of any process? Explain different data structures to handle process management. (June-22) 12 What is scheduler? Explain queuing diagram representation of process scheduler with figure. (June-21) 13 What is thread? Explain thread structure. (June-21) TOPIC:2 Process Scheduling 1 Define Waiting Time. (Dec-21) 2 Define Response Time. (June-20) (Dec-21), 3 Define Turnaround Time. (June-20) 1 Explain UMA and NUMA multiprocessors. (Dec-21) (June-22) (Dec-25) [New](Dec-25) TOPIC:3 Process Scheduling Algorithms 1 What is preemptive multitasking?,,, 2 What is Context Switch? 3 The strategy of allowing processes that are logically runnable to be temporarily suspended is called A. preemptive scheduling B. non preemptive scheduling C. shortest job first D. first come first served E. None of the above 1 Explain Context Switching. Discuss performance evaluation of FCFS (First Come First Serve) & RR (Round Robin) scheduling. (June-22) [New](June-25) [New](Dec-25),, 2 Explain scheduling of process with shortest process next policy. (June-23) 3 Explain Round Robin, Shortest Job First and Priority Scheduling Algorithms with illustration. (June-20) NUMERICALS 1 Five jobs A through E arrive at a computer center with following details, Job Arrival_Time CPU_Time A 0 9 B 1 5 C 2 2 D 3 6 Operating System (21402) 26 Page 3
L.J. Institute of Engineering & Technology Semester: IV (26) E 4 8 Calculate the Turnaround Time and Waiting Time for all processes applying (i) First Come First Serve (ii) Shortest Job First and (iii) Round Robin (with Time Quanta=3) algorithms. (Dec-21) (Dec-25) 2 Find average waiting time for Shortest job first scheduling, and Round robin scheduling algorithm. Process CPU burst time P1 6 P2 8 P3 5 P4 2 CPU burst time is given in millisecond and time quantum is 4. (June-24) 3 Consider the following set of processes with the length of CPU burst time given in the milliseconds. Process Arrival Time Burst Time Priority P1 0 8 3 P2 1 1 1 P3 2 3 2 P4 3 2 3 P5 4 6 4 Calculate average turnaround time and average waiting time for First-come first served scheduling, Shortest job first scheduling and Priority scheduling algorithm. (June-24) 4 What is average waiting time & average Turnaround times of all processes for FCFS, SJF, non-preemptive Priority and Round Robin (Quantum=1) Scheduling: Process Burst Time Priority P1 8 5 P2 1 1 P3 3 2 P4 2 4 P5 5 3 [Assume smaller number implies higher priority & All 5 processes arrived in order P1,P2,P3,P4,P5 all at time = 0] (Dec-24) 5 Consider the following set of processes with length of CPU burst time given in milliseconds.,, Process Burst Time Priority P1 10 5 P2 1 1 Operating System (21402) 26 Page 4
L.J. Institute of Engineering & Technology Semester: IV (26) P3 2 3 P4 1 4 P5 5 2 Assume arrival order is: P1, P2, P3, P4, P5 at time 0, 1, 2, 3, 4 respectively and a smaller priority number implies a higher priority. Draw the Gantt charts for preemptive and nonpreemptive priority scheduling. Calculate Average Turnaround Time and Average Waiting Time. (June-21) (Dec-22) (Dec-23) 6 Suppose that the following processes arrive for the execution at the times indicated. Each process will run the listed amount of time. Assume preemptive scheduling. Process Arrival Time (ms) Burst Time (ms) P1 0.0 8 P2 0.4 4 P3 1.0 1 What is the turnaround time for these processes with Shortest Job First scheduling algorithm? (June-21) 7 Five batch jobs A to E arrive at same time. They have estimated running times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. For each of the following algorithm determine mean process turnaround time. Ignore process swapping overhead. Round Robin, Priority Scheduling, FCFS, SJF. (Dec-20) CHAPTER NO - 3 : Inter-process Communication: TOPIC:1 Basics of Inter-Process Communication 1 Define Monitor. (Dec-21) (June-22) [New](Dec-25),, 2 Define Mutual Exclusion. (June-20) (June-23) (Dec-23) (Dec-25) [New](Dec- 25) Operating System (21402) 26 Page 5,,,,, 3 Define: Race Condition (Dec-21) (June-22) (Dec-23) (Dec-25),,, 4 Define: Throughput (Dec-23) (Dec-25), 5 Define: Turnaround Time (Dec-25) 6 What is IPC? (Dec-24) 7 Define Semaphore. (June-22) 8 Define Critical Section. (Dec-21) 9 How are the wait/signal operations for monitor different from those for semaphores? 10 For sharable resources, mutual exclusion : a) is required b) is not required c) None of these 11 The TestAndSet instruction is executed : a) after a particular process b) periodically c) atomically d) None of these
L.J. Institute of Engineering & Technology Semester: IV (26) 12 The two atomic operations permissible on semaphores are : (choose two) a) wait b) stop c) hold d) signal 13 A monitor is a type of : a) semaphore b) low level synchronization construct c) high level synchronization construct d) None of these 14 The operations that can be invoked on a condition variable are : (choose two) a) wait b) hold c) signal d) continue 1 Define mutual exclusion. How mutual exclusion can be achieved? Explain. [New](June- 25) 2 What is race condition? Explain the producer-consumer problem with a fatal race condition. (June-25) 3 What is Semaphore? Give the implementation of Bounded Buffer Producer Consumer Problem using Semaphore. (June-20) What is Semaphore? Give the implementation of Producers-Consumers Problem using Semaphore. (Dec-22) (Dec-24) (Dec-25) 4 Explain the Problem of Critical Section (CSP) through Producer Consumer Problem. Explain any one Solution in detail. (June-24) Operating System (21402) 26 Page 6,, 06, 5 Write short note: 1) Semaphores 2) Monitors (June-24) 6 What is Monitor in IPC? Solve the Bounded buffer problem using Monitor. (June-20) (Dec-21) (Dec-23) (Dec-24), 06,, 7 What is critical section? What is Mutual exclusion? Explain Peterson s solution for mutual exclusion problem. (June-22) Discuss the Peterson s solution for the race condition with algorithm. (June-23), 8 What is Semaphore? How can we achieve the synchronization using semaphore for producer consumer problem? (June-23) 9 What is priority inversion problem in interprocess communication? How to solve it with semaphore? (Dec-20) TOPIC:2 Classical IPC Problems 1 Explain the IPC Problem known as Dining Philosopher Problem. (June-22) [New](June- 25) [New](Dec-25) 2 Give the implementation of Readers-Writers Problem using Semaphore. (Dec-21) (Dec- 23) (Dec-25) Explain IPC Problem Readers & Writers Problem. (June-22) [New](Dec-25),, 08,,,, 3 Explain readers and writers problem with solution. (June-25) CHAPTER NO - 4 : Deadlocks: TOPIC:1 Basics of Deadlocks 1 Define Deadlock. (June-23) 2 What necessary conditions can lead to a deadlock situation in a system?
L.J. Institute of Engineering & Technology Semester: IV (26) 3 List the Coffman's conditions that lead to a deadlock. 4 When is a system in safe state? 5 What is a Safe State and what is its use in deadlock avoidance? 6 The request and release of resources are. a) command line statements b) interrupts c) system calls d) special programs 7 For a deadlock to arise, which of the following conditions must hold simultaneously? (choose all that apply ) a) Mutual exclusion b) Starvation c) Hold and wait d) No preemption e) Circular wait 8 What is the reusable resource? a) that can be used by one process at a time and is not depleted by that use b) that can be used by more than one process at a time c) that can be shared between various threads d) none of the mentioned 9 A system is in the safe state if a) the system can allocate resources to each process in some order and still avoid a deadlock b) there exist a safe sequence c) both (a) and (b) d) none of the mentioned 10 If the wait for graph contains a cycle : a) then a deadlock does not exist b) then a deadlock exists c) then the system is in a safe state d) either b or c 11 If deadlocks occur frequently, the detection algorithm must be invoked. a) rarely b) frequently c) None of these 1 What is deadlock? List the conditions that lead to deadlock. How deadlock can be prevented? [New](June-25) 2 What is Deadlock? List the conditions that lead to deadlock. How Deadlock can be prevented? (June-24) 3 How Resource Trajectories can be helpful in avoiding the deadlock? (June-23) TOPIC:2 Deadlocks Prevention 1 Which conditions must hold for resource deadlock? Explain any one method to avoid dead lock. (June-25) 2 What is Deadlock? Explain Deadlock Prevention in detail. (Dec-20) (Dec-21) What is Deadlock? List the conditions that lead to deadlock. How Deadlock can be prevented? (June-20) (Dec-23) TOPIC:3 Deadlock Avoidance Operating System (21402) 26 Page 7,,,
L.J. Institute of Engineering & Technology Semester: IV (26) 1 What factors determine whether a detection-algorithm must be utilized in a deadlock avoidance system? 1 Explain the use of Banker s algorithm for multiple resources for deadlock avoidance with illustration. (June-20) (June-21) (Dec-21) (Dec-22) (Dec-23) (June-24) (Dec-24) (Dec-25) [New](June-25) [New](Dec-25) 2 Explain the differences between deadlock, live lock and starvation. Give an example of deadlock detection. (June-25) 3 Write short note on algorithm which deals with multiple resource allocation. (June-25) 4 What is Deadlock? Describe the conditions that lead to deadlock. How to recover from Deadlock? (Dec-24) Operating System (21402) 26 Page 8,,,,,,,,, 5 Banker s algorithm for a single resource. (June-23) 3.5 6 What is Dead lock? When it occurs? How to recover from it. (Dec-22) 7 What is Deadlock? Explain Deadlock prevention & Avoidance. (June-22) CHAPTER NO - 5 : Memory Management: TOPIC:1 Basics Memory Management 1 Define Segmentation. (June-23) [New](Dec-25), 2 Define Thrashing. (June-20) 3 What are overlays? 4 What is fragmentation? 5 How does swapping result in better memory management? 6 When does thrashing occur? 7 What is caching? 8 What is a drawback of MVT? 9 What is fragmentation? Different types of fragmentation? 1 Explain the following in detail with suitable diagrams: (i) Swapping (ii) Segmentation. (iii) Multiprogramming with fixed partitions (iv) Multiprogramming with Variable Partitions. [New](June-25) 2 What is fragmentation? What is the need of fragmentation? Explain the difference between internal and external fragmentation. (June-24) 3 Compare Multiprogramming with Fixed Partition and Multiprogramming with Variable Partitions with diagram. (June-20) Explain the following in brief. Multiprogramming with Fixes Partitions and Multiprogramming with Variable Partitions. (Dec-23) 4 Explain the linked list allocation file implementation technique. (June-21) Establish the necessity for memory management. Explain the memory management with the use of Linked Lists. (June-23) 14, 3.5 5 Memory Management with Linked List and Bitmap. (Dec-21) 3.5 6 What is segmentation? Explain it with example. (June-21) 7 Explain swapping in memory management. (Dec-20) 8 Explain the concept of Segmentation for Memory Management. Explain why combined Paged Segmentation is used with illustration. (June-20) TOPIC:2 Paging,
L.J. Institute of Engineering & Technology Semester: IV (26) 1 What is demand paging? 2 What is the basic function of paging? 3 What is the Translation Lookaside Buffer (TLB)? 4 What are demand-paging and pre-paging? 1 Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3) Worst-fit (June-24), [New](Dec-25) 2 Explain Swapping in Detail. (Dec-22) [New](Dec-25), 3 Compare concept of paging and segmentation with suitable example. (June-25) 4 Compare Paging with segmentation. (June-22) 5 Compare Paging and Segmentation. Explain the combined Paged Segmentation Concept with illustration. (Dec-21) NUMERICALS 1 Given memory partition of 100K, 500K, 200K, 300K, and 600K in order, How would each of the First-fit, Best-fit and Worst-fit algorithms place the processes of 212K, 417K, 112K and 426K in order? Which algorithm makes the most efficient use of memory? Show the diagram of memory status in each cases. (June-21) TOPIC:3 Virtual Memory 1 What is virtual memory? 2 Differentiate logical from physical address space. 1 Explain concept of virtual memory and paging with example. (June-25) 2 Explain Virtual Memory Management with Paging in detail. Explain how Virtual Address is translated into Physical Address. Give the advantages of Paging over Segmentation. (Dec-23) (Dec-25), 3 Explain virtual memory management with Paging in detail. (Dec-22) (Dec-24), 4 What is Virtual Memory? Explain. (June-20) 02, What is Virtual Memory? Explain Demand Paging. (June-22) 5 What do you mean by Virtual Memory and Physical Memory? (Dec-21) 02 6 What is Paging? What is Page Table? Explain the conversion of Virtual Address to Physical Address in Paging with example. (June-20) TOPIC:4 Page Replacement Algorithm 1 What is the best page size when designing an operating system? 2 What are local and global page replacements? 3 In the context of memory management, what are placement and replacement algorithms? 1 Explain FIFO and LRU page replacement algorithm in detail. (June-22) (June-25), 2 NRU page replacement algorithm. (June-23) 3.5 3 Explain various Page Replacement Algorithms with example. (June-21) (Dec-22), 4 Compare Optimal, LRU and FIFO page replacement algorithms with illustration. (Dec- 21) 5 Explain page table in brief. (Dec-20) 3.5 NUMERICALS Operating System (21402) 26 Page 9
L.J. Institute of Engineering & Technology Semester: IV (26) 1 For the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Calculate the page faults applying the following Page Replacement Algorithms for a memory with three frames: (i) Optimal (ii) LRU (iii) FIFO (June-20) (Dec-23) [New](June-25) 2 Why Page Replacement is necessary? Compare Optimal, LRU and FIFO page replacement algorithms with illustration. (Dec-25) 3 Consider the following Page reference string: 0,1,7,2,3,2,7,1,0,3. Homw many page faults occur with four page frames and eight pages and the four frames are initially empty in case of FIFO & LRU. (Dec-24) 4 Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming four frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each. LRU replacement FIFO replacement (June-21) 5 A computer has four page frames. The time of loading, time of last access and the R and M bit for each page given below. Page Loaded Last Ref. R M,, 3.5 0 126 280 1 0 1 230 265 0 2 140 270 0 0 3 110 285 1 1 Which page NRU, FIFO, LRU will replace. (Dec-20) CHAPTER NO - 6 : I/O Management: TOPIC:1 Principals of I/O Hardware 1 Define Device Driver. (Dec-22) 2 What is the purpose of an I/O status information? 3 What is cycle stealing? 4 In, information is recorded magnetically on platters. a) magnetic disks b) electrical disks c) assemblies d) cylinders 1 Write short note: 1) Direct memory access (DMA) (June-20) (Dec-21) (June-24) Draw a diagram of Direct Memory Access and explain its operation. (June-21) (June- 23) (Dec-24) (June-25) 03, 3.5, 3.5, 06,,, 2 Write short note on single-bus and dual-bus memory architecture. (June-25) TOPIC:2 Principals of I/O Software 1 Enumerate the different RAID levels. 2 RAID level 3 supports a lower number of I/Os per second, because. a) every disk has to participate in every I/O request Operating System (21402) 26 Page 10
L.J. Institute of Engineering & Technology Semester: IV (26) b) only one disk participates per I/O request c) I/O cycle consumes a lot of CPU time d) All of these 3 In RAID level 4, one block read, accesses. a) only one disk b) all disks simultaneously c) all disks sequentially d) None of these 4 Where performance and reliability are both important, RAID level is used. a) 0 b) 1 c) 2 d) 0+1 1 Explain the goals of I/O software. (June-20) (Dec-23) [New](June-25), 3.5, 2 Write short note: RAID levels. (june-21) (June-23) (Dec-23) (June-24) [New](Dec-25) 3 Write short note: Device controllers (June-20) (June-24) What are the use of device driver & controller in OS? Explain.(Dec-21) (June-22) (Dec-23) (Dec-25) 06, 3.5, 3.5,, 03, 3.5,,, 4 Explain Device Independent I/O software. (Dec-22) TOPIC:3 Disk Scheduling Algorithm 1 Define latency, transfer and seek time with respect to disk I/O. 1 Explain various Disk Scheduling algorithms with illustration. (June-20) (Dec-21) (Dec-25) Explain any three Disk Arm Scheduling algorithms with suitable illustrations. [New](June- 25) 05, 06,, 2 Explain SSTF and LOOK disk scheduling algorithms. (June-21) [New](Dec-25) 08, 3 Explain elevator algorithm for scheduling disk requests. (June-25) 4 Compare various Disk arm scheduling algorithm. (Dec-24) 5 Explain following in brief: I. Elevator Algorithm (Dec-22) 6 Explain Different RAID levels and also Disk arm scheduling algorithm. (June-22) NUMERICALS 1 Disk requests come in to the disk for cylinders 10, 22, 20, 2, 40, 6 and 38. A seek takes 6 msec per cylinder move. How much seek time is for Closest cylinder next algorithm? Initially arm is at cylinder 20. (June-23) 2 Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk scheduling FCFS SCAN (June-21) Operating System (21402) 26 Page 11 08
L.J. Institute of Engineering & Technology Semester: IV (26) CHAPTER NO - 7 : File Management: TOPIC:1 Concept of File Management 1 When designing the file structure for an operating system, what attributes are considered? 2 What are the primary functions of VFS? 1 List and explain the attributes and operations you can perform on the file. (Dec-20) (June-21) (June-24) (June-25) File Attributes and File Operations. (Dec-23) (Dec-25),,,, 3.5, 3.5 2 Explain following in brief: File system consistency. (Dec-22) 3.5 3 File Types and File Access (sequential access and random access). (June-20) 04 TOPIC:2 Allocation Methods 1 Explain any two File Allocation Methods from the following: (i) Contiguous Allocation (ii) Linked Allocation (iii) Indexed Allocation [New](June-25) [New](Dec-25) 2 Short note on i- Node. (June-23) Write short note on File Allocation Table and I-node. (June-25) 3 What is inode? Explain File and Directory Management of Unix Operating System. (June-20) (Dec-21) (June-24) 4 What is inode? What is boot block? What is Superblock? How they are used to handle file management system in OS? Which methods are used to improve performance of file management system in OS. (June-22) Operating System (21402) 26 Page 12, 3.5,, 3.5, 5 Contiguous and Linked List Allocation for implementing File System. (Dec-21) (Dec- 3.5, 3.5 25) 6 Explain linked list allocation file implementation technique. (Dec-24) 7 Contiguous and Linked List Allocation for implementing File System. (June-20) (Dec- 23) 04, 3.5 TOPIC:3 Space Management 1 Describe various file organization techniques. (June-24) 2 Explain Implementation of File in Operating System. (Dec-20) (Dec-22), CHAPTER NO - 8 : Security & Protection: TOPIC:1 Security 1 Define Authentication. (June-22) [New](Dec-25), 2 What is a trap and trapdoor? 3 What are common security threats? a) File Shredding b) File sharing and permission c) File corrupting d) File integrity 4 Why is one time password safe? a) It is easy to generated b) It cannot be shared c) It is different for every access d) It is a complex encrypted password 5 Which happens first authorization or authentication? a) Authorization
L.J. Institute of Engineering & Technology Semester: IV (26) b) Authentication c) Both are same d) None of the mentioned 6 What are the different ways to intrude? (Choose 3) a) Buffer overflows b) Unexpected combinations and unhandled input c) Race conditions d) Backdoor 1 Explain the goals of Operating System Security. [New](June-25) 2 Explain the Trojan Horse and Trap doors program threats. (June-21) [New](Dec-25), 3 Which are the ways for the user authentication? Explain each in brief. (June-25) 4 Security Threats of Operating System. (Dec-24) (Dec-25), 3.5 5 Write a note on Generic Security Attacks. (Dec-23) 3.5 6 Write short notes on Design Principles of Security. (Dec-21) 3.5 TOPIC:2 Protection 1 Write short notes on Access Control List. (Dec-20) (Dec-21) How Access Control List can be useful for managing file access? (June-23) Access metrics mechanism. (June-21) (Dec-23) 2 Explain Protection Mechanism illustrating use of Protection Domain and Access Control List. (June-20) Explain domain protection mechanism in brief. (Dec-20), 3.5, 3.5,, 3.5, CHAPTER NO - 9 : Unix/Linux Operating System: TOPIC:1 Basics of Unix/Linux Operating System 1 Explain the use of command, cp (Dec-21) (Dec-25) (June-25),, 2 Explain the use of command, grep (June-20) (Dec-23) (Dec-24) (Dec-25) (June- 25),,,, 3 Explain the use of command, head (Dec-22) (June-25), 4 Explain the use of command, sort (June-20) (June-25), 5 Explain the use of command, wc (June-25) 6 Explain the use of command, rm (June-25) 7 Give the functions of cat unix commands. (June-20) (Dec-21) (Dec-23) (Dec-25),,, 8 Explain the use of chmod.(dec-22) (Dec-23) (Dec-24),, 9 Explain the use of tail. (Dec-22) (Dec-24), 10 Explain the use of cut. (Dec-22) (Dec-24), 11 Explain the function of pwd. (Dec-21) 12 What is root partition? 1 Explain Linux kernel and its functions in brief. [New](June-25) 2 Explain the following UNIX commands (i) grep (ii) cut (iii) chmod (iv) finger [New](Dec-25) Operating System (21402) 26 Page 13
L.J. Institute of Engineering & Technology Semester: IV (26) 3 Explain directory structure of Unix. (Dec-20) Explain Files and Directory Management in UNIX Operating System. (Dec-21) (Dec- 23) (Dec-25),,, 4 Give the role of Kernel and Shell in UNIX. (June-20) (Dec-21) 02, 02 5 (i) Explain grep command in Unix. (ii) Explain man command in Unix. (Dec-20) 6 (i) Explain finger command in Unix. (ii) Explain who command in Unix. (Dec-20) 7 Explain System administration commands in Unix. (Dec-20) 8 Explain kernel structure in UNIX. (Dec-20) TOPIC:1 Shell Programming 1 What is shell in Linux/Unix? (June-25) PROGRAMMES 1 Write following Shell scripts in Unix/Linux : (i) To find Factorial of a given number. (ii) For generating students mark sheet. Calculate CLASS also. (Dec-25) 2 Write a Shell script to find Factorial of a given number. (Dec-23) 3.5 3 Write a shell script to find greater number out of 3 numbers. (June-23) 3.5 4 Write following Shell scripts in Unix/Linux : I. To find five largest files in the current directory. II. To find Sum & Average of n numbers. (Dec-22) 5 Write C Program to create exactly four child processes on UNIX / LINUX & assign each a unique task of addition, subtraction, multiplication, Division. (Dec-22) TOPIC:1 Case Studies 1 Compare Windows & Unix family Operating System. (Dec-24) 2 Advantages of LINUX/UNIX operating system over Windows. (June-23) 3.5 3 Explain functions of Kernel of Unix OS. Also explain various security measures in Unix file system. How keyboards and monitors are represents in Unix file system? (June-22) 4 Explain operating system structure of windows 2000 in brief. (Dec-20) Operating System (21402) 26 Page 14