GATE CSE 1996 | Memory Management Question 59 | Operating Systems

PREVIOUS NEXT

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

A ROM is sued to store the table for multiplication of two $$8$$-bit unsigned integers. The size of ROM required is

$$256 \times 16$$

$$64\,K \times 8$$

$$4\,K \times 16$$

$$64\,K \times 16$$

GATE CSE 1995

MCQ (Single Correct Answer)

-0.3

In a paged segmented scheme of memory management, the segment table itself must have a page table because:

The segment table is often too large to fit in one page.

Each segment is spread over a number of pages

Segment tables point to page table and not to the physical locations of the segment.

The processor’s description base register points to a page table.

GATE CSE 1995

MCQ (Single Correct Answer)

-0.3

The principle of locality justifies the use of

Interrupts

DMA

Polling

Cache Memory

GATE CSE 1995

MCQ (Single Correct Answer)

-0.3

A linker is given object modules for a set of programs that were compiled separately. What information need to be included in an object module?

Object code

Relocation bits

Names and locations of all external symbols defined in the object module

Absolute addresses of internal symbols

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

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

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

K Maps Boolean Algebra Combinational Circuits Number Systems 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

Verbal Ability Numerical Ability

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

Computer Organization

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