Download JNTUH MCA 2nd Sem R13 2018 January 812AG Operating Systems Question Paper

FirstRanker.com

Firstranker's choice

Code No: 812AG R13

--- Content provided by FirstRanker.com ---

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

FirstRanker.com

MCA I Semester Examinations, January - 2018

OPERATING SYSTEMS

Time: 3 Hours Max. Marks: 60

--- Content provided by‌ FirstRanker.com ---

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 20 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks and may have a, b, c as sub questions.

PART - A

5 x 4 Marks = 20

1. a) Explain briefly system calls with examples. [4]

--- Content provided by‌ FirstRanker.com ---

2. b) Explain process scheduling with various levels of scheduling. [4]
3. c) In detail explain what are the requirements that memory management technique needs to satisfy? [4]
4. d) Explain about caching, buffering and spooling. [4]
5. e) What is Deadlock? What are the four necessary conditions necessary for a deadlock situation to arise? [4]

PART - B

--- Content provided by‌ FirstRanker.com ---

5 x 8 Marks = 40

1. a) Write the differences between multiprogramming, multitasking and multiprocessing?
   b) What are the challenges in designing a distributed operating system? [4+4]
   OR
2. a) What are the five major activities of an operating system in regard to process management? Explain each activity in detail.
   

   --- Content provided by‌ FirstRanker.com ---

   b) Write in detail about virtual machines and operating system services. [4+4]
3. a) Explain the concept of Binary semaphores and bounded waiting in detail.
   b) Write dining-philosophers problem? Identify an algorithm to solve the problem using semaphores? [4+4]
   OR
4. a) Discuss the round robin CPU Scheduling algorithm in detail.
   

   --- Content provided by‌ FirstRanker.com ---

   b) Define:
   i) CPU-I/O burst cycle
   ii) CPU schedule
   iii) Pre-emptive and non-preemptive scheduling. [4+4]
5. a) With a neat diagram, explain the basic concept of segmentation.
   

   --- Content provided by‍ FirstRanker.com ---

   b) Differentiate between:
   i) logical addressing and physical addressing
   ii) Internal and External fragmentation. [4+4]
   OR
6. a) Explain contiguous memory allocation concept with advantages and disadvantages?
   

   --- Content provided by​ FirstRanker.com ---

   b) What is page fault? How does page fault occur? What action can be taken by operating system when a page fault occurs. [4+4]
7. a) With a neat diagram explain about Unix File system.
   b) Explain the directory implementation method with respect to Linear List. [4+4]
   OR
8. a) What is meant by file sharing? Explain the criteria to be followed in systems which implement file sharing.
   

   --- Content provided by⁠ FirstRanker.com ---

   b) Explain in detail about swap space management. [4+4]
9. a) A process contains 3 programs and each requires three tape units for its operation. Explain the minimum number of tape units which the system must have such that deadlocks never arise is?
   b) Differentiate the various access matrix implementation techniques. [4+4]
   OR
10. a) Define the terms Race condition and critical section.
    

    --- Content provided by⁠ FirstRanker.com ---

    b) Define the Coffman’s conditions that lead to a deadlock. [4+4]

FirstRanker.com