Computer Instructions
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
- Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
- Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
- Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
- 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
- Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
- Database Management Systems: 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, ORDBMS, NoSQL
- Computer Networks: 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
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video provides a detailed explanation of a computer's instruction set architecture, focusing on three distinct 16-bit instruction formats. The first part of the lecture, shown in the initial frames, introduces the three formats: memory-reference, register-reference, and input/output. It explains that the 3-bit opcode at the beginning of the instruction determines the format. A memory-reference instruction uses 12 bits for an address and 1 bit for addressing mode (direct or indirect). A register-reference instruction, identified by opcode 111 with a 0 in bit 15, uses 12 bits to specify the operation on the AC register. An input/output instruction, identified by opcode 111 with a 1 in bit 15, uses 12 bits to specify the I/O operation type. The second part of the video transitions to a table that lists the specific instructions. This table, titled 'Hexadecimal code', provides the symbol, hexadecimal code, and description for each instruction. The table is organized by the value of the 'I' bit (0 or 1), which is used for indirect addressing. The instructor highlights several key instructions, such as AND, ADD, LDA, STA, BUN, BSA, and ISZ, explaining their functions like adding a memory word to the AC, loading a memory word, storing content, and branching. The video concludes by showing the complete instruction set, including I/O operations like INP, OUT, SKI, and HLT, which are used for input, output, and halting the computer.
Chapters
0:00 – 2:00 00:00-02:00
The video begins by introducing the three instruction code formats for a 16-bit computer, as shown in a diagram. The first format, (a) Memory-reference instruction, has a 3-bit opcode (000 through 110) followed by a 12-bit address and a 1-bit addressing mode (I=0 for direct, I=1 for indirect). The second format, (b) Register-reference instruction, is identified by an opcode of 111 with a 0 in bit 15, and uses 12 bits to specify the operation on the AC register. The third format, (c) Input/output instruction, is identified by an opcode of 111 with a 1 in bit 15, and uses 12 bits to specify the type of I/O operation. The on-screen text explicitly states that the remaining 12 bits are used to specify the operation or I/O type.
2:00 – 2:51 02:00-02:51
The video transitions to a table titled 'Hexadecimal code' which lists the computer's instructions. The table is organized into columns for Symbol, Hexadecimal code (with sub-columns for I=0 and I=1), and Description. The instructor uses a red pen to highlight and explain several instructions. For example, the AND instruction (0xxx) is described as 'AND memory word to AC'. The ADD instruction (8xxx) is 'Add memory word to AC'. The LDA instruction (2xxx) is 'Load memory word to AC'. The STA instruction (3xxx) is 'Store content of AC in memory'. The BUN instruction (4xxx) is 'Branch unconditionally'. The BSA instruction (5xxx) is 'Branch and save return address'. The ISZ instruction (6xxx) is 'Increment and skip if zero'. The table also includes I/O instructions like INP (F800), OUT (F200), SKI (F100), and HLT (F000).
The lecture systematically builds an understanding of the computer's instruction set. It first establishes the structural foundation by defining the three 16-bit instruction formats based on the opcode, explaining how the remaining bits are allocated for addressing and operation specification. This is followed by a practical application of this structure, where a comprehensive table of instructions is presented. The table provides the symbolic name, hexadecimal representation, and functional description for each instruction, allowing the viewer to see the complete set of operations the computer can perform, from basic arithmetic and data movement to branching and I/O. The progression from format to specific instructions provides a complete picture of the machine's programming interface.

