GATE CSE 2004 | Machine Instructions and Addressing Modes Question 25 | Computer Organization

GATE CSE 2004

MCQ (Single Correct Answer)

-0.3

Which of the following addressing modes are suitable for program relocation at run time?
$$1.$$ Absolute addressing
$$2.$$ Based addressing
$$3.$$ Relative addressing
$$4.$$ Indirect addressing

$$1$$ and $$4$$

$$1$$ and $$2$$

$$2$$ and $$3$$

$$1, 2$$ and $$4$$

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 aside buffer

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

In absolute addressing mode

the operand is inside the instruction

the address of the operand is inside the instruction

the register containing the address of the operand is specified inside the instruction

the location of the operand is implicit

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

The most appropriate matching for the following pairs
$$X:$$ Indirect addressing
$$Y:$$ Immediate addressing
$$Z:$$ Auto decrement addressing is

$$1:$$ Loops
$$2:$$ Pointers
$$3.$$ Constants

$$X - 3,\,Y - 2,\,Z - 1$$

$$X - 1,\,Y - 3,\,Z - 2$$

$$X - 2,\,Y - 3,\,Z - 1$$

$$X - 3,\,Y - 1,\,Z - 2$$

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

Algorithms

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

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

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

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 Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory