Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Question 1 In a system that uses the combined approach of paging and segmentation, the logical space is composed of segments. Each segment can have
Question 1 In a system that uses the combined approach of paging and segmentation, the logical space is composed of segments. Each segment can have a minimal size 1024 bytes and maximal size =215 bytes. Each segment is composed of pages (the page size =512 bytes). Suppose that the size of a process is 256 Mbytes. Indicate the number of bits dedicated to the logical address. Question 2 1. Consider a system using paging whose physical memory size is 64MB. The size of a page is 1KB. Suppose a process of size 55KB. a. Calculate the number of frames in the physical address space and the number of pages in the logical address space. b. Indicate the number of bits required for the physical address and for the logical address. c. How many entries in the page table are needed? d. Each entry in the page table contains only a frame number. What is the size of the page table? 2. Suppose a system that uses the combined approach of segmentation and paging. The logical address is encoded as: (10bits, 5bits, 10bits). Indicate the maximum size of a process. Question 3 Consider three processes P1, P2 and P3 executing the following code: Use semaphores so that the display must be : A1 B1 C1 C2 C3 B2 A2 A3 B3 Question 4 - Write a program in Java to create two threads T1 and T2. T1 creates a thread T3 and T2 creates a thread T4. T1, T2, T3 and T4 are instances of different classes. - Modify the program so that the threads are running in the following order: T1, T3, T2, T4, i.e., at the end of T1, T3 is executed and so on. The main program P must wait the end of all the threads before its termination
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started