Answer Posted / jayasrinivas.donavalli

The main Difference between C and C++ is C is Object Based
program.that means in C also we have Object based
Applications like Structures and Unions.
C++ is Object Oriented Language that means entire
application will be depending on Objects only.
Uses of Object oriented Program is Reusability,Increase the
effiency of the program and it gives extra security like
Private data is also be there in C++.
C++ is the Advanced version of C.
In otherwords we say c++ supports both Object based and
Object oriented Applications

what is difference between class template and template class?

2658

---

What are the two different types of polymorphism?

1141

---

What are constructors in oop?

1172

---

Explain virtual inheritance?

1199

---

Give two or more real cenario of virtual function and vertual object

2327

---

What is inheritance write a program to show use of inheritance?

1147

---

State what is encapsulation and friend function?

1258

---

What does no cap mean?

1061

---

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

2137

---

What is the difference between static polymorphism and dynamic polymorphism?

1083

---

class type to basic type conversion

2400

---

What is an example of genetic polymorphism?

1181

---

How Do you Code Composition and Aggregation in C++ ?

25463

---

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

3757

---

What are the important components of cohesion?

1021

---