Recent questions tagged memory-management / GATE Overflow for GATE CSE

1 votes

1 answer

391

Memory
This is physically addressed so We have to search in TLB first but my question is if it is a HIT in TLB why do we need to search in Cache It should be only TLB(hit)*{Tlb access time + memory access time} and if there is miss in TLB then we look in the cache and Secondary meory Am I correct or Something is missing???

This is physically addressed so We have to search in TLB first but my question is if it is a HIT in TLB why do we need to search in Cache It should be only TLB(hit)...

bad_engineer

535 views

bad_engineer asked Oct 19, 2016

1 votes

2 answers

392

homework nyu
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit are for the first level and so on. What is the size of a page table for a process that has 256K of memory starting at address 0? (assume 2Byte per entry for all the levels)

In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit8-bit6-bit8 bitWe use a 3-level page table, such that the first 10-bit are for the...

Nishant Arora

5.7k views

Nishant Arora asked Oct 18, 2016

0 votes

0 answers

393

memory management
A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry.What is the maximum size of addressable physical memory in this system?

A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry.What is the maximum size of addressable physical memory in t...

Nishant Arora

685 views

Nishant Arora asked Oct 18, 2016

0 votes

1 answer

394

Operating system
Consider a system using 2 level paging applicable. the full page is divided into 2K pages. Each page is having 4K entries. PAS is 64MW whish is divided into 16K frames. the main m/m is word addressable. Page table entry size in both level is 2 words. calculate (a) LA (b) PA (c) first level paging Table size. (d) second level paging table size

Consider a system using 2 level paging applicable. the full page is divided into 2K pages. Each page is having 4K entries. PAS is 64MW whish is divided into 16K frames. t...

cse7

691 views

cse7 asked Oct 17, 2016

0 votes

1 answer

395

Internal fragmentation

vaishali jhalani

2.1k views

vaishali jhalani asked Oct 10, 2016

2 votes

2 answers

396

ACE test series(OS):
Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16$bits. What is the size of outer page table size ? a). $4GB$ b). $8GB$ c). $32MB$ d). $32GB$

Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16...

mcjoshi

2.5k views

mcjoshi asked Oct 9, 2016

3 votes

1 answer

397

memory management

vaishali jhalani

1.1k views

vaishali jhalani asked Oct 7, 2016

2 votes

1 answer

398

memory management

vaishali jhalani

684 views

vaishali jhalani asked Oct 7, 2016

9 votes

4 answers

399

paging
Q. Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page table at diff level fits in a single page.How much memory is used by program, including its page tables?

Q.Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire pro...

Akriti sood

7.0k views

Akriti sood asked Oct 3, 2016

3 votes

3 answers

400

OS : page table
Account for the validity and justification about the correctness of this statement " Whatever level page table is always the nuber of bits which are going to refer a frame number will always going to be same "

Account for the validity and justification about the correctness of this statement" Whatever level page table is always the nuber of bits which are going to refer a frame...

pC

558 views

pC asked Oct 3, 2016

3 votes

0 answers

401

paging
Suppose you have a computer system with a 48-bit logical address, page size of 16K and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. How much memory is used by program, including its page tables? 216(3111) 216(3121) 28(3121) 210(3121)

Suppose you have a computer system with a 48-bit logical address, page size of 16K and 4 bytes per page table entry. If we have a 48MB program such that the entire progra...

Shashank Chandekar

1.2k views

Shashank Chandekar asked Oct 2, 2016

6 votes

1 answer

402

paging
Consider a system using multi level paging environment. Address bits are segregated as follows: Here first 8 bits represent the required bits for first level, next 8 bits represent the required bits for second level, next 6 bits represent the required bits for third level ... process that has 512 K of memory starting at address 0? Assume each page table entry is 4 bytes. 2048 3192 1024 4096

Consider a system using multi level paging environment. Address bits are segregated as follows: Here first 8 bits represent the required bits for first level, next 8 bits...

Shashank Chandekar

1.4k views

Shashank Chandekar asked Oct 1, 2016

2 votes

