Answer Posted / sonali

A class that provides some but not all of the
implementation for a virtual base class is often called
mixin. Derivation done just for the purpose of redefining
the virtual functions in the base classes is often called
mixin inheritance. Mixin classes typically don't share
common bases..

What is polymorphism and why is it important?

556

---

What is pure oop?

597

---

Why is polymorphism used?

581

---

what is graphics

2009

---

Write a program to compute for numeric grades for a course. The course records are in a file that will serve as the input file. The input file is in exactly the following format: Each line contains a student's first name, then one space, then ten quiz scores all on one line. The quiz scores are in whole number and are separated by one space. Your program will take it input from this file and sends it output to a second file. The data in the output file will be exactly the same as the data in the input file except that there will be one additional number (of type double) at the end of each line. This number will be the average of the student's ten quiz scores. Use at least one function that has file streams as all or some of its arguments.

2571

---

---

• What are the desirable attributes for memory managment?

1725

---

What are different types of JVM's? for example we use dalvik jvm for android then what about the remaining operating systems?

1648

---

Can we define a class within the interface?

551

---

what is the sylabus for priliminaries?

1683

---

Can we create object of interface?

601

---

What language is oop?

591

---

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

3246

---

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

1985

---

What is constructor overloading in oop?

601

---

What is a null tree?

627

---