1 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-1-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 lecture introduces the architecture of 1-address instructions, a fundamental concept in computer organization. The instructor explains that these instructions rely on an implied accumulator (AC) register to perform data manipulation, meaning only one explicit address is needed in the instruction format. The example $X = (A + B) * (C + D)$ demonstrates decomposing expressions into machine operations. It highlights the role of the AC register in holding operands and results throughout the execution process. It covers the translation of high-level math to low-level code.

Chapters

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

    The session begins by defining the structure of a 1-address instruction, showing a table with "Opcode" and "Operand1". The model assumes the AC holds the result even for multiplication. The core example $X = (A + B) * (C + D)$ is introduced. The instructor breaks down the first phase: calculating $(A + B)$. This involves `LOAD A` to move memory content A into the AC (`AC <- M[A]`), followed by `ADD B` to add memory content B to the AC (`AC <- AC + M[B]`). Finally, `STORE T` saves this intermediate sum into a temporary memory location T (`M[T] <- AC`), preserving it for the next stage of calculation. The instructor emphasizes that the AC is the central register.

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

    The explanation continues with the second phase of the expression. The instructor shows `LOAD C` to load the next operand into the AC (`AC <- M[C]`), followed by `ADD D` to compute the sum `(C + D)` (`AC <- AC + M[D]`). The critical step `MUL T` is then executed, where the current AC value (C+D) is multiplied by the value stored in T (A+B), updating the AC (`AC <- AC * M[T]`). The final instruction `STORE X` moves the result from the AC to the memory location X (`M[X] <- AC`). The instructor underlines the correspondence between the equation terms and the assembly lines to reinforce the logic. This sequence effectively computes the product of two sums.

The video provides a clear, step-by-step translation of a mathematical expression into assembly code using a 1-address machine model. By breaking the expression into sub-expressions and utilizing a temporary variable 'T', the instructor demonstrates how the accumulator facilitates sequential processing. This approach simplifies the instruction set architecture but requires the programmer to manage the flow of data through the AC and memory carefully.

Loading lesson…