Answer Posted / jatin gupta

The main difference in c & c++ is that.....
c language is a procedure oriented language where as
c++ is a object oriented language!!!

given a set based questions and 5 questions based on it next data sufficiciency questions 2 and 2/3 english sentence completion with options very easy and 2 synononmys paragraph with 10 questions 10 minutes replace =,-,*,% with -,%,+,* type questions 5 3 questions lik following itssickhere itssickthere itssickhere istsickhere which is nt alike the others very easy

2674

---

What is the difference between static polymorphism and dynamic polymorphism?

1138

---

How is class defined?

1212

---

Write a java applet that computes and displays the squares of values between 25 and 1 inclusive and displays them in a TextArea box

2684

---

Explain the advantages of inheritance.

1196

---

When not to use object oriented programming?

1182

---

What is an interface in oop?

1092

---

officer say me - i am offered to a smoking , then what can you say

2164

---

Describe these concepts: Polymorphism, Inheritance and Abstraction.

1247

---

Which language is pure oop?

1074

---

Why is encapsulation used?

1056

---

What are oops functions?

1078

---

can inline function declare in private part of class?

4500

---

Can abstract class have normal methods?

1107

---

#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

---