VALLIAMMAI ENGINEERING COLLEGE

Transcription

1 VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year: QUESTION BANK - EVEN SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR DEPARTMENT HANDLED & PREPARED BY OPERATING SYSTEMS CS640 IV II Information Technology Dr.R.Rajalakshmi & Mr.S.Sekar UNIT I Differentiate between tightly coupled systems and loosely coupled systems Understanding BTL-2 2 List out the various operating system components? Remembering BTL- 3 Define Operating System Remembering BTL- 4 What is the responsibility of kernel? Remembering BTL- 5 Differentiate between hard real time systems and soft real time systems. Analysing BTL-4 6 Classify the different interrupt classes. Analysing BTL-4 7 Differentiate between symmetric and asymmetric multiprocessor. Remembering BTL- Is OS a resource Manager? If so justify your answer Applying BTL-3 9 What is meant by system call? Remembering BTL- 0 What is a bootstrap program? Understanding BTL-2 Define the cache read operation. Remembering BTL- 2 Summarize the functions of DMA Evaluating BTL-5 3 Give any two responsibilities of OS file management activities. Understanding BTL-2 4 Do timesharing differs from multiprogramming? If so, How? Applying BTL-3 5 Summarize the objectives and functions of an operating system Understanding BTL-2 6 Why API's need to be used rather than system calls? Evaluating BTL-5 7 How would you build clustered systems? Creating BTL-6 What is the function of System programs? Write the categories in which system program can be divided. Understanding BTL-2 9 Illustrate the use of fork and exec system calls Applying BTL-3 20 How would you justify the circumstances that would a user be better off using a time-sharing system rather than a PC or a single workstation? Creating BTL-6 (i)explain the purpose and importance of system calls and discuss the types of system calls with an examples of each. (0) (ii)discuss about the functionality of system boot with respect to Operating System (6) Evaluating BTL-5 2 Describe briefly how the operating system has been evolved from serial processing to multiprogramming system. Applying BTL-3 3 Explain the various categories of system programs in brief. Remembering BTL- 4 Summarize the essential properties of the following types of operating system Understanding BTL-2 RR & SS/ IT CS640- OS Page of 7

2 (i)batch (4) (ii)time-sharing (4) (iii)real (4) (iv)distributed (4) (i)discuss the multiprocessor system in detail. () (ii)define Operating System. Explain the main functions of an operating Systems () Understanding BTL-2 List five services provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user level programs to provide these services. Creating BTL-6 (i)how would you classify different types of Computer system architecture? () (ii) Explain interrupts in detail. () Applying BTL-3 (i)discuss about the evolution of virtual machines. Also explain how virtualization could be implemented in Operating Systems. (0) (ii)explain Direct Memory Access in detail. (6) Understanding BTL-2 (i)explain the various memory hierarchies with neat block diagram. () (ii) Explain the operating system structure () Remembering BTL- How computer system handles interrupts? Discuss how interrupts can be handled quickly. Analysing BTL-4 UNIT II List out the data fields associated with Process Control blocks. Remembering BTL- 2 Define the term 'Dispatch Latency' Remembering BTL- 3 Is the context switching an overhead? Justify your answer. Analysing BTL-4 Can user-level threads achieve better performance on a multiprocessor system than a single processor system? Justify your answer. Understanding BTL Why is IPC needed? Name the two fundamental models of IPC Remembering BTL- 6 What is a semaphore and mention the operations on semaphore. Remembering BTL- 7 When a system is said to be in safe state? Applying BTL-3 Can you give the reason for providing process cooperation? Analysing BTL-4 What is a critical section and what requirements must a solution to the critical solution problem satisfy? Understanding BTL What is meant by 'starvation' in operating system? Understanding BTL-2 Differentiate preemptive and non-preemptive scheduling Understanding BTL-2 2 Is it possible to have a deadlock with only one process? Justify your answer Evaluating BTL-5 3 Define monitor. What does it consists of? Remembering BTL- 4 Compare user threads and kernel threads. Analysing BTL-4 5 What are the benefits of co-operating processes? Understanding BTL-2 6 Show that mutual exclusion will be violated if the signal and wait operations are not executed atomically Applying BTL-3 7 Is it possible to prevent the occurrence of deadlock? Under what conditions? Evaluating BTL-5 If there is a cycle in the resource allocation graph, it may or may not be in deadlock state. Comment on this statement. Creating BTL-6 How can you judge a scheduling algorithm to be the best? Define any four 9 scheduling criteria used to compare the scheduling algorithms Creating BTL-6 20 What is race condition? Remembering BTL- RR & SS/ IT CS640- OS Page 2 of 7

