Scribd
Upload
3 views

Module 3 and Module 4 Question Banks

Nigga

Uploaded by

Ankur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Module 3 and Module 4 Question Banks

Nigga

Uploaded by

Ankur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

CAMBRIDGE INSTITUTE OF TECHNOLOGY

KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

Q.No QUESTION MODULE- 3 QUESTIONS


1

2.

3.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

6.
7.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

9
10

11
12.

13
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

14

Sl.No Module 3 chapter 2 questions

1.

2.

3.

4.

5.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

6.

7.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

8.

9.

10.

11.
12.

13. Explain banker’s algorithm for deadlock avoidance.


14. Explain about deadlock detection algorithm in detail.
15.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

Sl.No Module 3 chapter 2 questions

1.

2.

3.

4.

5.

6.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

7.

8.

9.

10.

11.
12.

13. Explain banker’s algorithm for deadlock avoidance.


14. Explain about deadlock detection algorithm in detail.
CAMBRIDGE INSTITUTE OF TECHNOLOGY
KR PURAM, BENGALURU-560036.
AUTONOMOUS

MODULE 3 AND 4 QUESTION BANK


Subject Name: Operating Systems with Unix Semester: III

Subject code :23CS206

Module -4 Questions
1. What are the memory management requirement?
2. What do you mean by fixed partition memory management scheme?
3. What is the main advantage and disadvantage of fixed partition.
4. What do you mean by dynamic partitions memory management scheme?
5. What is the main advantage and disadvantage of dynamic partition.
6. Discuss in detail about contiguous memory allocation with illustration.
7. Explain memory management hierarchy.
8. What is memory management unit?
9. What is relocation?
10. illustrate the relocation and linking actions performed by the linker. With example.
11. Explain Static and Dynamic Relocation of Programs .
12. Explain Static and Dynamic Linking
13. Explain Static and Dynamic memory Allocation?
14. Explain Execution of Program with an example.
15. Explain in detail about paging in a memory management scheme.
16. Explain structure of page table with respect to hierarchical paging.
17. Explain the process of segmentation.
18. Explain two type of memory allocation process.
19. Write a short note on
a) The Memory Allocation Model
b) Memory Protection
20. Explain the three methods of memory allocation with a neat diagram explain the hardware support for
relocation and limit register.
21. What is segmentation? Explain the basic method of segmentation with a example.
22. What do you mean by paging?
23. What is advantage and disadvantage of paging?
24. What do you mean by virtual memory?
25. What do you mean by logical address and physical address?
26. What is binding?
27. What registers are used to protect the main memory?
28. Explain non contiguous memory allocation with an example.
29. Draw the diagram of segmentation memory management scheme and explain its principle.
30. Explain virtual memory with help of schematic diagram.
31. Explain demand paging in detail
32. Explain any one of the page replacement algorithm with suitable illustration

You might also like