Indirect Mode Addressing

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/computer-architecture/instr-formats-modes/basic-addressing-modes/asset-indirect-mode-addressing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
  2. Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
  3. English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  5. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  6. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  7. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
  8. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  9. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed explanation of Indirect Mode Addressing within computer architecture. The instructor begins by defining the mode, where an instruction contains the address of a memory location that holds the effective address of the actual data. The lecture emphasizes that this process necessitates two distinct memory references: one to retrieve the effective address and a second to access the operand. The session concludes by analyzing the pros and cons, specifically highlighting the flexibility in handling variables and pointers versus the performance cost of multiple memory accesses.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces Indirect Mode Addressing using a slide titled "Indirect mode addressing". The text explicitly states, "Here in the instruction we store the address where the (address of the variable) effective address is stored using which we can access the actual data." The instructor explains that "Here two references are required," detailing that the "1st reference to get effective address and 2nd reference to access the data." A diagram illustrates this flow: an instruction block containing "Opcode" and "A" points to a memory cell labeled "EA" (Effective Address). From "EA", an arrow points to another cell labeled "Operand". The instructor uses a red pen to draw arrows on the screen, tracing the path from the instruction to the EA and then to the Operand, visually reinforcing the concept of indirection.

  2. 2:00 – 3:45 02:00-03:45

    The slide transitions to list the "Advantage" and "Disadvantage" of this mode. Under "Advantage," the text reads: "No limitation on no of variable or size of variables" and "Implementation of pointer are feasible and relatively more secure." The instructor underlines these phrases to emphasize their importance. Under "Disadvantage," the text states: "Relatively slow as memory must be referred more than one time." The instructor explains that because the CPU must perform two memory accesses—one for the address and one for the data—this mode is slower than direct addressing. He connects this to programming concepts, noting that while it allows for dynamic variable management via pointers, it comes at the cost of execution speed due to the extra memory cycle.

The lecture systematically builds an understanding of Indirect Mode Addressing by first defining its operational mechanism and then evaluating its impact on system performance and flexibility. The initial focus on the "two references" required to fetch data establishes the technical basis for the later discussion on speed. By linking the "slow" disadvantage directly to the "two references" concept introduced earlier, the instructor clarifies the trade-off inherent in this addressing mode. The final synthesis highlights that while indirect addressing offers significant advantages in terms of variable management and pointer implementation, these benefits are balanced against the performance penalty of increased memory access time.

Loading lesson…