Answer Posted / hemakishore

1.image processing
2.pattern recognition
3.computer aided design
4.mobile computing
5.intelligent system
6.parallel computing
7.data security and management

What are oops methods?

565

---

Why is polymorphism used?

581

---

write a C++ program for booking using constructor and destructor.

2042

---

Which language is not a true object oriented programming language?

640

---

What is balance factor?

580

---

---

What is a class and object?

595

---

What are the important components of cohesion?

550

---

What is object in oop with example?

695

---

Explain the concepts involved in Object Oriented programming.

629

---

What is inheritance and how many types of inheritance?

614

---

Why do we use class in oops?

553

---

Can you name some types of inheritance?

637

---

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.

2570

---

What is polymorphism what are the different types of polymorphism?

560

---

#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

---