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

Ernst Young Interview Questions
Questions Answers Views Company eMail

Why did you choose our firm rather than other firms?

1907

Did you apply for any other big 3 companies?

1777

What sort of image do you have?

1885

Why would you be an asset to the company?

2026

Describe a situation where you had to work in a group ?

1692

What do you know about Ernst & Young ?

2230

What do you think you will be doing in your first year with us?

1858

What is the motivation to join as an auditor @ Ernst and Young ?

2748

How has accountancy changed over the last ten years?

4 12136

Are you satisfied with your academic achievements?

3235

What motivates you?

5 7907

Why do you want to join audit?

2604

Do you need to be an expert at something in order to lead a team?

6587

Do you believe in talent or hard work ?

4413

How do you manage risk ?

1 2402

Post New Ernst Young Interview Questions




Un-Answered Questions

Cost Accounting

1677


How can we identify the resources for which the sessions are waiting?

1


Is google an android phone?

522


How to count duplicated values in a column in oracle?

554


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

3259






What is clr? Difference between clr & cts?

694


What are the Development tools?

5


What is full join in sql?

526


What is aspx used for?

515


Hi, i am looking for join learn real time project on dotnet please tell me which is the best institute now i am staying in a ameerpet. thank u for advance.

1048


How is modularity introduced in C++?

772


What is the importance of having a selection bias?

104


What is hot add cpu in sql server 2008?

526


Can i know some of the Realtime tickets that anyone has been faced ?

1667


Explain entity type?

633