Answer Posted / funny guy

Multiple Inheritance is a feature of OOPS where the derived
class can extend features from more than one class.

That means if we have class A and class B then class C can
extend class A and class B.

Having said that from Java point of view this feature is not
supported as it may result in Diamond Problem.

C++ does support this features.

What type of loop is a for loop?

1133

---

What is the purpose of polymorphism?

1175

---

What is the main purpose of inheritance law?

1248

---

Why we use classes in oop?

1097

---

What is byval and byref? What are differences between them?

2269

---

Which is better struts or spring?

1116

---

What is polymorphism give a real life example?

1077

---

Question: Write a program that prints a paycheck. Ask the program user for the name of the employee, the hourly rate, and the number of hours worked. If the number of hours exceeds 40, the employee is paid “time and a half”, that is, 150 percent of the hourly rate on the hours exceeding 40. Be sure to use stepwi se refine ment and break your solution into several functions. Use the int_name function to print the dollar amount of the check.

1312

---

#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 are the advantages of polymorphism?

1084

---

write a program to find 2^n+1 ?

2126

---

What is constructor overloading in oop?

1180

---

How to call a non virtual function in the derived class by using base class pointer

6694

---

How do you define social class?

1117

---

Can an interface inherit a class?

1108

---