Answer Posted / azamkhan.pathan

BASIC CONCEPT OF OOPS:
1.OBJECTS:
An object is an abstraction of a real world entity. It may
represent a person,a placea number and icons or something
else that can be modelled.Any data in an object occupy some
space in memory and can communicate with eachother .
2.CLASSES:
A class is a collection of objects having common
features .It is a user defined datatypes which has data
members as well functions that manupulate these datas.
3.ABSTRACTION:
It can be definr\ed as the seperation of unnecessary
details or explation from system requirments so as to
reduce the complaxities of understanding requirments.
4.ENCAPTULATION:
It is a mechanism that puts the data and function together.
It is bthe result of hiding implimintation details of an
object from its user .The object hides its data to de
accessed by only those functions which are packed in the
class of that object.
5.INHERITANCE:
It is the relationship between two classes of object such
that one of the classes ,the child takes all the relevent
features of other class -the parent.
Inheritance bring about reusablity.

Why is encapsulation used?

992

---

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

3761

---

Write a C++ program without using any loop (if, for, while etc) to print prime numbers from 1 to 100 and 100 to 1 (Do not use 200 print statements!!!)

2106

---

What are the features of oop?

1177

---

What is object in oop with example?

1239

---

How can you overcome the diamond problem in inheritance?

1184

---

What is meant by oops concept?

1044

---

What is overriding in oop?

1039

---

Why is object oriented programming so hard?

1082

---

What is pure oop?

1105

---

What is polymorphism and why is it important?

1042

---

write a C++ program for booking using constructor and destructor.

2542

---

How is polymorphism achieved?

1055

---

What is solid in oops?

1125

---

why reinterpret cast is considered dangerous?

2393

---