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

CBSE Zoology Interview Questions
Questions Answers Views Company eMail

Is Human Egg Alecithal or Microlecithal?

8 23917

Post New CBSE Zoology Interview Questions






Un-Answered Questions

Why do we use trees in data structures?

67


How do you end a program?

64


WHAT ARE THE DIFFICULT ELEMENT OFF JOB

1027


Explain About stateless and state full web service

108


You are a project manager working on contract. You’ve performed earned value analysis and discovered that the project will be completed on time and under the original estimated amount. This means the profit to your company will decrease as will your personal bonus. Which of the following should you do? A. Add activities to the project to increase the cost enough to meet the original estimated amount. B. Tell the customer you're adding additional requirements to the project chat were originally cut because of cost constraints. C. Inform the customer that the project is completed and has come in under budget. D. Bill the customer for the full amount of the contract as this was the original agreed-upon price.

103






Explain when do we go for dynamic picklist and for pick applet?

61


In gridview in editmode if we want to display information in one combobox based on

1377


What are the features of complex mapping?

90


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

2083


Compare java and python.

90


What are the different branches of accounting?

99


What is advantage and disadvantage of linked list?

39


afe or not

1117


Explain the software instruction ei and di?

110


Name the as3 components?

63