2 Address
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/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
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture explains the 2 Address Instruction format in computer architecture. The instructor displays a slide titled "2 Address Instruction" outlining the structure: Opcode, Op1, and Op2. He emphasizes that the result is stored directly into the first operand (Op1), removing the need for a separate result address. This leads to shorter instruction lengths compared to 3-address instructions, making the system more efficient with fewer registers required. However, he notes a drawback: code optimization is relatively difficult. The lecture concludes with a practical application, demonstrating how to evaluate a mathematical expression using this instruction set.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the "2 Address Instruction" format, displaying a table with columns for Opcode, Op1, and Op2. He underlines the text stating that the reference for the result is removed because the opcode1 is used for storing the result. He explains that this format has less length compared to 3-address instructions, making it more efficient with fewer registers required. He also points out that code optimization is relatively difficult in this architecture. He underlines specific phrases like "remove the reference for result" and "opcode1 is used for storing the result" to emphasize the mechanism.
2:00 – 3:28 02:00-03:28
The instructor presents a program to evaluate the expression X = (A + B) * (C + D). He analyzes the assembly code line by line, starting with `MOV R1, A` which loads memory A into register R1. He explains `ADD R1, B` adds memory B to R1, storing the sum back in R1. He continues with `MOV R2, C` and `ADD R2, D` to compute the second part of the expression. Finally, `MUL R1, R2` multiplies the contents of R1 and R2, storing the result in R1, and `MOV X, R1` stores the final result in memory location X. He draws brackets to visualize the operation flow, connecting the assembly instructions to their corresponding mathematical operations on the right side of the slide.
The lecture effectively bridges theoretical instruction formats with practical assembly coding. By first defining the 2-address structure and its trade-offs (efficiency vs. optimization difficulty), the instructor sets the stage for understanding how complex expressions are broken down into simple machine operations. The step-by-step walkthrough of the example X = (A + B) * (C + D) solidifies the concept that the first operand acts as both a source and a destination, a crucial distinction for students learning about instruction set architectures. The visual aids, including underlining and bracketing, help clarify the data flow and the specific role of registers R1 and R2 in the computation process.

