Answer Posted / jayakrishna reddy

The virtual keyword means that method,property or function
can be overridden

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

2432

---

i am getting an of the type can not convert int to int *. to overcome this problem what we should do?

2320

---

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

4752

---

IS IT NECESSARY TO INITIALIZE VARIABLE? WHAT IF THE INSTANCE VARIABLE IS DECLARED final ? IS IT NECESSARY TO INITIALIZE THE final VARIABLE AT THE TIME OF THEIR DECLARATION?

2071

---

Why do we need polymorphism in c#?

1173

---

to find out the minimum of two integer number of two different classes using friend function

2146

---

What is encapsulation in simple terms?

1042

---

What is the difference between inheritance and polymorphism?

1115

---

What is polymorphism give a real life example?

1038

---

Why do we need oop?

1207

---

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

2505

---

What is the highest level of cohesion?

1053

---

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

3767

---

What is destructor give example?

1058

---

How long to learn object oriented programming?

1096

---