Answer Posted / san

Dear Jass,

Let me tell you an answer to your question.

See this is the question just to ask you for a formalit sake
no intervier is going to reject you because of this
questions answer if he was about to take you in.

Here only he expects how you answer his question becuase he
knows that you have put your best in every year of your
academics and the result is so.. only he wants to see your
opinion on this.(He refer to Interviewer)

You can answer like: I have put my best efforts in every
year of my academics but I found that I am a better scorer
in MCA, yes one thing I can say is I had few subjects which
drawn my more concentration and went in depth of it and
really did better in them.

Explain virtual inheritance?

1129

---

What is the advantage of oop over procedural language?

1010

---

what are the ways in which a constructors can be called?

2052

---

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

2566

---

What is debug class?what is trace class? What differences are between them? With examples.

2136

---

How does polymorphism work?

1080

---

Can destructor be overloaded?

981

---

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

2328

---

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

3704

---

Why do we use polymorphism?

1017

---

Hi friends I have experience of 6 months in website design and maintanence. Now i am looking for other IT jobs.. to switch platform. please post any interview you know in chennai.

2150

---

What is an advantage of polymorphism?

1034

---

What is difference between inheritance and polymorphism?

978

---

What is purpose of inheritance?

1054

---

What is constructor in oop?

1021

---