Addressing Modes

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-computer-organization-and-architecture/instr-formats-modes/basic-addressing-modes/asset-addressing-modes after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a foundational overview of Addressing Modes within computer architecture. The instructor starts by defining addressing mode as the mechanism that specifies the various possible ways a processor can reference an operand during instruction execution. A critical concept introduced is the "Effective address," defined as the final memory address where the operand is actually stored. The lecture further breaks down the calculation of this effective address into two distinct categories: non-computable addressing and computable addressing, which involves arithmetic operations. The second half of the lecture shifts focus to the design considerations, outlining specific criteria that different addressing modes must satisfy to be effective in a computing system.

Chapters

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

    The instructor begins the lesson by presenting the title "Addressing Mode" at the top of the slide. He reads and underlines the definition: "It specifies the different ways possible in which reference to the operand can be made." He then defines "Effective address" as the final address of the location where the operand is stored. To clarify this, he explains that the calculation of the effective address can be done in two ways: "Non-computable addressing" and "Computable addressing (which involve arithmetic's)." Visually, the instructor draws a simple diagram of a memory block containing an "operand" and writes "EA" with an arrow pointing to it, illustrating that the Effective Address points directly to the data. He underlines key phrases on the slide to emphasize the core definitions, specifically circling "Effective address" to draw attention to its importance in the calculation process.

  2. 2:00 – 4:52 02:00-04:52

    The lecture progresses to a new slide titled "Criteria for different addressing mode." The instructor lists five essential criteria that addressing modes should ideally meet. These include: "It should be fast," "The length of the instruction must be small," "They should support pointers," "They should support looping constructs, indexing of data structure," and "Program relocation." As he discusses each point, he places a red checkmark next to it on the slide. To illustrate the concept of instruction length, he draws a long rectangular box divided into sections, representing the structure of an instruction. He emphasizes that while supporting complex features like pointers and indexing is important, the instruction length must remain small to ensure efficiency and speed. He also underlines "Program relocation" to highlight its significance in memory management.

The video effectively bridges the gap between theoretical definitions and practical design constraints. It first establishes the fundamental mechanics of how operands are located in memory through the concept of Effective Address, distinguishing between simple and arithmetic-based calculations. It then contextualizes these mechanics by explaining the engineering trade-offs involved in selecting addressing modes. The criteria discussed—speed, instruction size, and support for high-level programming features like loops and pointers—highlight the balance between hardware complexity and software flexibility. This progression helps students understand not just *how* addressing works, but *why* certain modes are preferred in different architectural contexts. The instructor uses visual aids like diagrams and checkmarks to reinforce these abstract concepts, making the material more accessible for exam preparation. Understanding these criteria is crucial for optimizing code performance and memory usage in real-world applications.

Loading lesson…