Answer Posted / pavan raj

polymorphism means the ability to take more than one form.
This is something similar to a word having several different
meanings depending on the context.

What is destructor in oop?

1002

---

What polymorphism means?

1018

---

What is encapsulation in oops?

974

---

Whats oop mean?

999

---

Where You Can Use Interface in your Project

1855

---

Question: Implement a base class Appointment and derived classes Onetime, Daily, Weekly, and Monthly. An appointment has a description (for example, “see the dentist”) and a date and time. Write a virtual function occurs_on(int year, int month, int day) that checks whether the appointment occurs on that date. For example, for a monthly appointment, you must check whether the day of the month matches. Then fill a vector of Appointment* with a mixture of appointments. Have the user enter a date and print out all appointments that happen on that date.

1274

---

How do you achieve runtime polymorphism?

1019

---

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

2345

---

What is basic concept of oop?

1121

---

What is encapsulation c#?

1028

---

What is the difference between encapsulation and polymorphism?

1066

---

How many human genes are polymorphic?

1024

---

Which is better struts or spring?

1010

---

#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.

3719

---

Write a program to implement OOPS concepts such as inheritance, polymorphism, friend function, operator overloading?

4699

---