3 Address

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/compiler-design-it-specialist/instr-formats-modes/instruction-structure/asset-3-address after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): 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
  17. Descriptive Test (Main Exam): English Writing Ability
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…