Register

Recent questions tagged memory-management

141
views
0 answers
2 votes
Memory Management
Consider a 32-bit computer with page size 2KB and physical memory of 32 GB. Each virtual page has additional 8 bits for hardware control. The computer has a two-level page table. The ... page table entry is: (A) 24 (B) 32 (C) 40 (D) 16
User Avatar
137
views
0 answers
0 votes
Operating System Concept
A system with 2-level page table, the frame size is 4KB; the address register is 32 bits, the row size of the page table is 4 bytes; the address register is divided into (p1, p2, ... Select one:(0, 1, 256)(1, 0, 256)(2, 0, 256)(0, 2, 256)
User Avatar
172
views
0 answers
0 votes
Memory management
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process ... memory allocation techniques:1. First Fit2. Best Fit3. Worst Fit
User Avatar
710
views
1 answers
1 votes
Contiguous memory allocation
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process P2 ... allocation techniques: 1. First Fit 2. Best Fit 3. Worst Fit
User Avatar
142
views
0 answers
1 votes
Andrew S. Tanenbaum (MOS) Edition 5 Exercise 3 Question 16 (Page No. 252)
The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual ... allocated to each process at a minimum, with the maximum number of processes running?
User Avatar
236
views
1 answers
1 votes
Paging
If Page size = Frame size is always true and offset in Logical address = offset in physical address holdsThen how/why Logical address size can come different than physical address size?
User Avatar
328
views
1 answers
0 votes
memory management
we have 8 pages (each side 32B) to store in physical memory of 2^32 bits how many bits are required to identify each page , according to me 3 bits are required but that is wrong plz explain why
User Avatar
714
views
2 answers
9 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 36
Assume a linear page table, with a 1-byte page-table entry. Assume physical and virtual address spaces of size 128 bytes with 32-byte pages. The ... addresses that will get referred in fetch and execute of the above instruction?104210270
User Avatar
382
views
1 answers
1 votes
Array, Memory Allocation
In what cases does an uninitialized array have values = 0 and for which cases does it have values = garbage values. How to differentiate?
User Avatar
861
views
2 answers
3 votes
ISRO 2024
Which of the following heap memory allocation strategies is likely to exploit spatial locality of memory accesses in a program, the most?Best FitFirst FitNext FitLast Fit
User Avatar
312
views
1 answers
0 votes
ISRO 2024
Any attempt by a process to access memory allocated to OS or process of other results intoTrap to OSContext SwitchingPage faultInvocation to Scheduler Despatch
User Avatar
325
views
1 answers
0 votes
Memory System
Design a memory system of capacity 2048x16 using 128x8 RAM chips. Show address lines, data lines, and control signals
User Avatar
443
views
0 answers
1 votes
Memory Management
Assume in a computer supporting paging, virtual addresses are 36 bits long. Page size is 16 KB, no matter which paging structure is used. Assume a page table entry ... table with address division scheme (11, 11, 14).c) Inverted page table.
User Avatar
446
views
1 answers
0 votes
Computer JE exam
consider the following page reference string: 1, 2, 3, 4, 1, 2,5, 1, 2,3,4,5 if program contains 4 page frames then what is difference between page faults ... page replacement algorithms option a . 10option b . 6option c . 4option d . 3
User Avatar
1.6k
views
1 answers
0 votes
Find seek time using FCFS,SSTF, SCAN.C-SCAN, LOOK for the following string 98, 183, 37, 122, 14, 124, 65, 67 Assume that request queue (0-199).and Head pointer 53
Find seek time using FCFS,SSTF, SCAN.C-SCAN, LOOK for the following string98, 183, 37, 122, 14, 124, 65, 67Assume that request queue (0-199).and Head pointer 53
User Avatar
531
views
1 answers
0 votes
Memory Management
Consider a System Using Variable Partition with no CompactionFree holes : 4K; 8K; 20K; 2KProgram size: 2K; 14K; 3K; 6K; 10K; 20K; 2KTime for Execution: 4 ... of Loading & Time of Completion of each program. The Burst Times are in Seconds.
User Avatar
377
views
2 answers
0 votes
Memory Management And Paging
Can Any explain the relationship between The “ Word Size “ and “ Logical Address Space “
User Avatar
375
views
0 answers
0 votes
Memory Allocation, Garbage Value
Data is never actually deleted from computer, even after freeing (say, a dynamically allocated variable) the variable still has that value which was given to it, ... of time (say, creation) to totally avoid the hassle of garbage values?
User Avatar
Page: