Answer / sandhya.v

2:
passing parameters on the stack is slightly less efficient
than passing those parameters in registers, the register
set is very limited and you can only pass a few value or
reference parameters through registers. The stack, on the
other hand, allows you to pass a large amount of parameter
data without any difficulty. This is the principal reason
that most programs pass their parameters on the stack.
3:
For this qustion ,there is a proper answer given in this
link
http://www.arl.wustl.edu/~lockwood/class/cse306/mp/mp0/mp0.h
tml

What is conditional Compilation?

3 Answers   emc2, HCL,

---

can you give real time example for polymarphism

5 Answers   TCS,

---

function overridind means and simple program

2 Answers  

---

In which Scenario you will go for Interface or Abstract Class?

1 Answers   InfoAxon Technologies,

---

what are three tenets of object orinted Systems?Why they call like that ? Please answer me. Advance thanks.

2 Answers   Excel,

---

What is difference between pop and oop?

0 Answers  

---

What are benefits of oop?

0 Answers  

---

What do you mean by Encapsulation?

0 Answers   Ittiam Systems,

---

What is object and class in oops?

0 Answers  

---

What are the fields of vtable

1 Answers   Mphasis,

---

#include <stdio.h> #include <alloc.h> #include <stdlib.h> #include <conio.h> 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.

0 Answers  

---

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

0 Answers  

---