3 Address

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-organization-architecture/instr-formats-modes/instruction-structure/asset-3-address after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on 3-address instructions within computer architecture. The instructor defines the instruction format, consisting of an Opcode, two operands (Oprend1, Oprend2), and a Destination field. He explains that the Program Counter handles sequencing, removing the need for an address field in the instruction itself. The lecture uses the expression X = (A + B) * (C + D) to demonstrate translation into assembly language. Finally, he evaluates pros and cons, noting popularity due to binary nature but highlighting increased instruction length and space consumption compared to fewer-address formats.

Chapters

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

    The video opens with a slide titled '3 Address Instruction' showing a table with headers: Opcode, Oprend1, Oprend2, and Destination. The instructor explains that the Program Counter manages sequencing, so the instruction doesn't need an address field. He notes that while programs are short in size, bits per instruction increase. He focuses on the example: 'in assembly language that evaluates X = (A + B) * (C + D)'. He breaks down the code: ADD R1, A, B for R1 <- M[A] + M[B], ADD R2, C, D for R2 <- M[C] + M[D], and MUL X, R1, R2 for M[X] <- R1 * R2. He underlines the equation and assembly lines to map them to the 3-address structure, specifically highlighting the Destination column for the final result.

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

    The slide updates to show bullet points discussing advantages and disadvantages. The text states, 'It is relatively better than 4 address instruction.' The instructor elaborates that because most operations are binary, this format is 'very convenient with human understanding and that is why very popular.' He points to the disadvantage: 'Disadvantage is still it is very much lengthy, which uses a lot of space.' He gestures towards the assembly code example to illustrate the length, showing how a single mathematical expression requires multiple lines of code, each taking up space in memory, which is a trade-off for the ease of programming.

The lecture systematically builds understanding by first defining the technical structure of 3-address instructions and explaining the role of the Program Counter. It then grounds this theory with a concrete example of evaluating a mathematical expression, mapping each step to the instruction format. The lesson concludes with a critical evaluation, weighing the benefits of human readability and binary operation convenience against the drawback of increased memory usage due to longer instruction lengths, providing a comprehensive view of this architectural choice.

Loading lesson…