In this tutorial, you will learn the breadth first search (BFS) algorithm for traversing a graph data structure with examples. Depth-first search or depth-first traversal is a recursive algorithm used to visit all the vertices in a graph. Breadth First Search Algorithm In the BFS algorithm, the traversal starts from a node and then carries […]
Breadth First Search (BFS) Read More »
The way in which the operand of an instruction is specified is referred to as addressing modes. The addressing mode specifies how the address field of the instruction is to be interpreted before the operand is actually executed. The 8085 microprocessor has 5 types of addressing modes. Immediate Addressing Mode In immediate addressing mode, the
Addressing Modes in 8085 Read More »
In this tutorial, you will learn the depth first search (DFS) algorithm for traversing a graph data structure with examples. Depth-first search or depth-first traversal is a recursive algorithm used to visit all the vertices in a graph. Depth First Search Algorithm In the DFS algorithm, the traversal starts from a node and then follows
Depth First Search (DFS) Read More »
These instructions affect the operation of the microprocessor. Halt and No operation are the two program control or machine control instructions. Opcode Description HLT Halt1-byte instruction.The processor stops executing and enters waiting state.The address bus and databus are placed in high impedance state. Register contents are not affected. NOP No Operation1-byte instruction.No operation is performed.Generally
Machine Control Instructions in 8085 Read More »
In this tutorial, you will learn an important data structure, Graph. You will also discover basic terminology, types of graphs, how graphs are represented in memory and their applications. A graph is a non-linear data structure consisting of vertices and edges that connect these vertices. Definition A graph is an ordered set G = (V,
Graph Data Structure Read More »
Branch instructions allow the microprocessor to change the sequence of the program, either unconditionally or under certain conditions. Branch instructions are classified into the following three categories. Jump instructions. Call and return instructions. Restart instructions. Jump instructions are classified into two categories: Unconditional and conditional jump instructions. Unconditional Jump Instructions Unconditional jump instructions allow the
Branch Instructions in 8085 Read More »
A microprocessor can perform all the logic functions of the hard-wired logic through its instruction set. These instructions include: AND OR Exclusive-OR Compare Rotate Bits All logic operations are performed in relation to the contents of the accumulator. The complete list of logical instructions in 8085 is described in the following table. Mnemonic Description Example
Logical, Shift and Rotate Instructions in 8085 Read More »
An expression tree is a special type of binary tree that is used to store algebraic expressions. In an expression tree, each internal node corresponds to the operator and each leaf node corresponds to the operand. Consider the algebraic expression given as: X = (a + b) – (c * d). This can be represented
Arithmetic instructions perform various arithmetic operations such as addition, subtraction, increment, and decrement. Commonly used arithmetic operations are: Add Subtract Increment Decrement The complete list of arithmetic instructions in 8085 is described in the following table. Mnemonic Description Example ADD R 1-byte instructionAdds the contents of register R to the contents of the accumulator. ADD
Arithmetic Instructions in 8085 Read More »
In this tutorial, you will learn what is a binary search tree, how different operations like insertion, deletion, searching are done in a binary search tree with examples in C and what are the applications of binary search trees. A Binary Search Tree is a special binary tree used for the efficient storage of data.
Binary Search Tree (BST) Read More »
