Answer Posted / srujana

If binding is resolved at compilation time then it is said
to be static polymorphism.
If binding is resolved at reun time then it is said to be
dynamic polymorphism. to implement dynamic polymorphism,
pointers and virtual functions are used.

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.

2804

---

Why is polymorphism used?

768

---

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

1858

---

Whats oop mean?

786

---

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

3512

---

What causes polymorphism?

808

---

Why we use classes in oop?

758

---

c++ program to swap the objects of two different classes

2115

---

What is solid in oops?

803

---

What is overloading in oop?

755

---

What are the 3 pillars of oop?

856

---

can we make game by using c

3708

---

What is persistence in oop?

852

---

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

2179

---

What does and I oop and sksksk mean?

861

---