1 answer

403

paging
Consider a processor has virtual address 52 bits, the physical address is 32 bits and the page size is 16KB. Each individual table at any level of the page table occupies a single page of physical memory. Using multi level paging, how many entries are there in each individual page table page ... purpose? < 2, 12, 12, 12 > <10,14,14,14> <4,14,14,14> <10,12,14,14>

Consider a processor has virtual address 52 bits, the physical address is 32 bits and the page size is 16KB. Each individual table at any level of the page table occupies...

Shashank Chandekar

1.4k views

Shashank Chandekar asked Oct 1, 2016

4 votes

5 answers

404

OS Memory Management
Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes. a - 4 b- 5 c -6 d -7 Internal fragmentation is always half the page size I guess So the answer should be 4 KB but it is 6 KB How????

Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes.a - 4b- 5c -6d -7 Inter...

bad_engineer

7.6k views

bad_engineer asked Sep 23, 2016

4 votes

1 answer

405

GATE Overflow | Operating Systems | Test 1 | Question: 1
Overlay is a part of an operating system a specific memory location a single contiguous memory that was used in the olden days for running large programs by swapping overloading the system with many user files

Overlay is a part of an operating system a specific memory location a single contiguous memory that was used in the olden days for running large programs by swappingove...

Bikram

678 views

Bikram asked Sep 3, 2016

8 votes

5 answers

406

Size of Virtual Memory - MCQs in CS - Williams
The size of virtual memory is limited by data bus main memory address bus none of the above

The size of virtual memory is limited bydata busmain memoryaddress busnone of the above

Sankaranarayanan P.N

8.5k views

Sankaranarayanan P.N asked Aug 23, 2016

4 votes

1 answer

407

MCQs in Computer Science - Timothy Williams
Memory Protection is of no use in a) single user systems b) non multiprogrammed systems c) non multitasking systems d) none of the above

Memory Protection is of no use in a) single user systemsb) non multiprogrammed systemsc) non multitasking systemsd) none of the above

Sankaranarayanan P.N

3.7k views

Sankaranarayanan P.N asked Aug 23, 2016

2 votes

2 answers

408

UGC NET CSE | December 2011 | Part 2 | Question: 30
Consider a logical address space of $8$ pages of $1024$ words mapped with memory of $32$ frames. How many bits are there in the physical address ? $9$ bits $11$ bits $13$ bits $15$ bits

Consider a logical address space of $8$ pages of $1024$ words mapped with memory of $32$ frames. How many bits are there in the physical address ?$9$ bits$11$ bits$13$ bi...

makhdoom ghaya

1.5k views

makhdoom ghaya asked Aug 19, 2016

4 votes

1 answer

409

UGC NET CSE | Junet 2015 | Part 3 | Question: 51
What is the most appropriate function of Memory Management Unit (MMU)? It is an associative memory to store TLB It is a technique of supporting multiprogramming by creating dynamic partitions It is a chip to map virtual address to physical address It is an algorithm to allocate and deallocate main memory to a process

What is the most appropriate function of Memory Management Unit (MMU)?It is an associative memory to store TLBIt is a technique of supporting multiprogramming by creating...

go_editor

2.0k views

go_editor asked Aug 1, 2016

4 votes

2 answers

410

overhead of maintaining page-table
consider a system using 3-level page-table where it uses first 2 bit to index into first level page-table, 9 bit to index into second level page table , 9 bit to index into third level page-table. processor uses 36 bit physical address and 32 bit virtual address . each page-table entry is of size 4 bytes. calculate total overhead for the page-table ?

consider a system using 3-level page-table where it uses first 2 bit to index into first level page-table, 9 bit to index into second level page table , 9 bit to index in...

koushik.sinha

2.6k views

koushik.sinha asked Jul 28, 2016

0 votes

1 answer

411

UGC NET CSE | December 2012 | Part 2 | Question: 30
Which of the following memory allocation scheme suffers from external fragmentation? Segmentation Pure demand paging Swapping Paging

Which of the following memory allocation scheme suffers from external fragmentation?SegmentationPure demand pagingSwappingPaging

