Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged memory-management
0
votes
1
answer
181
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 1 (Page No. 254)
The $IBM\:360$ had a scheme of locking $2-KB$ blocks by assigning each one a $4-bit$ key and having the CPU compare the key on every memory reference to the $4-bit$ key in the $PSW$. Name two drawbacks of this scheme not mentioned in the text.
admin
asked
in
Operating System
Oct 25, 2019
by
admin
350
views
tanenbaum
operating-system
memory-management
descriptive
0
votes
0
answers
182
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 27 (Page No. 83)
Modern operating systems decouple a process address space from the machine’s physical memory. List two advantages of this design.
admin
asked
in
Operating System
Oct 23, 2019
by
admin
525
views
tanenbaum
operating-system
memory-management
descriptive
1
vote
3
answers
183
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
Hirak
asked
in
Operating System
Jun 13, 2019
by
Hirak
1.7k
views
memory-management
paging
operating-system
multilevel-paging
self-doubt
1
vote
2
answers
184
Mode of OS during page table access
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?
!KARAN
asked
in
Operating System
May 18, 2019
by
!KARAN
589
views
memory-management
paging
operating-system
0
votes
2
answers
185
#arrays
i write this program, during initialization of array i given the size as 11 means the number of elements stored in an array is 11. as we know array is not assigned a value of index 12 and above. but in in the program array a is initialized of index from 0 to 19,my question is how the array is ... i=0;i<20;i++) { a[i]=i+1; } for(i=0;i<20;i++) { printf("%d\n",a[i]); } }
shiva0
asked
in
Programming in C
Apr 7, 2019
by
shiva0
677
views
programming-in-c
programming
array
memory-management
0
votes
1
answer
186
#Dynamic memory allocation malloc
how to know how much size is allocated while dynamically allocating memory to the pointer variable with malloc. i just write the below code to know the size of ptr2 after dynamically allocating memory. i want the output is 10 but it is displaying as 2 as ... allocation failed"); else{ printf("size of *ptr2 is == %d\n",(sizeof(ptr2)/sizeof(int))); } }
shiva0
asked
in
Programming in C
Apr 6, 2019
by
shiva0
667
views
programming-in-c
memory-management
1
vote
0
answers
187
Galvin Edition 9 Exercise 9 Question 38 (Page No. 456)
Consider a system that allocates pages of different sizes to its processes. What are the advantages of such a paging scheme ? What modifications to the virtual memory system provide this functionality ?
akash.dinkar12
asked
in
Operating System
Mar 22, 2019
by
akash.dinkar12
714
views
galvin
operating-system
memory-management
paging
0
votes
0
answers
188
Galvin Edition 9 Exercise 8 Question 32 (Page No. 393-394)
Consider the Intel address-translation scheme shown in Figure 8.22. a. Describe all the steps taken by the Intel Pentium in translating a logical address into a physical address. b. What are the advantages to the operating system of ... -translation system? If so, what are they? If not, why is this scheme not used by every manufacturer ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
699
views
galvin
operating-system
memory-management
1
vote
1
answer
189
Galvin Edition 9 Exercise 8 Question 31 (Page No. 393)
Compare the segmented paging scheme with the hashed page table scheme for handling large address spaces. Under what circumstances is one scheme preferable to the other ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
2.1k
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
190
Galvin Edition 9 Exercise 8 Question 30 (Page No. 393)
Consider the hierarchical paging scheme used by the $VAX$ architecture. How many memory operations are performed when a user program executes a memory-load operation ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
239
views
galvin
operating-system
memory-management
0
votes
1
answer
191
Galvin Edition 9 Exercise 8 Question 29 (Page No. 393)
What is the purpose of paging the page tables ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
356
views
galvin
operating-system
memory-management
0
votes
1
answer
192
Galvin Edition 9 Exercise 8 Question 28 (Page No. 393)
Consider the following segment table: $Segment$ $Base$ $Length$ $0$ $219$ $600$ $1$ $2300$ $14$ $2$ $90$ $100$ $3$ $1327$ $580$ $4$ $1952$ $96$ What are the physical addresses for the following logical addresses ? $a. 0,430$ $b. 1,10$ $c. 2,500$ $d. 3,400$ $e. 4,112$
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
8.8k
views
galvin
operating-system
memory-management
1
vote
1
answer
193
Galvin Edition 9 Exercise 8 Question 27 (Page No. 393)
Explain why sharing a reentrant module is easier when segmentation is used than when pure paging is used.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
798
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
194
Galvin Edition 9 Exercise 8 Question 26 (Page No. 393)
Why are segmentation and paging sometimes combined into one scheme ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
273
views
galvin
operating-system
memory-management
descriptive
1
vote
1
answer
195
Galvin Edition 9 Exercise 8 Question 25 (Page No. 393)
Consider a paging system with the page table stored in memory. a. If a memory reference takes 50 nanoseconds, how long does a paged memory reference take ? b. If we add $TLBs$, and 75 percent of all page-table references are found ... time ? (Assume that finding a page-table entry in the $TLBs$ takes 2 nanoseconds, if the entry is present.)
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
657
views
galvin
operating-system
memory-management
1
vote
1
answer
196
Galvin Edition 9 Exercise 8 Question 23 (Page No. 392)
Consider a logical address space of $256$ pages with a $4-KB$ page size, mapped onto a physical memory of $64$ frames. $a$. How many bits are required in the logical address ? $b$. How many bits are required in the physical address ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
496
views
galvin
operating-system
memory-management
0
votes
0
answers
197
Galvin Edition 9 Exercise 8 Question 22 (Page No. 392)
What is the maximum amount of physical memory ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
279
views
galvin
operating-system
memory-management
1
vote
1
answer
198
Galvin Edition 9 Exercise 8 Question 21 (Page No. 392)
The BTV operating system has a $21-bit$ virtual address, yet on certain embedded devices, it has only a $16-bit$ physical address. It also has a $2-KB$ page size. How many entries are there in each of the following ? $a$. A conventional, single-level page table $b$. An inverted page table
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
2.2k
views
galvin
operating-system
memory-management
0
votes
1
answer
199
Galvin Edition 9 Exercise 8 Question 20 (Page No. 392)
Assuming a $1$ $KB$ page size, what are the page numbers and offsets for the following address references (provided as decimal numbers): $a. 3085$ $b. 42095$ $c. 215201$ $d. 650000$ $e. 2000001$
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
1.7k
views
galvin
operating-system
memory-management
0
votes
0
answers
200
Galvin Edition 9 Exercise 8 Question 19 (Page No. 392)
Program binaries in many systems are typically structured as follows. Code is stored starting with a small, fixed virtual address, such as $0$. The code segment is followed by the data segment that is used for storing the program ... structure for the following schemes ? $a$. Contiguous memory allocation $b$. Pure segmentation $c$. Pure paging
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
357
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
201
Galvin Edition 9 Exercise 8 Question 18 (Page No. 392)
Explain why address space identifiers ($ASIDs$) are used.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
246
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
202
Galvin Edition 9 Exercise 8 Question 17 (Page No. 392)
Compare paging with segmentation with respect to how much memory the address translation structures require to convert virtual addresses to physical addresses.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
226
views
galvin
operating-system
memory-management
descriptive
1
vote
0
answers
203
Galvin Edition 9 Exercise 8 Question 16 (Page No. 392)
Although Android does not support swapping on its boot disk, it is possible to set up a swap space using a separate SD nonvolatile memory card. Why would Android disallow swapping on its boot disk yet allow it on a secondary disk ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
529
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
204
Galvin Edition 9 Exercise 8 Question 15 (Page No. 392)
Explain why mobile operating systems such as iOS and Android do not support swapping ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
216
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
205
Galvin Edition 9 Exercise 8 Question 14 (Page No. 391)
On a system with paging, a process cannot access memory that it does not own. Why ? How could the operating system allow access to other memory ? Why should it or should it not ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
291
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
206
Galvin Edition 9 Exercise 8 Question 13 (Page No. 391)
Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues: $a$. External fragmentation $b$. Internal fragmentation $c$. Ability to share code across processes
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
546
views
galvin
operating-system
memory-management
1
vote
2
answers
207
Galvin Edition 9 Exercise 8 Question 12 (Page No. 391)
Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is an example of such allocated memory. What is required to support dynamic memory allocation in the following schemes ? $a$. Contiguous memory allocation $b$. Pure segmentation $c$. Pure paging
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
3.0k
views
galvin
operating-system
memory-management
2
votes
1
answer
208
Galvin Edition 9 Exercise 8 Question 11 (Page No. 391)
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) ? Rank the algorithms in terms of how efficiently they use memory.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
353
views
galvin
operating-system
memory-management
0
votes
0
answers
209
Galvin Edition 9 Exercise 8 Question 10 (Page No. 391)
Consider the following process for generating binaries. A compiler is used to generate the object code for individual modules, and a linkage editor is used to combine multiple object modules into a single program binary. How does ... passed from the compiler to the linkage editor to facilitate the memory-binding tasks of the linkage editor ?
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
860
views
galvin
operating-system
memory-management
descriptive
0
votes
0
answers
210
Galvin Edition 9 Exercise 8 Question 9 (Page No. 391)
Explain the difference between internal and external fragmentation.
akash.dinkar12
asked
in
Operating System
Mar 21, 2019
by
akash.dinkar12
151
views
galvin
operating-system
memory-management
descriptive
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
16
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged memory-management
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...