Heart ♥ in C++ .. ☻

#include#include#include void main(){clrscr();int num;cout<<"Please Enter Number : ";cin>>num;cout<<"\n\n";int g=num*2, x=num/2, v=0, m=num,n=0; for(int q=0;q<(num/2);q++){for(int u=0;u<x;u++)printf(” “);x–;cout<<char(3);for(int o=0;o<v;o++)printf(” “);v+=2;cout<<char(3);for(int l=0;l<m-1;l++)printf(” “);m-=2;cout<<char(3);for(int a=0;a<n;a++)printf(” “);n+=2;cout<<char(3);printf(“\n”); } for(int i=0;i<num;i++){int s,j;for(s=0;s<=i;s++){printf(” “);}cout<<char(3);for(j=0;j<g-1;j++){printf(” “);}g-=2;cout<<char(3);printf(“\n”);if(i==(num-1)){for(int f=0;f<(num+1);f++)printf(” “);cout<<char(3);}}getch();}

.IF statement in Assembly Language

Write an assembly program that take age of 50 people and count the number of people lives in the age group given below ? Also print the age 20 – 30 years 40 – 50 years 35 – 45 years 25 – 45 years include irvine32.inc .datamsg byte “:  Enter a No: “,0msg2 byte ” Sory Range Not Found

Turbo c++ for android { Complete guide of installation }

Hello guys, today in this post I will explain how to download and install turbo c++ in android. I am sure you are aware about for turbo c++. Well turbo c++ is one type of compiler which is specially designed for c/c++ .One can easily perform most of the c/c++ programs with help of turbo c++! We already provided turbo c++ for windows

Program to generate 20 Even no and then saved and display them by after making Odd

Program to generate 20  Even no and then saved and display them by after making OddAssembly Language include irvine32.inc .dataarr dword 20 DUP(?)msg byte ” Even NO: “,0,13h,10hmsg1 byte ” After converting it into ODD: “,0,13h,10hcount dword 0num dword 0divied dword 0 .codemain proccall clrscrcall crlf mov esi,0.while count != 20;call randomizecall random32 mov eax,100call randomrange

Make all values of tree negative -ive

#include#includeclass Node{private: int data; Node* right; 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 = q->left;  }   if (newnode->data> p->data)   p->right = newnode;  else

Making all even values odd in a tree

#include#includeclass Node{private: int data; Node* right; 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 = q->left;  }   if (newnode->data> p->data)   p->right = newnode;  else

Make all Odd values Even in a tree

#include#includeclass Node{private: int data; Node* right; 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 = q->left;  }   if (newnode->data> p->data)   p->right = newnode;  else

Display only Odd values from tree

#include#includeclass Node{private: int data; Node* right; 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 = q->left;  }   if (newnode->data> p->data)   p->right = newnode;  else

Display only even Values from tree

#include#includeclass Node{private: int data; Node* right; 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 = q->left;  }   if (newnode->data> p->data)   p->right = newnode;  else p->left =

Write a Function to display only leaf nodes

#include#includeclass Node{private: int data; Node* right; 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 = q->left;  }   if (newnode->data> p->data)   p->right = newnode;  else