Answer Posted / deepthi

By using virtual tables,

when Compiler views virtual in a class declaration then for
each class it creats one virtual table

What is encapsulation in oops?

1015

---

What is difference between abstraction and encapsulation?

1083

---

What is interface in oop?

1130

---

What is a class and object?

1055

---

What is encapsulation oop?

1043

---

Get me an image implementation program.

1987

---

What is class and object in oops?

1145

---

What is the highest level of cohesion?

1052

---

Why do we need polymorphism in c#?

1172

---

What is polymorphism give a real life example?

1038

---

What does I oop mean?

1076

---

i got a backdoor offer in process global,Bangalore..Can i work with it?

2845

---

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

3763

---

What is inheritance and how many types of inheritance?

1105

---

What is the full form of oops?

1194

---