Operating Systems CS – 204
Assignment No # 3
1) Submit the solution in handwritten hard format not later than 23-12-2022.
2) In case of copied from your friend, both students will be awarded zero or negative marking depending
upon the content copied.
3) Neat and clean solution on A-4 size (white pages or lined pages).
4) Always include and draw diagrams (where necessary) to explain the topic.
CLO #
CLO-2
1.
Objective Full Filled
Analyze and evaluate the algorithms of the core functions of the
Operating Systems and explain the major performance issues
about the core functions.
Domain
BT Level
Cognitive
domain
4, 5
Explain following briefly (draw diagram/dry run if necessary)
a)
b)
c)
d)
e)
f)
Why are page sizes always powers of 2?
What is the purpose of paging the page tables?
What is relocation of a program?
What is address binding? State the different timings when address binding may occur.
Difference between internal and external fragmentation.
Why mobile operating systems such as iOS and Android do not support swapping.
2.
Consider a memory-management system based on paging. The total size of the physical
address space 64 MB, Pages of size 4 KB and the Logical address space of 4GB.
a) No of pages
b) No of Frames
c) No of entries in Page Table
d) Size of Page Table
e) No of bits in Physical Address
f) No of Bits in Logical Address
3.
Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125 KB (in order),
how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 KB, 500
KB, 358 KB, 200 KB, and 375 KB (in order)?
4.
Assuming a 1-KB page size, what are the page numbers and offsets for the following address
references (provided as decimal numbers)?
a) 21205
b) 164250
c) 121357
d) 16479315
5.