3 (i)explain the FCFS, preemptive and non-preemptive versions of Shortest Job First and Round Robin (time-slice2) scheduling algorithms with Gantt Chart for the four processes given. Compare their average turn around and waiting time. (2) Process Arrival Time Burst time P 0 0 P2 6 P3 2 2 P4 3 5 (ii)discuss how deadlock could be detected in detail (4) Analysing BTL-4 (a)show how wait() and signal() semaphore operations could be implemented in multiprocessor environments, using Test and Set instructions. The solution should exhibit minimal busy waiting. Develop pseudo code for implementing operations. (0) 2 (b)discuss about issues to be considered with multithreaded programs (6) Creating BTL-6 Evaluate the following snapshot of the system Allocation Max Available P P P P P Answer the following based on banker s algorithm..define safety algorithm (4) 2.What is the content of need matrix? (4) 3.Is the system in a safe state? (4) 4.Is a request from process Parrives for(0,4,2,0) can the request be granted 3 immediately? (4) Evaluating BTL-5 (a).describe various approaches for recovering from deadlock (0) 4 (b).discuss various states of a process (6) Understanding BTL-2 Explain the differences in degree to which the following scheduling algorithms discriminate in favour of short processes a)fcfs (5) b) RR (6) 5 c) Multilevel feedback queue (5) Evaluating BTL-5 6 Write about deadlock conditions and banker's algorithm in detail Remembering BTL- (a)give and explain a monitor solution for dining philosopher problem (0) 7 (b)what is a process? Describe the operation on a process in detail. (6) Understanding BTL-2 (a)what are the criteria for evaluating the performance of scheduling algorithms? (4) (b)discuss about the approaches for evaluating the scheduling algorithms. (2) Applying BTL-3 (a)can you discuss the advantages of threads over multiple processes? What major disadvantages do they have? And also elaborate the various issues associated with the thread in detail? (0) 9 (b)how does deadlock avoidance differ from deadlock prevention? (6) Analysing BTL-4 (a) Define semaphore. Explain the use of semaphore in synchronization problem with an example (0) 0 (b) Distinguish among long term, short term and medium term scheduler. (6) Remembering BTL- UNIT III RR & SS/ IT CS640- OS Page 3 of 7

