Data transfer instructions copies data from a source to a destination without modifying the contents of the source. They perform the following six operations: Load an 8 bit number in a register. Copy from register to register. Copy between I/O and accumulator. Load 16-bit number in a register pair. Copy betwwen register and memory. Copy […]
Data Transfer Instructions in 8085 Read More »
In this tutorial, you will learn the implementation of different tree traversal algorithms, which were specified recursively in the last tutorial, by means of non-recursive procedures using stacks. Pre-order Traversal Without Recursion The following operations are performed to traverse a binary tree in pre-order using a stack: Start with root node and push onto stack.
Binary Tree Traversal Algorithm Without Recursion Read More »
The entire group of instructions that a microprocessor is called the instruction set of that microprocessor. The instruction set determines what functions the microprocessor can perform. The 8085 instructions are classified into five functional categories Data transfer operations. Arithmetic operations. Logical operations. Branching operations. Machine control operations. Data transfer operations Data transfer instructions copies data
8085 Instruction Set Read More »
Microprocessors recognize and operate in binary numbers. Word The number of bits the microprocessor recognizes and processes at a time is called a word. Byte A group of eight bits is called a Byte. Nibble A group of four bits is called a Nibble. Instruction To communicate with a microprocessor we must give instructions in
Assembly Language Programming Basics Read More »
This tutorial discusses different ways for traversing a binary tree (pre-order, post-order, in-order) with algorithms. Binary Tree Traversal A binary tree can be traversed in three different ways, namely, pre-order, post-order and in-order. The order in which the nodes are visited differs between these techniques. In-order Traversal of Binary Tree The following operations are done
Binary Tree Traversal Algorithms Read More »
The following figure shows the pin diagram of the 8085 microprocessor. Control and Status SIgnals (Address Latch Enable) A positive-going pulse is generated every time the 8085 begins an operation (machine cycle). It indicates that the AD7 – AD0 bits are address bits. (Read) Indicates that the selected I/O or memory device is to be
A Binary tree is a special tree where each node can have no more than two children. A non-empty binary tree consist of the following: A node called the root node. A left sub-tree. A right sub-tree. Both the sub-trees are themselves binary trees. Types of Binary Trees Complete Binary Tree The tree T is
The functional block diagram or the internal architecture of the 8085 microprocessor is shown in the figure. The functional blocks of an 8085 microprocessor are, Registers. General Purpose Registers. Special Purpose Registers. Flag Registers. Arithmetic Logic Unit. Instruction Register and Decoder. Timing and Control Unit. Address Buffer. Address/Data Buffer. Incrementer/Decrementer Address Latch. Interrupt Control. Serial
The Architecture of 8085 Microprocessor Read More »
A tree is a non-linear data structure that organizes data in a hierarchical structure and this is a recursive definition. It is a set of one or more nodes, with one node identified as the tree’s root and all remaining nodes partitionable into non-empty sets, each of which is a subtree of the root. Since
Tree Data Structure Read More »
The operation of a microprocessor unit includes, Memory Read. Memory Write. I/O Read. I/O Write. Communication of a Microprocessor unit with peripheral devices involves, Identify peripheral or memory location. Transfer data and instruction. Provide timing and synchronization signals. The microprocessor uses three sets of communication lines called buses to perform these functions. A bus is
8085 Bus Organization Read More »
