Answer Posted / achal ubbott

Abstraction literally means hiding. Now in OOP the
intention is to hide the complexity. For this reason
generally the data in classes is protected. THis data is
accessible to the functions(some times called behaviour).
OK! now for a user creating an application, it is easier to
use functions using the objects of class rather than
manipulating the data itself. This is how abstraction
works. Abstraction is a conceptual theory or a way of doing
things, not a must.

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

2149

---

• What are the desirable attributes for memory managment?

2182

---

What is cohesion in oop?

1013

---

What are classes oop?

984

---

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

2299

---

What is abstraction oop?

1041

---

Is this job good for future? can do this job post grduate student?

2112

---

What is constructor overloading in oop?

1095

---

What is a class and object?

1024

---

Why do we use oops?

973

---

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

2091

---

Can we create object of interface?

1085

---

What is abstraction and encapsulation?

963

---

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

3719

---

What language is oop?

984

---