How to calculate the age from the date of birth by using the
program?

Answer Posted / dileep

we are using time.h header file to get the date of birth of
user. in this header file haveing the some in built functions

Is This Answer Correct ?    5 Yes 3 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

State what is encapsulation and friend function?

805


write a program that takes input in digits and display the result in words from 1 to 1000

2085


Templates mean

1669


What type of loop is a for loop?

777


write string class as your own class in java without using any built-in function

2062






What is the renewal class?

2259


They started with the brief introduction followed by few basic C++ questions on polumorphism, inheritance and then virtual functions. What is polymorphims? How you will access polymorphic functions in C? How virtual function mechanism works?

1492


Give an example where we have to specifically use C programming language and C++ programming language cannot be used?

1242


Is data hiding and abstraction same?

662


write a program to find 2 power of a 5digit number with out using big int and exponent ?

2004


What is and I oop mean?

721


#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3364


What is byval and byref? What are differences between them?

1792


What is polymorphism and why is it important?

651


what is different between oops and c++

2081