Answer Posted / piyush

c is hard to manage whereas c++ is easily managable

Why is oop better than procedural?

1145

---

Which method cannot be overridden?

1174

---

What is the real time example of inheritance?

1208

---

What do you mean by variable?

1096

---

What are the benefits of oop?

1348

---

which feature are not hold visual basic of oop?

2237

---

#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

---

What is object and class in oops?

1116

---

write a program using c++ to implement single contiguous memory mangement techniques.display the content of the main memory after yhe allocation of jobs and percentage of the wastage of the main memory

3273

---

What is polymorphism programming?

1181

---

Get me a number puzzle game-program

2318

---

What are the important components of cohesion?

1079

---

What is encapsulation oop?

1106

---

Write a program to sort the number with different sorts in one program ??

2431

---

What is class encapsulation?

1146

---