Scribd
Upload
59 views

Test No 4 Os HPSC Subjective

The document contains 6 questions related to operating system concepts like thrashing, disk space allocation methods, paging vs segmentation, memory management, page replacement algorithms, Belady's anomaly, effective memory access time calculations, and virtual memory parameters like page size, frame size, page table size, physical address bits, and number of pages.

Uploaded by

anilgahlawat1987
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
59 views

Test No 4 Os HPSC Subjective

The document contains 6 questions related to operating system concepts like thrashing, disk space allocation methods, paging vs segmentation, memory management, page replacement algorithms, Belady's anomaly, effective memory access time calculations, and virtual memory parameters like page size, frame size, page table size, physical address bits, and number of pages.

Uploaded by

anilgahlawat1987
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

TEST NO 4 – CLASSROOM SUBJECTIVE – OPERATING SYSTEM

Note : 1. Out of 6 questions you need yo attempt only five question.


2. All questions carry equal marks i.e 10 per question.
3. While attempting divide total 1 hour as 12 minute per question.
4. First read all questions carefully then attempt to the point by mentioning
suitable figures and examples.
:- QUESTION SECTION -:

Q – 1: Thrashing is a problem or solution to a problem , explain. What are the


various causes of thrashing . How can recovery be done from thrashing?
3+2+5 marks

Q – 2: Explain various Disk Space allocation methods like Contiguous, Linked


and Indexed allocation in detail. Which one is best out of all three and why?
8+2 marks

Q – 3 :(i) Differentiate between paging and segmentation with suitable


examples. 5 marks
(ii) Differentiate Internal and External Fragmentation with the help of
examples. 5 marks

Q – 4: (i) A Memory management having 64 pages with 512 byte page size.
Physical memory consist of 32 page frames. What is the number of bits
required in logical and physical address respectively? 3 marks
(ii) For the following page reference string 4,3,2,1,4,3,5,4,3,2,1,5 the number
of page faults that occur in least recently used (LRU) page replacement
algorithm with 3 page frame is ________. Show all steps. 4 marks
(iii) What do you mean by Belady’s Anomaly . Show with the help of example.
3 marks
Q – 5: (i) Given memory access time as p nanoseconds and additional q
nanoseconds for handling the page fault. What is the effective memory
access time if a page fault occurs once for every 100 instructions? 4 marks
(ii) Consider a system which has MM access time is 100 nsec and TLB access
time is 20 nsec and TLB hit ratio is 95%. Then what is the effective memory
access time with TLB and without TLB? 3+3 marks

Q – 6: Read the following and answer the questions:


Consider a machine with 16 GB main memory and 32 bits virtual address
space, with page size as 4KB. Frame size and page size is same for given
machine.
(i) If a process size of 34 KB is to be executed on this machine, then
what will be the size of internal fragmentation for this process ?
2marks

(ii) What is the size of page table for handling the virtual address space
, given that each page table entry is of size 2 bytes? 2 marks

(iii) What is the number of bits needed for the physical address? 2
marks

(iv) The number of bits reserved for the frame offset is _______. 2
marks

(v) Find number of pages for given virtual address space? 2marks

You might also like