go_editor

4.7k views

go_editor asked Jul 11, 2016

1 votes

2 answers

412

UGC NET CSE | December 2012 | Part 2 | Question: 14
Given a memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K and 426 K (in order), using the first fit algorithm, in which partition would the process requiring 426 K be placed? 500 K 200 K 300 K 600 K

Given a memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K and 426 K (in order), using the first fit algorithm, in ...

go_editor

7.0k views

go_editor asked Jul 8, 2016

0 votes

0 answers

413

page size vs frame size
What is the page size taken if page size is less than frame size? Take an example page size =4kb and frame size = 8kb , Then for calculating virtual address space , which page size value do we take?

What is the page size taken if page size is less than frame size?Take an example page size =4kb and frame size = 8kb ,Then for calculating virtual address space , which p...

Kapil

2.7k views

Kapil asked Jun 26, 2016

1 votes

1 answer

414

Operating System
Can Someone explain these terms in little bit details .And where do we use them..I don't want anybody to give any reference link on then .Just explain them in an informal way if you can do So. Linker address origin load address origin Phase library absolute library

Can Someone explain these terms in little bit details .And where do we use them..I don't want anybody to give any reference link on then .Just explain them in an informa...

shekhar chauhan

553 views

shekhar chauhan asked Jun 19, 2016

2 votes

0 answers

415

Demand Paging
A demand paging system take 100 time unit to service a page fault and 300 time units to replace a dirty page.Memory access time is 1 time unit .The probability of a page fault is p . In case of page fault ,the probability of page being dirty also p.It is observed that average access time is 3 times units.Then the value of p is (a)0.194 (b)0.233 (c)0.514 (d)0.981

A demand paging system take 100 time unit to service a page fault and 300 time units to replace a dirty page.Memory access time is 1 time unit .The probability of a page...

ManojK

1.9k views

ManojK asked Jun 13, 2016

2 votes

0 answers

416

Can a page fault be generated due to the absence of the page of inner page table , table for multi level paging ?

Consider, 2 level paging , with Process P, Inner page table PTi, and outer page table PTo.Now we know that P and PTi are divided in various pages but PTo is in 1 page on...

gatejr

774 views

gatejr asked Jun 10, 2016

6 votes

3 answers

417

ISRO2007-10
The term ‘aging’ refers to booting up the priority of the process in multi-level of queue without feedback. gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking keeping track of the ... letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.

The term ‘aging’ refers tobooting up the priority of the process in multi-level of queue without feedback.gradually increasing the priority of jobs that wait ...

go_editor

5.6k views

go_editor asked Jun 10, 2016

1 votes

2 answers

418

UGC NET CSE | December 2015 | Part 3 | Question: 37
Match the following with respect to various memory management algorithms : ... $\text{(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)}$

Match the following with respect to various memory management algorithms :$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & \text{Demand pagin...

shekhar chauhan

2.8k views

shekhar chauhan asked Jun 5, 2016

1 votes

0 answers

419

ISI2012-PCB-CS-1a
In a Buddy memory allocation system, a process is allocated an amount of memory whose size is the smallest power of $2$ that is greater than or equal to the amount requested by the process. A system using buddy memory allocation has $1MB$ ... entire span of the above sequence. Calculate the total memory wasted due to fragmentation in your memory allocation by the above scheme.

In a Buddy memory allocation system, a process is allocated an amount of memory whose size is the smallest power of $2$ that is greater than or equal to the amount reques...

go_editor

656 views

go_editor asked Jun 2, 2016

8 votes

9 answers

420

ISRO-2013-65
Consider the list of page references in the time line as below: 9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7 What is the working set at the penultimate page reference if ∆ is 5? {8, 5, 3, 2, 9, 6} {4, 3, 6, 2, 5} {3, 9, 6, 2, 7} {3, 9, 6, 2}

Consider the list of page references in the time line as below:9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7What is the working set at the ...

makhdoom ghaya

9.5k views

makhdoom ghaya asked May 12, 2016

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