Answer Posted / santosh

Dear Indu,

Its good to see that you are a Computer Scienece graduate in
engineering, It is time for you to look for different
openings around you either be from your friends, net or new
papers.
Apply to such openings and wait for Call Letter to
come to you.
Once you get your call letter for Written test or further
process you will be knowing the next steps.
A general Scenario of Interview is as explained by the
earlier person before me.. i.e.
Written Test (Includes Technical & Aptitude)
Group Discussion(Not for all companies but an important aspect)
Technical Round(Will be asked on your stream subjects)
Human Resource round(It may be in Technical round it self in
few interviews)

What are benefits of oop?

733

---

What do you mean by variable?

667

---

They started with the brief introduction followed by few basic C++ questions on polumorphism, inheritance and then virtual functions. What is polymorphims? How you will access polymorphic functions in C? How virtual function mechanism works?

1491

---

What is polymorphism in oops?

637

---

What is polymorphism in oop example?

618

---

---

What is polymorphism explain its types?

779

---

can inline function declare in private part of class?

3786

---

What does sksksk mean in text slang?

1687

---

What is super in oop?

694

---

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

3362

---

#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2256

---

Why multiple inheritance is not possible?

681

---

Why is abstraction used?

713

---

Why do we need oop?

780

---

INSTANCE FIELDS DECLARED private ARE ACCESSIBLE BY THE METHODS ONLY.CAN WE CHANGE THE private FIELD OF AN OBJECT IN A METHOD OF SOME OTHER OBJECT OF THE SAME CLASS?

1736

---