#1
27th July 2015, 09:30 AM
| |||
| |||
Operating System Notes for BCA Madras University
On which syllabus Madras University BCA programme Operating System paper notes based on, please provide here & also give here Operating System question paper??? Madras University BCA programme Operating System paper notes based on giving topics or syllabus: UNIT-I Introduction, What is an operating system, Simple Batch Systems, Multi-programmed Batch systems, Time- Sharing Systems, Personal – Computer Systems, Parallel systems, Distributed systems, Real- Time Systems. Memory Management: Background, Logical versus physical Address space, swapping, Contiguous allocation, Paging, Segmentation Virtual Memory: Demand Paging, Page Replacement, Page- replacement Algorithms, Performance of Demand Paging, Allocation of Frames, Thrashing, Other Considerations UNIT-II Processes: Process Concept, Process Scheduling, Operation on Processes CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple – Processor Scheduling. Process Synchronization: Background, The Critical – Section Problem, Synchronization Hardware, Semaphores, Classical Problems of Synchronization UNIT-III Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock UNIT-IV Device Management: Techniques for Device Management, Dedicated Devices, Shared Devices, Virtual Devices; Input or Output Devices, Storage Devices, Buffering, Secondary Storage Structure: Disk Structure, Disk Scheduling, Disk Management, Swap- Space Management, Disk Reliability UNIT-V Information Management: Introduction, A Simple File system, General Model of a File System, Symbolic File System, Basic File System, Access Control Verification, Logical File System, Physical File system File – System Interface; File Concept, Access Methods, Directory Structure, Protection, Consistency Semantics File – System Implementation: File – System Structure, Allocation Methods, Free- Space Management Questions: PART A- (10 x 3 = 30 marks) Answer any TEN questions. All questions carry equal marks. Each answer should not exceed 50 words. 1.What is compute-server system? 2.Mention any four system components. 3.Draw the diagram of process state. 4.What are the necessary condition for deadlock? 5.What is meant by critical section problem? 6.Define segmentation. 7.Define Page, frames and frame table. 8.Name the different types of page replacement algorithm. 9.What are file attributes? 10.What is meant by Boot control block? 11.What is caching? 12.What are goals of protection? PART B - (5 x 6 = 30 marks) Answer any FIVE questions. All questions carry equal marks. Each answer should not exceed 200 words. 13. Discuss about the real time system. 14. Explain the scheduling algorithm that mainly used for time sharing system. 15. What are the possibilities to recover system from deadlock? 16. Write short notes on segmentation. 17. What are the ways to access the information in the file? Explain briefly. 18. How does DMA increase system concurrency? Explain. 19. Discuss the security problem. PART C - (4 x 10 = 40 marks) Answer any FOUR questions. All questions carry equal marks. Each answer should not exceed 500 words. 20. Explain process scheduling in detail. 21. Discuss the multi threading issues in detail. 22. Why we need semaphore tool? Explain in detail with example. 23. Explain in detail about paging. 24. Explain any two page replacement algorithm. 25. Explain the access matrix. Month & Year of Examination: November - 2011 Subject Code: PK3D Semester: III Year: Second Year Time: Three hours Maximum: 100 marks PART A - (10 * 3 = 30 marks) Answer any TEN questions. All questions carry equal marks. 1. What is multiprogramming? 2. List the objectives of an operating system. 3. What is interprocess communication? 4. What is critical section? 5. What is the difference between page and segment? 6. What is demand cleaning? 7. What is the difference between preemptive and nonpreemptive scheduling? 8. What is interrupt driven I/O? 9. Define seek time and rotational delay. 10. List the advantages of process migration. 11. List the three methods of record blocking. 12. How do determine whether a user’s identity is authentic? PART B - (5 * 6 = 30 marks) Answer any FIVE questions. All questions carry equal marks. 13. Explain the various operating system services. 14. Briefly explain any five criteria for process scheduling. 15. Discuss about semaphores and monitors. 16. Explain the different address translation mechanism in paging. 17. Explain about disk free space management. 18. Discuss about I/O buffering. 19. Explain Access Matrix with an illustration. PART C - (4 * 10 = 40 marks) Answer any FOUR questions. All questions carry equal marks. 20. Describe the different operating system structures. 21. Discuss about any five scheduling algorithms in a uniprocessor environment. 22. Explain about Deadlock detection and Recovery. 23. Describe the different file allocation methods. 24. Explain any four page replacement schemes in detail. 25. Explain any two disk scheduling policies. Month & Year of Examination: April - 2009 Subject Code: PK3D Semester: III Year: Second Year Time: Three hours Maximum: 100 marks PART A - (10 * 3 = 30 marks) Answer any TEN questions. All questions carry equal marks. Each answer should not exceed 50 words. 1. What is I/O burst? 2. Define Semaphore. 3. Define Turn around time. 4. What do you mean by unsafe state? 5. What is deadlock? 6. What is internal fragmentation? 7. Under what circumstances do page faults occur? 8. What is thrashing? 9. Define fragmentation. 10. Define the term virtual memory. 11. What is encryption? 12. What do you mean by memory mapped I/O? PART B - (5 * 6 = 30 marks) Answer any FIVE questions. All questions carry equal marks. Each answer should not exceed 200 words. 13. Discuss in detail about Real time system. 14. Describe deadlock characteristics. 15. Explain the lifecycle of a process with state transition diagram. 16. Describe the basic concepts of paging in detail. 17. Describe the demand paged memory allocation scheme with an example? 18. Explain the secondary storage structures. 19. What are security threats? Explain. PART C - (4 * 10 = 40 marks) Answer any FOUR questions. All questions carry equal marks. Each answer should not exceed 50 words. 20. View the operating system as a resource manager. 21. What are the necessary conditions for a deadlock situation to arise? Discuss the deadlocks in terms of a system resource allocation graphs. 22. Describe single contiguous allocation memory management system. 23. Explain Dynamic memory allocation strategy. 24. Discuss any two page replacement algorithms. 25. Describe the free space management. Last edited by sumit; 19th November 2019 at 03:14 PM. |
#2
16th October 2019, 10:15 AM
| |||
| |||
Re: Operating System Notes for BCA Madras University
here I am looking for Madras University BCA Operating System paper notes/syllabus , so will you plz provide me same here , as my brother asking me for the same ??
|
#3
16th October 2019, 10:16 AM
| |||
| |||
Re: Operating System Notes for BCA Madras University
As you are asking for Madras University BCA Operating System paper notes/syllabus so on your demand I am providing same : UNIVERSITY OF MADRAS Bachelor in Computer Applications (BCA) SEMESTER SYSTEM WITH CREDITS SYLLABUS Semester III - BCA212 - Operating Systems Lecturer/Lab Hours per Week: 6 Duration: 3 hrs Max Makrs: 100 Credit: 4 UNIT I : Introduction: Views- Goals - Types of System- OS Structure - Components - Services - System Structure - Layered Approach - Virtual Machines - System Design and Implementation. Process Management: Process - Process Scheduling - Cooperating Process - Treads - Inter-process Communication. CPU Scheduling: CPU Schedulers - Scheduling Criteria - Scheduling Algorithms. UNIT II : Process Synchronization: Critical-Section Problem - Synchronization Hardware - Semaphores Classical Problems of Synchronization - Critical Region - Monitors. Deadlocks: Characterization- Methods for Handling Deadlocks - Deadlock Prevention - Avoidance - Detection - Recovery. UNIT III : Memory Management: Address Binding - Dynamic Loading and Linking - Overlays - Logical and Physical Address Space - Contiguous Allocation - Internal & External Fragmentation. Non-Contiguous Allocation: Paging and Segmentation Schemes - Implementation - Hardware-Protection - Sharing - Fragmentation. UNIT IV : Virtual Memory: Demand Paging - Page Replacement - Page Replacement Algorithms - Thrashing. File System: File Concepts - Access Methods - Directory Structures - Protection Consistency Semantics - File System Structures - Allocation Methods - Free Space Management. UNIT V : I/O System: Overview - I/O Hardware - Application I/O Interface - Kernel I/O Subsystem - Transforming I/O Requests to Hardware Operations - Performance. Secondary Storage Structures: Protection - Goals - Domain - Access matrix - The Security Problem - Authentication - Threats - Threat Monitoring - Eyncrption. |
Tags |
short term |
|