Answer Posted / manoj kumar verma

OOps or Object Oriented Programming is the technique to
create program based on the real world.
OOPs based language to findout the object and manipulate
and their relation between each other. OOPa offer greather
flexibility and comptibility and is populor in developing
large application.
OOPs define the various properties such as..
1. Class -:
In class Define the all the Data members and
methods.
2. Objects -:
object is the Instance of class.
3. Methods -:
We know that a class can define both
attributes and behaviour.Attrbutes are define by varibles
and behavior are define by methods.

4. Abstraction -:
only show the essential details and do
not show the non - essential details.

5. Encapsulation -:
Means, hiding of the data members or
packing the data members and methods.

6. Inheritance -:
Reuseability of the code by making a
derived class. for e.g. father -> chield
A class is made looking at which the new derived class is
made with modification or addition in the derived class

7. Polymorphism -:
When one objects show the various
forms then it is known as polymorphism. for e.g.
One mobile key type the some character and one digits.

8. Message Passing -:
we can pass the one object to
another.

Can a destructor be called directly?

822

---

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

3525

---

What is the significance of classes in oop?

820

---

Why is abstraction used?

853

---

class type to basic type conversion

2104

---

What is static in oop?

837

---

hi, this is raju,iam studying b.tech 2nd year,iam want know about group1 and group2 details, and we can studying without going to any instutions? please help me.

1756

---

What are the benefits of interface?

815

---

Please send ford technologies placement paper 2 my mail id

1856

---

How do you use inheritance in unity?

816

---

Write a java applet that computes and displays the squares of values between 25 and 1 inclusive and displays them in a TextArea box

2289

---

What is encapsulation with real life example?

797

---

What is the real time example of encapsulation?

809

---

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

1964

---

Can we create object of abstract class?

846

---