Absolute Addressing Mode

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/digital-electronics/instr-formats-modes/basic-addressing-modes/asset-absolute-addressing-mode after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a comprehensive overview of Direct Mode Addressing, also referred to as Absolute Address Mode. The instructor defines this addressing scheme as a technique where the instruction itself contains the specific memory address where the variable or data is located, known as the effective address. A key characteristic highlighted is that this mode requires only a single memory reference operation to access the data. The session details the advantages, such as being the simplest method for variables with unknown values, having no restriction on the range of data values the system can hold, and the ability to access global variables whose addresses are known at compile time. Conversely, disadvantages include being relatively slow compared to immediate mode, having a limited number of variables that can be used, and potential failure in large calculations. Visual aids include a diagram showing the flow from an instruction's effective address to the data in memory, and a hand-drawn memory stack illustrating address storage.

Chapters

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

    The instructor introduces Direct mode addressing (absolute address mode) via the slide title. He defines the concept: instruction contain address of the memory where variable or data is present (effective address). He notes that only one memory reference operation is required to access the data. He begins listing advantages, stating it is the simplest one for variables with unknown values and has no restriction on the range of data values. He draws a memory structure on the right side of the screen to visualize the concept, sketching a stack-like diagram to represent memory locations.

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

    The instructor continues discussing advantages, specifically mentioning it can be used to access global variables whose address is known at compile time. He then transitions to disadvantages, underlining points like Relatively slow compare to immediate mode and No of variable used are limited. He writes 2^10 = 1024 on the slide, likely explaining address space constraints or bit limitations. He explains the diagram at the bottom: an Instruction box containing an Effective address points to a Memory box containing Data, illustrating the direct access mechanism where the address in the instruction directly points to the data location.

The lesson progresses from defining direct addressing to analyzing its pros and cons. The instructor uses a slide with bullet points and a diagram to explain that the instruction holds the memory address directly. He contrasts this with other modes by noting its speed limitations compared to immediate mode. The visual progression moves from text definitions to a hand-drawn memory model, reinforcing the concept of accessing data via a specific address stored in the instruction. The instructor emphasizes the trade-off between simplicity and limitations.

Loading lesson…