4 Mention the significance of LDT and GDT in segmentation Understanding BTL-2 2 Differentiate between page and segment Understanding BTL-2 3 How the problem of external fragmentation can be solved? Analysing BTL-4 4 What is a working set model? Remembering BTL- 5 Assume a paging system with page table stored in memory. If a memory reference takes 200 nanoseconds, how long a paged memory reference? Creating BTL-6 6 What do you mean by page fault? Remembering BTL- If a system supports 6 bit address line and K page size, what is the maximum 7 number of pages? Evaluating BTL-5 What are overlays? What is the use of it? Understanding BTL-2 9 What is virtual memory? Mention its advantages Remembering BTL- 0 What is meant by address binding? Mention the different types. Remembering BTL- What are advantages of dynamic linking and loading? Understanding BTL-2 2 What is the cause of thrashing? How does the system detect thrashing? Analysing BTL-4 Is it possible for a process to have two working sets, one representing data and another representing code? Evaluating BTL What do you mean by compaction? In which situation is it applied? Applying BTL-3 5 Differentiate demand paging and swapping Understanding BTL-2 6 What is meant by prepaging? Is it better than demand paging? Creating BTL-6 7 Define TLB Remembering BTL- What is the need for inverted page table? Analysing BTL-4 Which criteria do you consider to Evaluating various page replacement 9 algorithms to select the best one? Applying BTL-3 20 Contrast global vs. local page replacement techniques Applying BTL-3 (a)consider the following page reference string:, 2, 3, 4, 5, 3,4,,6,7,,7,, 9, 7,, 9, 5, 4, 4, 5, 3 How many page faults would occur for the following replacement algorithms, assuming four frames? Remembering all frames are initially empty. i) LRU replacement ii) FIFO replacement iii) Optimal replacement Evaluating BTL-5 (a)with a neat sketch, explain how logical address is translated into physical address using Paging mechanism. (0) 2 (b)write short notes on memory-mapped files (6) Remembering BTL- 3 Illustrate contiguous memory allocation schemes, give examples. List the advantages and disadvantages. Evaluating BTL-5 4 (a)elaborate on inverted page tables and their use in paging and segmentation () (b)explain in detail about segmentation and implementation of Segment tables () Understanding BTL-2 5 What is demand paging? Describe the process of demand paging in OS Understanding BTL-2 6 Given that main memory composed of three page frames for public use and that a program request pages in the following order A, B, A, C, D, A, B, D, B, A, C, A, C, D Using FIFO and LRU page removal algorithms do a page trace analysis and compute their page faults and success Creating BTL-6 RR & SS/ IT CS640- OS Page 4 of 7

5 7 Given memory partitions of 500 KB, 00 KB, 300 KB, 200 KB and 600 KB in order, how would each of the first-fit, best-fit, and worst-fit algorithms place processes of size 4 KB, 202 KB, 506 KB, 2 KB, and 95 KB (in order)? Which the algorithms makes the most efficient use of memory? Analysing BTL-4 Describe the various techniques for structuring the page table in a page memory management scheme Remembering BTL- a)explain in detail about thrashing () 9 b)explain in detail about allocation of kernel memory () Remembering BTL- 0 With a neat sketch, explain in detail about segmentation and paging (6) Applying BTL-3 UNIT IV Compare the various file access methods Evaluating BTL-5 2 Differentiate bit map based allocation of blocks on disk and a free block list Analysing BTL-4 3 Illustrate the techniques used to protect the user files Applying BTL-3 4 Compare file protection and security Analysing BTL-4 5 List the responsibility of the file manager Remembering BTL- 6 Differentiate the various file allocation methods Applying BTL-3 7 Do FAT file system is advantageous? Why? Analysing BTL-4 Illustrate the pros and cons of a fixed head disk and a moving head disk. Applying BTL-3 9 Define rotational latency. Remembering BTL- 0 Define UFD and MFD. Remembering BTL- Give the disadvantages of Contiguous allocation Understanding BTL-2 2 Name any four common file types. Write the various file attributes. Understanding BTL-2 3 What are the two types of system directories? Remembering BTL- 4 What characteristics determine the disk access speed? Understanding BTL-2 5 Mention the objectives of file management system. Understanding BTL-2 6 What is the need for disk scheduling? Give the various disk scheduling methods. Remembering BTL- 7 Define log structured file. What are the disadvantages of log-structured file systems? Remembering BTL- Which disk scheduling algorithm would be the best to optimize the performance of a RAM disk? Evaluating BTL-5 9 State any three disadvantages of placing functionality in a device controller, rather than in the kernel Creating BTL-6 20 Give the importance of swap space management Understanding BTL-2 RR & SS/ IT CS640- OS Page 5 of 7

