Operating Systems

	Question
3	Write a short note on Batch System. This question has 1 answers so far.
2	Dne race condition with an example. This question has 0 answers so far.
1	List the differences between short term and long term scheduling. This question has 0 answers so far.
1	Consider the page trace- 3,1,2,5,4,1,2,5,2,1,3. Find the failure frequency for "FIFO and Least recent used page replacement policy. This question has 0 answers so far.
1	Discuss Banker's algorithm in detail. Also provide an example for Banker's algorithm. This question has 0 answers so far.
1	The following reference string (access sequence) is given (0.7.1,4,3,8,1,4,3,9,1,4,3,2,7,5,6) Find the number of page faults for a main memory subsystem that has 4 frames and uses LRU page replacement policy for on demand paging. This question has 0 answers so far.
1	Why rotational latency is usually not considered in disk scheduling? This question has 0 answers so far.
1	Consider the following set of processes, with the length of CPU-burst time given in nanoseconds: Time Quantum = 2ns. Prepare a GANTT chart and calculate the average time using FIFO, Round Robin, Priority Scheduling algorithms. This question has 0 answers so far.
1	Suppose a disk has 201 cylinders, numbered from 0 to 200. The drive is currently serving a request at cylinder 100, and there is queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135, 145. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all FIFO, SSTF, SCAN, LOOK, C-SACN, C-LOOK algorithms. This question has 0 answers so far.
0	List the differences between process and program. This question has 0 answers so far.
0	List the differences betweer. page and segment. This question has 0 answers so far.
0	List the differences between Batch processing and multiprocessing systems. This question has 0 answers so far.
0	List the differences between deadlock and starvation. This question has 0 answers so far.
0	Discuss Demand Page memory management technique in detail. This question has 0 answers so far.
0	Why an operating system is known as "Resource manager"? Explain its function in detail. This question has 0 answers so far.
0	Explain Critical Section Problem and discuss the various algorithms to solve synchronization problers. List the advantages and disadvantage of each algorithm. This question has 0 answers so far.
0	What do you understand about process scheduling? Why is it important?Explain the various process scheduling techniques with the help of examples. This question has 0 answers so far.
0	Explain the Dedicated device terms used in Device management. This question has 0 answers so far.
0	Explain the Channel terms used in Device management. This question has 0 answers so far.
0	Explain the Control unit used in Device management. This question has 0 answers so far.
0	Discuss the SCAN Disk Scheduling technique with an example. This question has 0 answers so far.
0	Discuss the LOOK Disk Scheduling technique with an example. This question has 0 answers so far.
0	Discuss the general model of a file system. Al o, explain the steps to map a logical address to its physical address. This question has 0 answers so far.
0	List the advantages and disadvantages of the Continuous file allocation method. This question has 0 answers so far.
0	List the advantages and disadvantages of the Indexed file allocation method. This question has 0 answers so far.
0	List the advantages and disadvantages of the Heirarical file allocation method. This question has 0 answers so far.
0	What are the main functions of operating system? This question has 0 answers so far.
0	Is it possible to have a deadlock involving only one process? Explain. This question has 0 answers so far.
0	Explain the various states of a process. This question has 0 answers so far.
0	Differentiate between logical and physical address. This question has 0 answers so far.
0	Explain thrashing. This question has 0 answers so far.
0	What is Belady's anomaly? This question has 0 answers so far.
0	Explain Race condition. This question has 0 answers so far.
0	Explain RAID This question has 0 answers so far.
0	What are the various types of devices? Explain. This question has 0 answers so far.
0	Differentiate between starvation and deadlock. This question has 0 answers so far.
0	Define operating systems. Discuss in detail how the operating system can be classified into different categories? This question has 0 answers so far.
0	Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and600 KB (in order), how would each of the first-fit, best fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in order)? Which algorithm makes the most efficient use of memory? This question has 0 answers so far.
0	Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs. This question has 0 answers so far.
0	Consider the reference string: 7,0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2,0, 1, 7, 0, 1. If 3 frames are there in the memory then how many page faults will be there using FIFO, Optimal and LRU page replacement algorithms? This question has 0 answers so far.
0	Explain PCB. This question has 0 answers so far.
0	Explain Dining Philosophers Problem in detail. This question has 0 answers so far.
0	Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 147, 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 FIFO, SSTF, SCAN LOOK, C-SCAN, C-LOOK. This question has 0 answers so far.
0	What are the various ways for deadlock prevention? Explain. This question has 0 answers so far.
0	How will you protect files of a user from other user in a computer?Discuss This question has 0 answers so far.
0	Describe directory structure of a file system. This question has 0 answers so far.
0	List the advantages and disadvantages of the Contiguous Memory allocation File-Allocation methods. This question has 0 answers so far.
0	List the advantages and disadvantages of the Linked Allocation File Allocation methods. This question has 0 answers so far.
0	List the advantages and disadvantages of the Indexed Allocation File Allocation methods. This question has 0 answers so far.
0	List the differences between short term and long term scheduling. This question has 0 answers so far.
0	List the differences between process and program. This question has 0 answers so far.
0	List the differences between page and segment. This question has 0 answers so far.
0	List the differences between Batch processing and multiprocessing systems. This question has 0 answers so far.
0	List the differences between deadlock and starvation. This question has 0 answers so far.
0	Discuss Demand Page memory management technique in detail. This question has 0 answers so far.
0	Consider the page trace- 3,1,2,5,4,1,2,5,2,1,3. Find the failure frequency for "FIFO and Least recent used" page replacement policy. This question has 0 answers so far.
0	Why an operating system is known as "Resource manager"? Explain its function in detail. This question has 0 answers so far.
0	Explain 'Critical Section Problem' and discuss the various algorithms to solve synchronization problem. List the advantages and disadvantage of each algorithm. This question has 0 answers so far.
0	What do you understand about process scheduling? Why is it important?Explain the various process scheduling techniques with the help of examples. This question has 0 answers so far.
0	Discuss Banker's algorithm in detail. Also provide an example for Banker's algorithm. This question has 0 answers so far.
0	Explain the Dedicated device terms used in Device management. This question has 0 answers so far.
0	Explain the channel terms used in Device management. This question has 0 answers so far.
0	Explain the Control unit terms used in Device management. This question has 0 answers so far.
0	Discuss the SCAN Disk Scheduling technique with an example. This question has 0 answers so far.
0	Discuss the lOOK Disk Scheduling technique with an example. This question has 0 answers so far.
0	Discuss the general model of a file system. Also, explain the steps to mapa logical address to its physical address. This question has 0 answers so far.
0	List the advantages and disadvantages of the Continuous file allocation method. File Allocation methods: This question has 0 answers so far.
0	List the advantages and disadvantages of the Indexed file allocation method File Allocation methods. This question has 0 answers so far.
0	List the advantages and disadvantages of theHeirarical file allocation method File Allocation methods. This question has 0 answers so far.
0	What are the main steps you will take, before starting an application development task? This question has 0 answers so far.
0	Explain logical versus physical address space. This question has 0 answers so far.
0	List the differences between pre-eniptive and non-pre-emptive scheduling. This question has 0 answers so far.
0	Explain bit-interleaved parity organization and block-interleaved parity organization. This question has 0 answers so far.
0	Explain logical and physical file system. This question has 0 answers so far.
0	Discuss various types of fragmentation and memory allocation strategies. This question has 0 answers so far.
0	Explain the concept of thrashing. This question has 0 answers so far.
0	What is Page Replacement? What is its importance? Explain Least Recently Used Replacement Algorithm. This question has 0 answers so far.
0	What is a Semaphore? Describe the Readers Writers problem. This question has 0 answers so far.
0	What is the critical section problem? What are the three requirement that must be satisfied by a good solution to the critical section problem? This question has 0 answers so far.
0	Discuss Banker's Algorithm in detail. This question has 0 answers so far.
0	Discussion Resource Allocation Graph Algorithm in detail. This question has 0 answers so far.
0	Discuss various types of disk scheduling techniques. This question has 0 answers so far.
0	Explain the concept of buffering. This question has 0 answers so far.
0	Explain directory structure of file system. This question has 0 answers so far.
0	Discuss general model of file system. This question has 0 answers so far.
0	What are the different approaches to user authentication? This question has 0 answers so far.
0	Explain the various types of threats to system security. This question has 0 answers so far.
0	What is the difference between parallel and distributed system? Discuss in brief. This question has 0 answers so far.
0	What do you mean by a process? Discuss its states in brief. This question has 0 answers so far.
0	Define the difference between preemptive and non-preemptive scheduling. This question has 0 answers so far.
0	Is it possible to have a dead lock involving only one process? Explain your answer. This question has 0 answers so far.
0	What are the conditions that lead to a dead lock? This question has 0 answers so far.
0	Discuss file attributes in brief. This question has 0 answers so far.
0	Discuss layered form of a file system. This question has 0 answers so far.
0	What are the three main purposes of an operating system? This question has 0 answers so far.
0	How is frames allocation among various processes? Discuss. This question has 0 answers so far.
0	What are the activities that take place when a computer system, say PC is powered on? This question has 0 answers so far.
0	Discuss continuous memory allocation to processes This question has 0 answers so far.
0	Discuss LRU page replacement algorithm. This question has 0 answers so far.
0	Describe shortest-Job-First scheduling algorithm. This question has 0 answers so far.
0	What are the mechanism to evaluate an algorithm related to CPU scheduling? Discuss any one of them. This question has 0 answers so far.
0	Describe the Dining -Philosophers problem and provide its solution. This question has 0 answers so far.
0	How will you handle synchronization problem using hardware instructions?Discuss This question has 0 answers so far.
0	What are the services provided by Keral VO sub system?Discuss any two of them. This question has 0 answers so far.
0	Describe Disk formatting. This question has 0 answers so far.
0	Discuss Banker's algorithm. This question has 0 answers so far.
0	What is a resource allocation graph? Why is it needed? Discuss. This question has 0 answers so far.
0	How will you protect files of a user from other user in a computer?Discuss This question has 0 answers so far.
0	Describe directory structure of a file system. This question has 0 answers so far.
0	Explain the differences between logical and physical addresses? This question has 0 answers so far.
0	What are internal and external fragmentations in memory?management? Which Memory management techniques cause them and which do not? Explain with proper justification. This question has 0 answers so far.
0	What is spooling? This question has 0 answers so far.
0	What are different process states? Draw the process state diagram showing various state transitions. This question has 0 answers so far.
0	What is the significance of semaphores? How are they useful in Process Synchronisation and Critical sections problem? Explain with the help of appropriate examples. This question has 0 answers so far.
0	What resources are used when a thread is created? How do they differ from those used when a process is created? This question has 0 answers so far.
0	What is the difference between Multiprogramming and Multitasking Systems? Explain. This question has 0 answers so far.
0	What are the important functions of the Operating System? Why is it called a Resource Manager? This question has 0 answers so far.
0	What are the pre-requisites for a deadlock to occur? Explain in detail. This question has 0 answers so far.
0	What are the various methods of handling deadlocks? Explain (with special stress on Banker's Algorithm) This question has 0 answers so far.
0	What are the different file allocation techniques used by OS? Mention their relative advantages and disadvantages? This question has 0 answers so far.
0	What problems could occur if a system allowed a file system to be mounted simultaneously at more than one location? This question has 0 answers so far.
0	Discuss in brief threats to security in any computing environment. This question has 0 answers so far.
0	Explain the term device driver in context of device management. This question has 0 answers so far.
0	Write short notes on Working Set Model. This question has 0 answers so far.
0	Write short notes on System Cells. This question has 0 answers so far.
0	Write short notes on Kernel. This question has 0 answers so far.
0	Write short notes on Multithreading. This question has 0 answers so far.
0	Given the following disk head movement reference stream. Consider the disk head is initially at 45. Find out the total head displacement for (i)FCFS (ii)SSTF (iii)C-SCAN (iv)Look Algorithms 90.150, 160,85,120,200,150,65,20,100,150 This question has 0 answers so far.
0	a. List and explain the functions and services of an operating system and OS operations. This question has 0 answers so far.
0	b. What are virtual machines? Explain VM-WARE architecture with a neat diagram. This question has 0 answers so far.
0	c. Differentiate between multiprogramming, multiprocessing and multitasking systems. This question has 0 answers so far.
0	a. Explain process states with state transition diagram. Also explain PCB with a neat diagram. This question has 0 answers so far.
0	b. What is IPC? Explain Direct and Indirect communication with respect to message passing systems. This question has 0 answers so far.
0	c. Consider the following set of process with arrival time and Burst time. A LARGER priority number has a higher priority Draw the Gantt chart and calculate waiting time and turnaround time using i) FCFS ii) Pre emptiye priority scheduling algorithm. This question has 0 answers so far.
0	a. What are semaphores? Explain Binary and counting semaphores with an example. This question has 0 answers so far.
0	b. What do you mean by RACE? Explain Readers - writer's problem with semaphore in detail. This question has 0 answers so far.
0	c. What are monitors? Explain with a neat diagram how monitors are used to solve bounded buffer problem. This question has 0 answers so far.
0	a. What is a dead lock? What are necessary conditions an OS must satisfy for a deadlock to occur? This question has 0 answers so far.
0	b. What are the different methods to handle deadlocks? Also explain Deadlock prevention and deadlock avoidance. This question has 0 answers so far.
0	c. For the following snapshot. Find the safe sequence using Banker's algorithm. i) Is the system in safe state? This question has 0 answers so far.
0	c. For the following snapshot. Find the safe sequence using Banker's algorithm. ii) If a request from process P, arrives for (002), can the request be granted immediately? This question has 0 answers so far.
0	a. What are Translation load aside buffers (TLB)? Explain TLB in detail with a simple paging system with a neat diagram. This question has 0 answers so far.
0	b. Given the memory partitions of 100K, SOOK, 200K, 300K, and 600K apply First fit and Best fit algorithm to place 212K, 417K, 112K, 426K. This question has 0 answers so far.
0	c. Consider the following page reference string 70120304230321201701 for a memory with three (03) Frames. How many page Faults occur for LRU and FIFO page replacement algorithms? Which is efficient among both? This question has 0 answers so far.
0	a. What is a file? Explain in detail different allocation methods. This question has 0 answers so far.
0	b. What are directories? List different types of directory structures with examples. Mention their advantages and disadvantages. This question has 0 answers so far.
0	c. Explain how free space is managed. This question has 0 answers so far.
0	a. Let a disk drive has 5000 cylinders from 0 to 4999. Currently drive is at 143 cylinder, and the previous request was at cylinder 125. Queue of pending request in FIFO order is 86, 1470, 913, 1774,948, 1509, 1022, 1750, 130. What is the total distance the disk arm moves to satisfy all the pending requests for each of the following disk scheduling algorithms from current position i) FCFS ii) SCAN iii)LOOK. This question has 0 answers so far.
0	b. What is protection Distinguish between mechanism and policies. Explain briefly Access matrix with domains as objects. This question has 0 answers so far.
0	a. With a neat diagram explain in detail components of a Linux system. This question has 0 answers so far.
0	b. Explain the different IPC mechanisms available in Linux in detail. This question has 0 answers so far.
0	c. Explain process scheduling and kernel synchronization in detail. This question has 0 answers so far.
0	Define OS. What are the common tasks performed by an operating system? This question has 0 answers so far.
0	Explain briefly, the different classes of operating system, with primary concern and key concepts. This question has 0 answers so far.
0	What are the operations performed by Kernel when an interrupt occurs? This question has 0 answers so far.
0	Explain : (i) Monolithic OS and (ii) Microkernal OS. Specifying advantages and dis-advantages in each case. This question has 0 answers so far.
0	Define the following with respect to an operating system: (i) Policies and mechanisms. (ii) Portability and Extensibility. This question has 0 answers so far.
0	Briefly explain the concept of VMOS, with an example. This question has 0 answers so far.
0	Briefly explain four kinds of process interaction. This question has 0 answers so far.
0	With state transition diagram, explain the state transition for a process. This question has 0 answers so far.
0	what are the advantages of threads? Explain briefly Kernel-level and user-level threads, specifying advantages and disadvantages. This question has 0 answers so far.
0	Explain Kernel memory allocator methods. This question has 0 answers so far.
0	What are the key features in static and dynamic memory allocation? This question has 0 answers so far.
0	Explain briefly memory compaction with an example. This question has 0 answers so far.
0	With reference to virtual memory, explain the following: (i) Demand paging (ii) Page replacement policies. This question has 0 answers so far.
0	Explain UNIX virtual memory. This question has 0 answers so far.
0	Explain file operations performed by processes. This question has 0 answers so far.
0	What are the facilities provided by file-system and IOCS? Write the layered architecture of the system. This question has 0 answers so far.
0	Explain (1) Sequential file organization (ii) Direct file access organization. This question has 0 answers so far.
0	Define Turn-around-time. Compare average Turn-Around-Time, for the following set of process for FCFS and SRN scheduling. This question has 0 answers so far.
0	Briefly explain process scheduling methods for real time applications. This question has 0 answers so far.
0	Explain briefly, scheduling in UNIX. This question has 0 answers so far.
0	How interprocess communication is achieved through mail-box? What are its advantages? This question has 0 answers so far.
0	Explain Synchronous and asynchronous message passing. This question has 0 answers so far.
0	Explain Data- access synchronization. This question has 0 answers so far.
0	Explain Control synchronization. This question has 0 answers so far.
0	What do you mean by context switching? This question has 0 answers so far.
0	Explain the concept of pre-emption. Where it is needed? This question has 0 answers so far.
0	Discuss various types of resources. This question has 0 answers so far.
0	Describe the role of TLB in address translation. This question has 0 answers so far.
0	What is the utility of cache memory in the system? This question has 0 answers so far.
0	What is scheduling criteria for CPU scheduler? This question has 0 answers so far.
0	What do you mean by deadlock? Is it possible to have a deadlock in system involving only single process? This question has 0 answers so far.
0	Discuss various methods for maintaining free spaces on disk. This question has 0 answers so far.
0	Describe the transformation used in magnifications and reduction with respect to the origin. Find the new coordinates of the triangle A(0,0), B(2.2), C(5.4) after it has been: magnified twice its size reduced to half its size This question has 0 answers so far.
0	What is Inode Table? Describe its contents. This question has 0 answers so far.
0	Describe working of paging memory management scheme. Compare paging with segmentation. This question has 0 answers so far.
0	Given memory partitions of 100 K, 500 K and 600 K (in order). Where wil lthe algorithm, namely, best fit, first fit and worst fit place the processes 212K, 417 K, 112K and 426 K (in order) in the memory? Which one algorithm'makes the most efficient use of memory? This question has 0 answers so far.
0	What is the cause of thrashing? What can the system do to eliminate the problem? This question has 0 answers so far.
0	Consider the following page reference string1,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 following replacement algorithm (Assume three frames): (i) FIFO (1) LRU (ii) Optimal This question has 0 answers so far.
0	What do you mean by a page fault? What actions are taken by the operating system when a page fault occurs? This question has 0 answers so far.
0	Discuss the Difference between networked and Distributed operating system. This question has 0 answers so far.
0	Discuss the Difference between multiprogramming and Multi-Processing operating system. This question has 0 answers so far.
0	What do you mean by Critical Section? What are various methods to handle critical section problem? Write a solution for Dining Philosophers problem using Semaphores. This question has 0 answers so far.
0	Discuss Dekker's Algorithm. This question has 0 answers so far.
0	What is the difference between deadlock avoidance and prevention? This question has 0 answers so far.
0	How can'the no-preemption and circular wait conditions be prevented? This question has 0 answers so far.
0	Suppose that a disk drive has 200 tracks numbered 0 to 199. The drive is currently serving a request at track number 100. The requested tracks, in order received by the disk scheduler are 55,58,39,18,90,160,38,284. What is the total distance in tracks) that disk arm moves to satisfy all the pending requests, for each of the following disk scheduling algorithms? (i) FCFS (ii) SSTF (iii) SCAN (iv) C-SCAN (v) LOOK This question has 0 answers so far.
0	What are various parameters for evaluating Disk performance? Discuss. This question has 0 answers so far.
0	Describe various file allocation methods. Compare and contrast index allocation with contiguous file allocation scheme. This question has 0 answers so far.
0	Why directory structure is required? Discuss various types of directory structures along with respective merits and demerits. This question has 0 answers so far.
0	How data integrity is maintained? Explain. This question has 0 answers so far.
0	An operating system only supports a single directory but allows that directory to have arbitrarily many files with arbitrarily long file names. Can an approximate hierarchical file systern be simulated? How? This question has 0 answers so far.
0	Some systems support many types of structures for file's data, while others simply support a stream of bytes. What are the advantages and disadvantages? This question has 0 answers so far.
0	Describe file access control mechanism. This question has 0 answers so far.
0	Describe Process state diagram. This question has 0 answers so far.
0	What is the role of Medium term scheduler? This question has 0 answers so far.
0	Answer the following: a) Compare multi-programmed batch systems and time sharing systems. This question has 0 answers so far.
0	b) Mention any four categories of system program. Explain them. This question has 0 answers so far.
0	c) Explain Memory Management Strategies. This question has 0 answers so far.
0	d) Explain the process between mapping of Logical Address space and Physical Address space. This question has 0 answers so far.
0	e) How does many-to-one thread model differ from one-to-one model?Explain This question has 0 answers so far.
0	f) Mention the necessary conditions for a deadlock situation to arise. This question has 0 answers so far.
0	g) Compare FA32 and NTFS file systems. This question has 0 answers so far.
0	a) Explain the features of parallel systems and distributed systems. This question has 0 answers so far.
0	b) Compare contiguous versus non contiguous memory cause allocation techniques. This question has 0 answers so far.
0	c) Explain the address generation in segmentation with paging. This question has 0 answers so far.
0	a) Explain any two page-replacement algorithms Give an illustration. This question has 0 answers so far.
0	b) Mention the causes that effect thrashing. How does the degree of multiprogramming and CPU utilization effect thrashing. This question has 0 answers so far.
0	b) Mention the causes that effect thrashing. How does the degree of multiprogramming and CPU utilization effect thrashing. This question has 0 answers so far.
0	b) Mention the causes that effect thrashing. How does the degree of multiprogramming and CPU utilization effect thrashing. This question has 0 answers so far.
0	b) Mention the causes that effect thrashing. How does the degree of multiprogramming and CPU utilization effect thrashing. This question has 0 answers so far.
0	b) Mention the causes that effect thrashing. How does the degree of multiprogramming and CPU utilization effect thrashing. This question has 0 answers so far.
0	c) Explain the process scheduling. Draw the process state diagram. This question has 0 answers so far.
0	a) Explain various types of Inter-process Communication. Give aillustration for each. This question has 0 answers so far.
0	b) The following processes arrive for execution at the times indicated below Process Arrival Use non-preemptive scheduling to answer the following: ii) What is the average turnaround time for these process with SJF scheduling algorithm? This question has 0 answers so far.
0	b) The following processes arrive for execution at the times indicated below Process Arrival Use non-preemptive scheduling to answer the following: i) What is the average turnaround time for these processes with FCFS scheduling algorithm? This question has 0 answers so far.
0	c) Show that, if the wait and signal operation are not executed atomically (in process synchronization), then mutual exclusion may be violated. This question has 0 answers so far.
0	a) Consider a system consisting of m resources of the same type,being shared by n processes. Resources can be requested and released by processes only one at a time. Show that the system is deadlock-free if the following two conditions hold: i) The maximum need of each process is between 1 and m resources ii) The sum of all maximum needs is less than min. This question has 0 answers so far.
0	b) Write Banker's algorithm to decide whether a system is a safe state. This question has 0 answers so far.
0	c) Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock-free. Give an illustration. This question has 0 answers so far.
0	a) Explain the following disk scheduling algorithms: i) FCFS This question has 0 answers so far.
0	a) Explain the following disk scheduling algorithms: ii) SSTF This question has 0 answers so far.
0	a) Explain the following disk scheduling algorithms: iii) C-SCAN This question has 0 answers so far.
0	b) Explain the role of Caching and Buffering used in device management. Mention their respective attributes. This question has 0 answers so far.
0	c) Explain the recovery techniques used in deadlock. This question has 0 answers so far.
0	Write short notes on the following: a) Two-Level Directory Structure This question has 0 answers so far.
0	Write short notes on the following: b) File organization techniques, This question has 0 answers so far.
0	Write short notes on the following: c) File access control This question has 0 answers so far.
0	Write short notes on the following: d) Data Integrity Protection This question has 0 answers so far.
0	Write short notes on the following: e) Queue Scheduling. Give its Explain Multilevel Feedback applications. This question has 0 answers so far.
0	Explain semaphores. What happens when the value of semophores is negative? This question has 0 answers so far.
0	Write a short note on Batch System. This question has 0 answers so far.
0	What is Thrashing? What are possible solutions for this problem? This question has 0 answers so far.
0	What is boot block? This question has 0 answers so far.
0	Write a short note on buffering. This question has 0 answers so far.
0	Discuss some operations that could be performed on a directory. This question has 0 answers so far.
0	Explain Denial of service. This question has 0 answers so far.
0	Write short notes on the Swap space management. This question has 0 answers so far.
0	What is fragmentation? What are the various measures to avoid fragmentation? What are the necessary conditions for a deadlock to occur? This question has 0 answers so far.
0	Explain the concept of paging and demand paging. This question has 0 answers so far.
0	Discuss in detail the process of segmentation. This question has 0 answers so far.
0	Explain in detail the concept of swapping. This question has 0 answers so far.
0	Consider the reference string: 1,2,3,2,1,5,2,1,6,2,5,6,3,1,3,6,1,2,4,3. If 3 frames are there in memory then how many page faults will be there using following page replacement algorithms: (1) FIFO (ii) Optimal (iii) LRU This question has 0 answers so far.
0	What is the critical section problem? What are the three requirement that must be satisfied by a good solution to the critical section problem? This question has 0 answers so far.
0	Explain Readers-Writers problem in detail. This question has 0 answers so far.
0	Define process. Explain various states that process undergoes with the help of process state diagram. This question has 0 answers so far.
0	What are the various operations that could be carried out on a process? This question has 0 answers so far.
0	What are the various ways to recover from deadlock? This question has 0 answers so far.
0	Write a short note on following: - (i) Dedicated Devices (ii) Virtual Devices (iii) Shared Devices (iv) Storage Devices This question has 0 answers so far.
0	Explain various access methods available for accessing a file. This question has 0 answers so far.
0	Write a short note on user authentication. This question has 0 answers so far.
0	Explain some basic operations that could be carried on a file. Also specify what information are associated with an open file. This question has 0 answers so far.
0	Write a short note on various program threats and system threats. This question has 0 answers so far.
0	Write a short note on buffering. This question has 0 answers so far.
0	What are the necessary conditions for a deadlock to occur. This question has 0 answers so far.

Login

Add your mobile number

Verify your mobile number

Sign up

Set a password

Reset password

Reset password

Use these filters to find papers

Operating Systems

IPJugaad Plus

Feeling a bit shaky about your career in this crazy market?