Answer Posted / m.shanmuga sundaram

Oops is an acronym for object oriented programming language
or object oriented paradigm

Building blocks of oops are

1) Data Encapsulation :
Hiding non essential things from an user

2) Abstraction
Implementation of data encapsulation

3) Inhertitance
Reusability of code

4) Polymorphism
The ability of a function that can act on different data
types in different ways

Why is destructor used?

1082

---

How to handle exception in c++, For example in a functions i am assigning memory to some variables and also in next instructions in am dividing one variable also. If this functions generates a error while allocating memory to those variable and also while dividing the variable if i divide by zero then catch block how it will identify that this error has cone from perticular instruction

2184

---

I have One image (means a group photo ) how to split the faces only from the image?............ please send the answer nagadurgaraju@gmail.com thanks in advace...

2175

---

What is constructor in oop?

1176

---

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

2273

---

How is polymorphism achieved?

1114

---

What is constructor overloading in oop?

1182

---

What is difference between polymorphism and inheritance?

1135

---

What is encapsulation in oop?

1104

---

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

3830

---

How oops is better than procedural?

1151

---

What are oops functions?

1079

---

Advantage and disadvantage of routing in telecom sector

1352

---

Why polymorphism is used in oops?

1107

---

Get me an image implementation program.

2045

---