8085 ISA & AM

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-organization-architecture/programming-the-basic-computer/8085-8086-basics/asset-8085-isa-am 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.

The video provides a comprehensive overview of the 8085 microprocessor's architecture, focusing on its instruction set, interrupt handling, and addressing modes. The instructor breaks down the five instruction categories, detailing examples like MOV and ADD. He explains the interrupt hierarchy, distinguishing between maskable and non-maskable types. Finally, he delves into addressing modes, using diagrams to clarify data location. This structured approach helps students understand fundamental 8085 operations and prepares them for programming tasks. The lecture is visually supported by a slide listing all key concepts, ensuring clarity.

Chapters

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

    The instructor introduces the "Instruction Set of 8085" on the slide. He lists five categories: Data Transfer, Arithmetic, Logical, Branching, and Machine Control Instructions. He underlines each category. For Data Transfer, he writes "Rg" (Register) and "Mem" (Memory) to illustrate movement. He mentions opcodes like MOV, MVI, LXI for transfer, and ADD, SUB, INR, DCR for arithmetic. He underlines Logical Instructions like ANA, ORA, CMA and Branching Instructions like JMP, CALL, RET. He concludes with Machine Control Instructions such as HLT and NOP. This section provides a high-level taxonomy of 8085 operations.

  2. 2:00 – 5:00 02:00-05:00

    The lecture transitions to "Interrupts in 8085". The instructor explains interrupts allow the CPU to respond to external events. He lists TRAP as the highest priority, non-maskable interrupt. He discusses RST 7.5, 6.5, and 5.5 as maskable interrupts and INTR as a general request. He begins the "Addressing Modes" section. He defines Immediate Addressing where data is given directly in the instruction and Register Addressing where data is in a register. He underlines "Data is given directly in instruction" and "Data is in register" to emphasize the distinction. This section sets the stage for understanding how instructions interact with memory.

  3. 5:00 – 5:55 05:00-05:55

    The instructor continues with Addressing Modes: Direct, Indirect, and Implied. For Direct Addressing, the address is specified in the instruction. For Indirect Addressing, he draws a diagram showing a register pair holding an address pointing to data in memory. He labels this "pointer" and writes "1000" in a box. He explains that the register pair acts as a pointer to the actual data location. Finally, he explains Implied Addressing where the operand is implied by the instruction, such as CMA. He underlines "Address stored in register pair" and "Operand is implied". This section clarifies how the CPU fetches operands from different sources.

The video structures 8085 concepts from instruction categories to data access methods. By categorizing instructions into groups like arithmetic and branching, the instructor establishes CPU capabilities. The interrupt discussion highlights handling asynchronous events. The addressing modes section bridges abstract instructions and physical memory, using visual aids to distinguish direct access from indirect pointer-based access. This progression from instruction types to execution control to data location provides a complete foundational understanding. The instructor's use of underlining and handwritten notes reinforces key terms like "non-maskable" and "pointer". The visual diagrams for indirect addressing are particularly helpful for understanding how memory pointers work in assembly language programming.

Loading lesson…