GATE CSE 1994 | Memory Management Question 79 | Operating Systems

PREVIOUS NEXT

GATE CSE 1994

MCQ (Single Correct Answer)

-0.6

Consider the following heap (Figure) in which blank regions are not in use and hatched region are in use.

The sequence of requests for blocks of size $$300, 25, 125, 50$$ can be satisfied if we use.

GATE CSE 1994 Operating Systems - Memory Management Question 27 English

Either first fit or best fit policy (any one)

First fit but not best fit policy

Best fit but first fit policy

None of the above

GATE CSE 1994

MCQ (Single Correct Answer)

-0.6

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when

LRU page replacement algorithm is used

FIFO page replacement algorithm is used

LFU page replacement algorithm is used

None of the above

GATE CSE 1993

MCQ (Single Correct Answer)

-0.6

A part of the system software, which under all circumstances must reside in the main memory is:

text editor

assembler

linker

loader

GATE CSE 1993

MCQ (Single Correct Answer)

-0.6

A simple two-pass assembler does the following in the first pass:

It allocates space for the literals.

It computes the total length of the program

It builds the symbol table for the symbols and their values.

It generates code for all the load and store register instructions.

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

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

Operating Systems

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

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 Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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