Answer Posted / amol shevkari

Polymorphism is an concept of OOPS.
Polymorphism allows a client to treat different objects in
the same way even if they were created from different
classes and exhibit different behaviors.
Ex.Traffic Signal->>>>Whenever red signal is glow,the all
different type of braking systems works.i.e.all vehicles of
braking system but there implementation is different and
purpose is same.

Hi friends I have experience of 6 months in website design and maintanence. Now i am looking for other IT jobs.. to switch platform. please post any interview you know in chennai.

2189

---

How many human genes are polymorphic?

1051

---

What is a superclass in oop?

1169

---

What is encapsulation example?

1048

---

What is polymorphism used for?

1057

---

What is persistence in oop?

1137

---

Why is polymorphism needed?

1049

---

What is super in oop?

1169

---

assume the program must insert 4 elements from the key board and then do the following programs.sequential search(search one of the elements),using insertion sort(sort the element) and using selection sort(sort the element).

2108

---

What do you mean by variable?

1034

---

Why is oop useful?

1098

---

Get me an image implementation program.

1976

---

What are the 5 oop principles?

1119

---

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

3751

---

What is the benefit of oop?

1048

---