GATE CSE 2003 | Memory Management Question 44 | 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

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 File System IO and Protection Deadlocks Memory Management

Algorithms

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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