Answer Posted / poorna chandar rao

Object and Class both are same there is no difference
bettwen them those are having properties(data) and methods
but small difference beteween them that is objects are
available physically avialable and class is not avialable
class is a bluprint

write a program to find 2^n+1 ?

2126

---

What are the data types in oop?

1162

---

What is the point of polymorphism?

1094

---

What is multilevel inheritance explain with example?

1203

---

to find out the minimum of two integer number of two different classes using friend function

2186

---

What is balance factor?

1132

---

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.

3130

---

What is the benefit of oop?

1103

---

What is coupling in oops?

1220

---

What is class and object with example?

1225

---

Describe these concepts: Polymorphism, Inheritance and Abstraction.

1247

---

Templates mean

2151

---

Can a destructor be called directly?

1137

---

What is encapsulation in simple terms?

1098

---

#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

---