wht did you apply at teletech? why not in tanscom, convergy's, ventus, etc.?

1096

---

RRB exam model questions pls forward.

767

---

What is the purpose of stand by earth fault protection for transformer ?

722

---

what is the diffrence betwen primary pumps and secondary pumps in aircoditioning field

802

---

What are the effects of corona in switch yard.

822

---

---

Hi guys! I buyed this clone carprog but i realized that not reading 24cxx. I tried 93cxx and 25cxx and it read.But 24cxx not.I tried to put external power.Of course the eeprom was soldered out.The interface is new and never read 24cxx.I tried many 24cxx .Is there a solution for this problem? I read in other forum that need to replaced 74hc125D with 74hc125M 4 pieces. thanks!

745

---

What is HDFS High Availability?

168

---

can any one send me one project on linux ...?

1628

---

hi friends, i would like to write scjp 1.6. anybody have dumps,please send to my mail id :govindarao.bure@gmail.com

1084

---

th point in when will details wil get filled in ER1 2a and 2B?capg

422

---

What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b

336

---

How to write selenium code for purchasing product from amazon

442

---

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

1089

---

What is direct mount and indirect monut?

1256

---

What is meant by ERP? If examples can be given, that would be really helpful...

5839

---