Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Iteamic Interview Questions
Questions Answers Views Company eMail

If I bought a cycle before 2days of my birthday and I broke it after 3 days of my birthday the day I broke is Mar2, 1956? Answer following logical questions? i) when is his birthday?

6 18079

Post New Iteamic Interview Questions




Un-Answered Questions

How does job tracker schedule a job for the task tracker?

273


Are you applying for other jobs and if they hire you what would you do?

733


what are micro-cap, small-cap, mid-cap, large-cap companies?

1776


Can we deploy executable jars on android? Which packaging is supported by android?

497


Does constructor creates the object ?

588






Explain url encoding in servlet?

582


What is linux? How is it different from unix?

471


why we use Laravel - Session ?

940


One starts counting from 0 to max and the other stars from max to 0. Which one executes fast.

545


Can word embedding be used in tensorflow? Name two models used in word embedding?

1


suppose i have icici card,i wil go to citi bank atm and drawn some amount...and take the card back..here my que is,can anyone tell me what is the integration scenario happens at that point.(which means transaction happens from card insert into atm,,data send to citi bank ,debit amnt and came back to icici atm.in that what is the integration senario.

1640


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

3257


What is the difference between the participating and non-participating policy? : insurance sales

350


What is dos and its function?

267


How arrow functions are used?

161