GATE CSE 2003 | Memory Management Question 37 | Operating Systems

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

In a system with $$32$$ bit virtual addresses and $$1$$ $$KB$$ page size, use of one-level page tables for virtual to physical address translation is not practical because of

The large amount of internal fragmentation

The large amount of external fragmentation

The large memory overhead in maintaining page tables.

The large computation overhead in the translation process

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

Which of the following is not a form of memory?

Instruction cache

Instruction register

Instruction opcode

Translation look a side buffer

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

The optimal page replacement algorithm will select the page that.

Has not been used for the longest time in the past.

Will not be used for the longest time in the future.

Has been used least number of times.

Has been used most number of times.

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Which of the following statements is false?

Virtual memory implements the translation of a program’s address space into physical memory address space

Virtual memory allows each program to exceed the size of the primary memory

Virtual memory increases the degree of multiprogramming.

Virtual memory reduces the context switching overhead.

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Verbal Ability Numerical Ability