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!
/* THIS PROGRAM IS TO ASK USER TO INPUT TWO DATE & PRODUCE A NEW DATE */#include #include struct date { int dd; int yy; int mm; };date add(date d1,date d2) { date temp; temp.dd=d1.dd+d2.dd; temp.mm=d1.mm+d2.mm; temp.yy=d1.yy+d2.yy; if(temp.dd>=30) { temp.dd-=30; temp.mm++; } else if(temp.dd>=31) { temp.dd-=31; temp.mm++; } else if(temp.dd>=28) { temp.dd-=28; temp.mm++; } if(temp.mm>=12) { temp.mm-=12; temp.yy++; } return temp; }void main() { clrscr(); date d1,d2,ans; cout<<" enter the 1st date (dd/mm/yyyy) "; cin>>d1.dd; cin>>d1.mm; cin>>d1.yy; cout<<" enter the 2nd date (dd/mm/yyyy) "; cin>>d2.dd; cin>>d2.mm; cin>>d2.yy; ans=add(d1,d2); cout<<" new date:-"< }
C Program to check FACTORIAL main() { int i,j,m,fact,sum=0; clrscr(); printf("ENTER THE NO.: "); scanf("%d",&m);
What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?Minimum 100 words accepted#
Operator overloading - c++ program: Write a program in c to define operator overloading. class matrix{ private : int x[2][2];
planning the solution
Receive 3 numbers and display them in ascending order from smallest to largest ed#
#questio#A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string
what is oop?
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b
A: (a) int foo = 123; (b) int bar(123);
A: Here are a few of the many instance of operator overloading: myString + yourString may concatenate two std::string objects myDate++ may increment a Date object a * b may m
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