Absolute Addressing Mode

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/digital-computer-organization-and-architecture/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. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. 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
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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
  13. Paper 2 | Compiler Design: 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…