Download PTU B-Tech CSE-IT 2020 Dec 4th Sem 77539 Operating Systems Question Paper

FirstRanker.com

Total No. of Pages : 02

Roll No.

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

Total No. of Questions : 09

B.Tech. (Information Technology) (2018 Batch) (Sem.-4)

OPERATING SYSTEMS

Subject Code : BTIT-402-18

M.Code : 77539

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

Time : 3 Hrs. Max. Marks : 60

INSTRUCTIONS TO CANDIDATES :

1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

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

SECTION-A

Q1 Write briefly :

1. Differentiate between hard real time and soft real time system.
2. Explain in brief about Multiprogramming systems.
3. What is meant by the state of the process?

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

4. Explain the term Race Conditions in reference to Inter-process communication.
5. What do you mean by Mutual Exclusion? Why mutual exclusion is required?
6. Explain the difference between logical and physical addresses.
7. Differentiate between internal and external fragmentation.
8. What are the methods for handling deadlocks?

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

9. Define Seek Time and Rotational Latency.
10. How free-space is managed using bit vector implementation? List its advantages.

FirstRanker.com

SECTION-B

Q2 Explain in details about following types of OS :

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

1. Time Sharing System (2.5)
2. Parallel System (2.5)

Q3 Explain the following terms in detail in reference to process scheduling :

1. Types of schedulers (2.5)
2. Multiprocessor scheduling (2.5)

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

Q4 Define the term Deadlock. Explain deadlock prevention in detail. (5)

Q5 Write a detailed note on Paging scheme of memory management. (5)

Q6 Write a detailed note on Direct Memory Access. (5)

SECTION-C

Q7 a) Write a brief note on threads. (5)

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

b) Explain the Contiguous and Linked File allocation Methods in detail.

Q8 Explain the following terms related to Inter-Process Communication :

1. Peterson’s Solution (5)
2. Semaphores (5)

Q9 What is the need of Page replacement? Consider the following reference string :

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

7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0, 1

Find the number of Page Faults with FIFO, Optimal Page replacement and LRU with three free frames which are empty initially. Which algorithm gives the minimum number of page faults? (10)

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.

FirstRanker.com

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