Answer Posted / ravneet dhillon

1.c supports build-in and primitive datatype whereas c++
supports both build-in and user-defined datatype.

2.no namespace are present in c. namespace are present in c++.

3.polymorphism is not possible in c.polymorphism is possible
in c++.

4.no virtual function are present in c.there are virtual
function in c++.

5.In c,we have to declare variables at the start.In c++ we
can declare variables at any point with in a block not just
at the begining.

6.operator overloading is not possible in c.operator
overloading is possible in c++.

7.c have no classes.c++ use classes.

8.multiple declaration of global variables are allowed in
c.multiple declarations of global variables are not allowed
in c++.

9.c supports top down parsing.c++ supports bottom of parsing.

10.in c we can call main() function through other
function.in c++ we can not call main() function through
other function
or
we can say main function could be recursive in c and it
can't be called recursively in c++.

Why is polymorphism used?

1050

---

is there any choice in opting subjects like 4 out of 7

2197

---

What are properties in oop?

1098

---

IS IT NECESSARY TO INITIALIZE VARIABLE? WHAT IF THE INSTANCE VARIABLE IS DECLARED final ? IS IT NECESSARY TO INITIALIZE THE final VARIABLE AT THE TIME OF THEIR DECLARATION?

2077

---

write a programe to calculate the simple intrest and compund intrest using by function overlading

2214

---

What is the use of oops?

1066

---

What is polymorphism oop?

1070

---

What is the real time example of encapsulation?

1070

---

Why is object oriented programming so hard?

1091

---

class type to basic type conversion

2421

---

How do you define social class?

1084

---

Why is destructor used?

1032

---

Can a destructor be called directly?

1078

---

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

3773

---

State what is encapsulation and friend function?

1277

---