GATE CSE 1991 | Memory Management Question 91 | Operating Systems

PREVIOUS NEXT

GATE CSE 1991

True or False

-0

State whether the following statement TRUE or FALSE.

The use of monitors ensures that no dead -locks will be caused.

TRUE

FALSE

GATE CSE 1991

True or False

-0

State whether the following statement TRUE or FALSE.

The best-fit techniques for memory allocation ensures the memory will never be fragmented.

TRUE

FALSE

GATE CSE 1991

True or False

-0

State whether the following statement TRUE or FALSE.

Any implementation of a critical section requires the use of an indivisible machine instruction such as test-and-set.

TRUE

FALSE

GATE CSE 1991

True or False

-0

State whether the following statement TRUE or FALSE.

The $$LRU$$ page-replacement policy may cause thrashing for some type of programs.

TRUE

FALSE

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

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

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

Digital Logic

Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems

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 Pointer and Structure in C Function and Recursion

Computer Organization

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