Answer Posted / subhashish sen

The inline function is a special function which is basically
used for small function body.If a function with large body
is defined as inline then it would be treated as a normal
function.

The advantage is that the code gets inserted at the place of
function call so it will reduce the time taken for control
to go back and forth from function call to function
definition.So as a result it will make execution faster.

Note: When we declare a function as inline we merely send a
request to the compiler,so its up to the compiler whether
our request is is accepted or not.So its better to define an
inline function for a small function.

How can you overcome the diamond problem in inheritance?

1228

---

Why do we use encapsulation in oops?

1087

---

what is graphics

2516

---

Can we create object of interface?

1175

---

What is the highest level of cohesion?

1110

---

There are two base class B1,B2 and there is one class D which is derived from both classes, Explain the flow of calling constructors and destructors when an object of derived class is instantiated.

2054

---

write a program that takes input in digits and display the result in words from 1 to 1000

2490

---

What is meant by multiple inheritance?

1336

---

What do you mean by Encapsulation?

1140

---

What is pointer in oop?

1125

---

What is methods in oop?

1034

---

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

3830

---

What is the purpose of enum?

1058

---

What is the difference between encapsulation and polymorphism?

1156

---

What is abstraction example?

1158

---