L.J.

College of Computer Applications

Vastrapur, Ahmedabad
Academic Year 2024-25

Subject: Operating System Concepts (DSC-C-BCA-231T ) Assignment 1: Unit I

Chapter 1
1. What is an operating system? What are the basic functions of an operating system?
2. Explain OS as an memory manager.
3. How does OS behave as a process manager.
4. Explain the role of an OS as a device manager.
5. How does OS perform the function as a file manager?
6. Explain the following type of operating system:
i. Batch system
ii. Interactive system (time sharing system)
iii. Real time systems
iv. Hybrid system

Chapter 2 : Memory Management, Early System

Fill in the blanks:
1. Single user contiguous scheme does not support ______________________.
2. In early systems programs needed to be stored on the main memory in ______________ and at
_____________ locations.
3. In _______________ scheme every job is given as much memory as they request.
4. The major disadvantage of fixed partition scheme is _______________________.
5. In _________________ scheme memory is not wasted within a partition.
6. In _________________ scheme memory is at times wasted within a partition.
7. The major disadvantage of dynamic partition scheme is ____________________.
8. ____________________ is performed by the operating system to reclaim the fragmented sections of the
memory space.
9. _________________ is also known as garbage collection.
10. The ___________register stores the highest limit of memory address which can be accessed by each
program.
11. In case of relocation the ______________ register contains a value which has to be added to each address
to generate the actual new address.

Questions
1. Explain Single user contiguous scheme. What is its limitation?
2. How is single user contiguous different from fixed partition scheme?
3. Explain the concept of fixed partitions.
4. What is the limitation of fixed partition? How can you overcome it?
5. State the advantage of fixed partition over single user contiguous allocation scheme.
6. What is internal fragmentation? How does it occur?
7. Explain dynamic partition scheme.
8. What is external fragmentation? How does it occur?
9. Differentiate between Internal and external fragmentation.
10. Compare best-fit with first-fit allocation along with its advantages and disadvantages.
11. What is memory deallocation?
12. How does memory deallocation take place in case of fixed partition method?
13. Explain how deallocation is done in dynamic partition when the block to be deallocated is adjacent to
another free block (Joining two free blocks).

25-07-2024 L J College of Computer Applications

 L.J. College of Computer Applications
Vastrapur, Ahmedabad
Academic Year 2024-25

Subject: Operating System Concepts (DSC-C-BCA-231T ) Assignment 1: Unit I

14. Explain how deallocation is done in dynamic partition when the block to be deallocated is between two
free blocks. (Joining three free blocks)
15. Explain how deallocation is done in dynamic partition when the block to be deallocated is isolated from
other free blocks.
16. What is relocatable dynamic partition?
17. What is compaction/garbage collection//defragmentation? Why is it required?
18. State the significance of bounds register.
19. State the significance of relocation register.
20. What type of values does a relocation register take and under what situation. ? Give example to explain

Chapter 3: Memory Management, Recent System

Fill in the blanks:
1. In paged memory allocation the program is divided into _________.
2. In paged memory allocation the sections of the secondary memory are called _________.
3. In paged memory allocation the sections of the main memory are called _________.
4. The ____________ table contains the details of the pages and their corresponding page frame
number.
5. ________________ concept loads only part of the program for processing.
6. Pages from secondary memory are loaded onto __________ of main memory.
7. A ______________ occurs when the desired page is not in the main memory.
8. The process transfer of pages between the main memory and secondary memory is called
________________.
9. The part of the operating system which handles the page fault is called the
______________________.
10. Excessive amount of swapping between the main memory and the secondary memory is called
________________.
11. A failure to find a page in the main memory is called a ______________.
12. The ____________ bit in the PMT refers to whether data within a page has been changed since it has
been brought on the main memory.
13. The _________________table shows whether a page frame is busy or free.
14. The presence or absence of a page on the page frame is represented by the ___________ bit.
15. The ___________________ concept means that during program execution only a small portion of a
program is being used.
16. Demand paging gives rise to the concept of ______________ memory.
17. The number of page faults can be decreased by increasing the ______________.
18. All pages are of the same size whereas ___________ are of different sizes.
19. ___________ and ________ are page replacement policies
20. In segmented memory allocation the address to a location contains the _____________ and
_________.
21. In segmented paged memory allocation the address to a location contains the _____________ ,
_________and _________.
22. One of the major disadvantage of segmentation is __________________fragmentation .

25-07-2024 L J College of Computer Applications

 L.J. College of Computer Applications
Vastrapur, Ahmedabad
Academic Year 2024-25

Subject: Operating System Concepts (DSC-C-BCA-231T ) Assignment 1: Unit I

Questions
1. Explain paged memory allocation.
2. What is the limitation of paged memory allocation?
3. What is the difference between a page and a page frame.
4. Is there any internal fragmentation in Paged memory allocation? Explain with example
5. What information does the job table give?
6. Discuss the contents of page map table.
7. Discuss the contents of memory map table.
8. Using an example explain the use of a Job table, Page map Table and Memory map table in
Paged memory Allocation.
9. What is address resolution?
10. Explain how address resolution is done for line number 465 in Paged memory allocation.
11. Discuss the advantages and disadvantages of Paged memory allocation.
12. Explain the following terms:
1. Page 7. offset/displacement
2. page frame 8. referenced bit
3. block 9. modified bit
4. page fault 10. status bit
5. segment
6. swapping

13. What is thrashing? How can it be reduced?

14. What is the cause of thrashing?
15. Explain demand paging. What are its advantages and disadvantages?
16. How does demand paging justify the existence of virtual memory?
17. State the contents and their usage of a page map table in demand paging.
18. What is page fault?
19. What is the significance of a modified bit in a demand paging system?
20. What is the role of a modified bit when a page has to be swapped out.
21. What purpose does the referenced bit serve in demand paging system?
22. What is page fault handler? What is its role?
23. Explain the situation: Value of referenced bit 0
Value of modified bit 1
24. Why and when is page replacement policy required?
25. Explain the FIFO and LRU page replacement policy.
26. What is a working Set?
27. What is locality of reference?
28. What is segmented memory allocation?
29. What is segment map table?
30. What is the difference between a page and a segment ?

25-07-2024 L J College of Computer Applications