Using AND convert lower alphabets into upper ~ Assembly Programs

This Program Use AND operator to Convert lower alphabets into upperx   y   x^y1   0    00   0    0  1   1    10   1    0 include irvine32.inc.data   alp byte ?  msg byte “Please Enter an Alphabet to Make it in upper latter: “,0,13h,10h  msg1 byte “In upper

check parity of 8-bit number Assembly Program

See Also: Check Parity of 32-bit Number Assembly Program                 Check Parity of 16-bit Number Assembly Program                 Check Parity of 8  -bit Number Assembly Program include irvine32.inc.data    num byte 122msg  byte “Parity Flag is set   : PF=EVEN “,0,13h,10hmsg1 byte “Parity flag

Check parity of 16-bit number Assembly Program

See Also: Check Parity of 32-bit Number Assembly Program                 Check Parity of 16-bit Number Assembly Program                 Check Parity of 8  -bit Number Assembly Program include irvine32.inc.data    num word 39263msg  byte “Parity Flag is set   : PF=EVEN “,0,13h,10hmsg1 byte “Parity flag

Check Parity of 32-bit Number Assembly Program

See Also: Check Parity of 32-bit Number Assembly Program                 Check Parity of 16-bit Number Assembly Program                 Check Parity of 8  -bit Number Assembly Program include irvine32.inc.data    num dword 3043274211msg  byte “Parity Flag is set   : PF=EVEN “,0,13h,10hmsg1 byte “Parity flag

Insert 100 in all Leaf nodes and 10 in all non leaf nodes using BST

Insert 100 in all Leaf nodes and 10 in all non leaf nodes using BST in C++ #include#includeclass Node{private: int data; Node* right,*q,*p; Node* left;public: Node(){ root=NULL; right=left=NULL; }Node *root; void insert(int data){ Node* newnode = new Node(); newnode->data = data; if (root == NULL){ root=newnode; return; } Node *p,*q; p=q=root; while (q!=NULL){ p=q; if

Take Maximum Node Make it Root Node

Take Maximum Node Make it Root Node and attach rest of tree with it so that BST Property will not volatilized #include#includeclass Node{private: int data,i; Node* right,*q,*p; Node* left;public: Node(){ root=NULL; right=left=NULL; }Node *root; Node* remove(Node *root, int value){ Node *t; int cmpr = value – root->data; if (cmpr < 0){ t = remove(root->left, value); root->left

Find Minimum node make it Root node attach rest of Tree with it such that BST property is not violated

Find Minimum node make it Root node attach rest of Tree with it such that BST property is not violated #include#includeclass Node{private: int data,i; Node* right,*q,*p; Node* left;public: Node(){ root=NULL; right=left=NULL; }Node *root;Node* remove(Node *root, int value){ Node *t; int cmpr = value – root->data; if (cmpr < 0){ t = remove(root->left, value); root->left = t;

Traverse Tree According To User Value :Get Value From User ☻ :~C++ Code Tree

Traverse Tree According To User Value :Get Value From User ☻#include#includeclass Node{private: int data; Node* right,*q,*p; Node* left;public: Node(){ root=NULL; right=left=NULL; }Node *root; void insert(int data){ Node* newnode = new Node(); newnode->data = data; if (root == NULL){ root=newnode; return; } Node *p,*q; p=q=root; while (q!=NULL){ p=q; if (newnode->data> q->data) q = q->right; else q

Traverse Left Subtree with Post Order and Right Sub tree with PreOrder ~ C++ Codes Tree

Traverse root left sub tree with post order ☻and then print root ☻and then root right sub tree with pre order ☻ #include#includeclass Node{private: int data; Node* right,*q,*p; Node* left;public: Node(){ root=NULL; right=left=NULL; }Node *root; void insert(int data){ Node* newnode = new Node(); newnode->data = data; if (root == NULL){ root=newnode; return; } Node *p,*q;

Insert A Value on Left Side which is greater Then Root and Small Value on Right side ~ C++ Tree codes

Insert A Value on Left Side which is greater Then Root and Small Value on Right side #include #include class Node{ private: int data; Node* right,*q,*p; Node* left; public: Node(){ root=NULL; right=left=NULL; }Node *root; void insert(int data){ Node* newnode = new Node(); newnode->data = data; if (root == NULL){ root=newnode; return; } Node *p,*q; p=q=root;