6 Assume the head of a moving disk with 200 tracks, numbered 0.99, is currently serving a request at track 92, and has just finished a request at track 5 and the queue request is kept in the FIFO order, 09, 4, 9, 72, 26, 42. What is the total head movement needed to satisfy these requests for the SCAN,C- SCAN,LOOK and C-LOOK disk scheduling algorithms? Creating BTL-6 (i)compare the functionalities of FIFO, SSTF, C-SCAN, and C-LOOK disk scheduling algorithms with an example for each (2) 2 (ii) Write short notes on free space management (4) Analysing BTL-4 (i)explain about the RAID structure in disk management with various RAID levels of organization in detail (0) 3 (ii) Briefly discuss about the various directory structure (6) Evaluating BTL-5 (i) Define swapping. Describe how swap space is managed by an operating system (0) 4 (ii) Explain the issues in designing a file systems (6) Remembering BTL- (i)explain in detail about the commonly used file operations with example. () 5 (ii)explain file system along with its different components. () Remembering BTL- 6 Distinguish between the different file access methods Understanding BTL-2 7 Illustrate how the free space list is implemented and define what is free space management Applying BTL-3 Explain the different file allocation methods with neat diagram. Mention the advantages and disadvantages. Applying BTL-3 9 Explain and analyse the common schemes available for defining the logical structure of a directory Analysing BTL-4 (i) Describe how the disk space from deleted files can be reused () 0 (ii)describe the life cycle of I/O request in detail () Understanding BTL-2 UNIT V Give the design principles of LINUX system Understanding BTL-2 2 Mention the various components of a Linux System Understanding BTL-2 3 Illustrate the components of kernel modules. Remembering BTL- 4 Define LINUX virtualization Remembering BTL- 5 Classify virtualization. Analysing BTL-4 6 Define hypervisor. Remembering BTL- 7 What are the two components of hypervisor? Understanding BTL-2 Compare the types of hypervisor? Analysing BTL-4 9 Define XEN. Remembering BTL- 0 What are the components of XEN? Remembering BTL- Mention the two types of guest supported by XEN hypervisor? Understanding BTL-2 2 What is Domain Name System (DNS)? Remembering BTL- 3 Prepare a list of LINUX system administrator responsibilities. Creating BTL-6 4 Illustrate the requirements needed for LINUX system administrator. Applying BTL-3 5 Mention the key features of VMware server virtualization Understanding BTL-2 6 What is guest operating system? Remembering BTL- Compare the relationship between a guest operating system and a host operating system in a system like VMware what factors need to be considered in choosing the host operating system? Evaluating BTL-5 7 What is demand-zero memory? Remembering BTL- 9 Illustrate the types of LINUX device classes. Applying BTL-3 RR & SS/ IT CS640- OS Page 6 of 7

7 20 List the three layers of networking in LINUX kernel. Understanding BTL-2 Explain the significance and steps involved in setting up Xen, VMware software on LINUX HOST for successful virtualization. Evaluating BTL-5 (i)discuss about the requirements to become a Linux system Administrator (6) (ii)discuss about the steps involved in the installation of a LINUX Multifunction server (6) 2 (iii)write short notes on the LINUX network services (4) Understanding BTL-2 3 Explain in detail the memory management in LINUX system Remembering BTL- 4 Describe about the network structure of LINUX system. Understanding BTL-2 5 Explain the procedure for setting XEN on LINUX host and adding guest OS. Evaluating BTL-5 6 Prepare the procedure for setting VMware on LINUX host and adding guest OS. Creating BTL-6 Explain in detail the design principles, kernel modules, process management, 7 scheduling in LINUX system Remembering BTL- Illustrate the Domain Name System and the steps in resolution. Analysing BTL-4 9 Summarize about I/O in LINUX system Applying BTL-3 0 Explain in detail about file system management done in LINUX Remembering BTL- Verified by :. 2. [ ] [ ] [ ] [ ] Forwarded by Year Coordinator : Approved by HOD : *************** RR & SS/ IT CS640- OS Page 7 of 7