Answer Posted / yogesh goyal

my dear, you will only get job when you will have knowedge
of progamming if you will not be able to do programming
that time you will not be abel to get a job

What are the components of marker interface?

1067

---

Write a C++ program without using any loop (if, for, while etc) to print prime numbers from 1 to 100 and 100 to 1 (Do not use 200 print statements!!!)

2110

---

What is polymorphism explain its types?

1173

---

What is the importance of oop?

1100

---

What is inheritance in oop?

1037

---

How to handle exception in c++, For example in a functions i am assigning memory to some variables and also in next instructions in am dividing one variable also. If this functions generates a error while allocating memory to those variable and also while dividing the variable if i divide by zero then catch block how it will identify that this error has cone from perticular instruction

2146

---

What type of loop is a for loop?

1093

---

What is the difference between static polymorphism and dynamic polymorphism?

1095

---

What is multilevel inheritance explain with example?

1155

---

How is class defined?

1148

---

What is protected in oop?

1087

---

What is basic concept of oop?

1174

---

Why do we need oop?

1213

---

Give an example where we have to specifically use C programming language and C++ programming language cannot be used?

1641

---

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

3770

---