Answer Posted / sathya

oops means that object oriented programming, the precedure
ifollowed inc lan...

What is polymorphism and why is it important?

556

---

• What are the desirable attributes for memory managment?

1723

---

What is polymorphism oop?

614

---

Is data hiding and abstraction same?

565

---

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.

2567

---

---

What are the data types in oop?

600

---

What is overriding in oops?

596

---

Is this job good for future? can do this job post grduate student?

1686

---

Get me a number puzzle game-program

1690

---

Will I be able to get a picture in D drive to the c++ program? If so, help me out?

1652

---

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

1684

---

#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

---

What is the types of inheritance?

594

---

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

5248

---

What causes polymorphism?

566

---