Important Questions in Mobile Communication It2402 It 2402 Subject For Nov
Important Questions in Mobile Communication It2402 It 2402 Subject For Nov
YEAR IT Students CS2411 - Operating Systems UNIT I PART- A ( 2 Marks) 1.What is meant by operating systems? 2.How we make a real time projects? Give few examples. 3.Difference between distributed and clustered systems? 4.What is meant by client-server model? 5.When we declare as remote login session. 6. Define FTP vs HTTP. 7. Which systems are called tightly coupled systems. 8. Difference between Batch Systems and Time sharing systems. 9. What is meant by abstract view of system. 10. What is kernel. . PART B 1. Explain the Types of System Calls in detail 2. Explain how hardware protection can be achieved and discuss in detail the dual mode of operations. 3. Explain in detail any two operating system structures 4. List out the services provided by operating system in detail 5. Describe the differences among short-term, medium-term, and long-term scheduling. UNIT II PART- A ( 2 Marks) 1. What is meant by IPC? 2. what is meant by semaphores? 3. Define Critical section. 4. What are the requirement that must required for Critical section algorithms. 5. What are the constraints in Dinning philosophers algorithm. 6. What is meant by mutual exclusion. 7. Declare the structure for monitors. 8. Declare the structure for Critical section. 9. List out two methods for synchronous and Asynchronous tasks. 10. What is the use of system call to perfom I/O? Draw diagram. 11. How we protect CPU using hardware address protection. 12. What is the main difference between WAN and LAN.
13. Cache coherency situation. PART B 1.Consider 1. Explain briefly any four CPU scheduling algorithms with examples 2. Explain Banker's deadlock-avoidance algorithm with an illustration 3. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores 4. Define critical section problem and discuss the three requirements that a solution to the critical section problem must satisfy UNIT III PART- A ( 2 Marks) 1. What is deadlock? 2. What are the conditions necessary to hold for deadlock occur? 3. JVM. 4. Device drivers and DLM 5. Which buffering capacity referred as automatic buffering. 6. Queuing diagram for process scheduling. 7. What is meant by Threads.& Green threads. 8. How multi threading that improve performance over a single threaded solution. 9. Difference between Preemptive and Non-Premptive. 10. Define Turnaround time, waiting time, response time and throughput. PART B 1. Discuss the following page replacement algorithms, giving a suitable page reference string (i) LRU (ii) FIFO and (iii) Optimal 2.exain the most commonly used techniques for structuring the page table 3. Explain the concept of demand paging. How can demand paging be implemented with virtual memory? 4. Explain in detail about memory management in linux UNIT IV PART- A( 2 Marks) 1. Define Virtual memory. 2. Page fault rate? 3. Write about Thrashing. Exactly when it occurs with diagram. 4. Effective access time in Pager. 5. Define TLB? With diagram. 6. What is meant by External and Internal Fragmentation? 7. Distinguish between Prepaging and Demand Paging. 8. Which algorithm is most effective for Page replacement Policy. 9. What are the concepts behind in Swapping and Paging.
10. Give two more comparison about segmentation and paging with/without Virtual scheme. PART B 1. Explain the various directory structure in detail 2. Explain in detail the free space management with neat diagram 3. Explain various file allocation methods in detail. 4. what are the directory implementation techniques available ?Explain in detail UNIT V PART- A ( 2 Marks) 1. What is meant by OS platform independent? 2. How Linux Process Control made? 3. In Laptop and Mobile, Which OS is utilized? 4. What is meant by Consistency Semantics? 5. What is DNS? 6. Explain about Winsock? 7. Write about Windows2000 File Protection and security services. 8. In Disk Scheduling algorithm Objective? 9. Define Seek time and Bandwidth. 10. Explain LDAP. PART B 1. Explain in detail various disk scheduling algorithms with suitable example 2. Explain the services provided by a kernel I/O subsystem 3. Write short notes on the following (i) I/O Hardware (ii) RAID structure