Basic Multiplexer
Example Of A Really Basic Multiplexer (Transmission Of 4 Bits Of Information Over A Long Distance
Flip Flop Sr And Sr Manipulation 001
Flip Flop Sr And Sr Manipulation 002
Flip Flop Sr And Sr Manipulation 003
Half And Full Adder Table(Without Circuits)
Huntington Postulate 1
Introduction Of And Gate Or Gate Not Gate Nand Gate
Introduction To Nor Gate Exor Gate Exnor Gate
Algorithms For 0 1 Matrix
Algorithms For Binary Search
Algorithms For Bubble Sort
Algorithms For Linear Search
Algorithms For Matrix Multiplication
Breadth First Search(Algorithm For Constructing A Spanning Tree)
Definition Of Rooted Tree
Depth First Search(Algorithm For Constructing A Spanning Tree)
Dijkistra Algorithm
Euler Formula For Planar Graph 2
Euler Formula For Planar Graph
Euler Path And Circuit
Greedy Algorithms
Hamilton Path And Circuit
How To Draw Hasse Diagram
How To Know If The Graph Is Planar Collollary 2
How To Know If The Graph Is Planar Collollary 3
How To Know If The Graph Is Planar
Ieee 754 Fp Standard
Introduction To Tree
Kruskal Algorithm
Logical Equivalent
Logical Equivalent2
Logical Equivalent3
Necessary Condition For Euler Circuit
Necessary Condition For Euler Path
Negating Quantifier Expression
Nested Quantifier Discrete Math
Precedence Of Logical Connectivity
Prim Algorithm
Properties Of Tree 2
Properties Of Tree 3
Properties Of Tree 4
Properties Of Tree 5
Properties Of Tree
Rule Of Inference For Quantified Statement
Rule Of Inference
Set Identity
System For Using 8Bits Exponent With Bias
The Hand Shaking Theorem
Useful Property
Useful Summation
8086 Addition Format
8086 Architecture
8086 Division Instruction Format
8086 Instruction Encoding Special Cases
8086 Instruction Encoding Tables
8086 Logical Instruction Application
8086 Logical Instruction Format
8086 Memory Map
8086 Multiplication Instruction Format
8086 Register
8086 Subtraction Instruction Format
Addressing Mode Immediate Operand
Based Addressing Mode Memory Operand Kind
Call Insruction
Classic Cpu Performance Equation
Compare Instruction Format
Conditional Jump Instructions Table
Cpu Execution Time
Definition Of Interupt Instruction
Effective Address Calculations
Enable Disable Interrupt
Example Of How To Write A Proper Subroutine
Example Of Multiplication Instruction
Example Unconditional Jump With Memory Pointer 16 Bits
Example Unconditional Jump With Memory Pointer 32 Bits
Example Unconditional Jump With Near Label
Example Unconditional Jump With Register Pointer 16 Bits
Example Unconditional Jump With Short Label
Executing Program
Explaination Ad0 Ad15 Data Bus
External Circuit For Interrupt Instructions
External Interrupt Minimum Mode Interrupt
External Interrupt
Flag Control Instruction
Hlt Wati Instructions
How Ip Cs Work In Subroutine
How Microprocessor Work
How The Datas Are Transfered
Indexed Addressing Mode (1 Kind Of Memory Operand)
Instruction Encoding Explaination
Instruction Per Performance
Instruction Pointer In Cpu (Main) Memory
Inta Interrupt
Interrupt Bus Status Code
Interrupt Instructions
Interrupt Priority
Interrupt Vector Table
Into Instructions
Lea Lds Les Instructions Format
Loop And Loop Handling Instructions
Memory Operand Addressing Mode
Memory Operand Direct Addressing Mode
Micro Processor Base System
Phase Of Interrupt Acknowledgment
Pointer And Index Register
Processor Data Path Cont
Processor Data Path Cont2
Processor Data Path
Push Pop Instructions Format
Register Addressing Mode
Register Indirect Addressing (1 Kind Of Memory Operand)
Register Reg Table
Return Instruction
Stack Mechanism & Push Pop Instruction
Status Register Cont
Status Register
Summary For Kinds Of Addressing Mode
The Example Of How Based Addressing Mode(Kind Of Memory Operand) Works
The Example Of How Direct Addressing(1 Kind Of Memory Operand) Mode Works
The Example Of How Immediate Operands Work
The Example Of How Register Addressing Mode Works
The Example Of How Register Indirect Addressing(1 Kind Of Memory Operand) Mode Works
Unconditional Jump General Format
Von Neuman Vs Harvard Architecture