Answer Posted / lilly

1. data members and member functions.
2.data hiding is where data is hidden from outside access
other than class members.
data encapsulation is where data members and member
functions are binded together into a single entity called
class which inturn does data hiding.
3.by changing the visibility mode as public.
4.the visibility of a class data member will be private by
default.
5.a.data is controlling access over the code in oop whereas
in structured programming code is acting on data.
b.data is hidden from outside access by encapsulating it
into a single entity whereas no data security in SP.
c.emphasis is on data in oop whereas in SP emphasis is on
functions.
d.Objects play the main role in oop where as no objects in
SP.
e.Code can be reused in oop by inheritance feature whereas
in Sp we cant reuse the code.
f.large n complex programs can be easily maintained whereas
in SP it becomes complex when it reaches 100,000 lines of
code.
g.we can use global and local variables easily in oop coz
of class entity but it is very complex and confusing in
Structured programming.

What is the example of polymorphism?

1137

---

What is persistence in oop?

1154

---

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

25490

---

What is class and example?

1198

---

What are oops methods?

1023

---

String = "C++ is an object oriented programming language.An imp feature of oops is classes and objects".Write a pgm to count the repeated words from this scenario?

2402

---

if i have same function with same number of argument but defined in different files. Now i am adding these two files in a third file and calling this function . which will get called and wht decide the precedence?

3540

---

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

2197

---

What is the problem with multiple inheritance?

1177

---

What is a superclass in oop?

1187

---

to find out the minimum of two integer number of two different classes using friend function

2149

---

#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

---

What is and I oop mean?

1215

---

What are the benefits of oop?

1266

---

what is graphics

2470

---