Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Program is to find the maximum from two numbers:
Program is to find the maximum from two numbers entered by the user having pointer variable as parameter
void main()
{
clrscr();
int a,b,ans;
cout<<" enter the first number ";
cin>>a;
cout<<" enter the second number ";
cin>>b;
ans=*max(&a,&b);
cout<<" The maximum of two numbers is :"< } int *max(int *a,int *b) { if (*a>*b) return a; else return b; }
}
int *max(int *a,int *b)
if (*a>*b)
return a;
else
return b;
flow chart for push operation in stack
A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome
A: A reference has to always refer to some object and, so, must always be initialized; pointers do not have such limits. A pointer may be reassigned to point to distinct objects wh
algorithm
write a program in c language to implement stacks in a single array
Write a c++ program to find the sum of 0.123 ? 103 and 0.456 ? 102 and write the result in three significant digits.
Friend Functions One of the major features of OOP is information hiding. A class encapsulates data and methods to operate on that data in a single unit. The data from the class
Threaded binary tree: Consider the linked illustration of a binary tree 'T. Approximately half of the entries is the pointer fields 'LEFT' and 'RIGHT' will have null elements. Th
Write algorithms to implement the insertion and deletion operations.
What is Virtual Destructor? Describe it.
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd