SOURCE BITS INTERVIEW PROCESS
it consists of 2 rounds
1. Prelims Round- 30 technical + 30 aptitude questions.
30 technical questions comprises of c , c++ , os questions.
30 aptitude questions are very easy , questions from all areas.
2. Interview round
as it a mobile applications based company, they generally ask questions about OS , JAVA , c++ . they expected some web concepts also. knowledge in game theory , mobile apps, android , codeignitor may be useful. (refer its website)
VERY IMPORTANT : question paper ll be same for all the colleges. so, try to ask your friends in other colleges too.
Wednesday, September 29, 2010
Thursday, September 23, 2010
TREE PROBLEMS
1.write a program to compute the number of nodes in tree.
int size(struct node* node)
{
if(node==NULL)
return (0);
else
return (size(node->left)+1+size(node->right));
}
2.write a program to compute the maximum depth of the tree.
int maxdepth(struct node* node)
{
if(node==NULL)
return (0);
else
{
int left_Depth = maxDepth(node->left);
int right_Depth = maxDepth(node->right);
if(left_Depth>right_depth)
return (left_Depth+1);
else
return (right_Depth+1);
}
}
int size(struct node* node)
{
if(node==NULL)
return (0);
else
return (size(node->left)+1+size(node->right));
}
2.write a program to compute the maximum depth of the tree.
int maxdepth(struct node* node)
{
if(node==NULL)
return (0);
else
{
int left_Depth = maxDepth(node->left);
int right_Depth = maxDepth(node->right);
if(left_Depth>right_depth)
return (left_Depth+1);
else
return (right_Depth+1);
}
}
Sunday, August 22, 2010
Reverse the Linked list
Reversing the linked list.....
void reverse()
{
mynode *p , *q , *r ;
if( head == NULL)
{
return ;
}
p = head ;
q = p -> next ;
p -> next = NULL ;
while( q != NULL )
{
r = q -> next ;
q -> next = p ;
p = q ;
q = r ;
}
head = p;
}
TIME COMPLEXITY : O(n)
void reverse()
{
mynode *p , *q , *r ;
if( head == NULL)
{
return ;
}
p = head ;
q = p -> next ;
p -> next = NULL ;
while( q != NULL )
{
r = q -> next ;
q -> next = p ;
p = q ;
q = r ;
}
head = p;
}
TIME COMPLEXITY : O(n)
Friday, August 20, 2010
DELOITTE INTERVIEW PROCESS
Deloitte , it is a management company so interview process wont be more technical.
FIRST ROUND :
40 aptitude questions, contains
---> problems on numbers
---> data sufficiency questions
---> comprehension questions
---> general maths questions
SECOND ROUND :
students shortlisted from first round are separated into batches. then given a case study to individual batch . they have to discuss and present to the interviewers.
THIRD ROUND :
It is HR + Technical round.
As it is a management company, English fluency is very important !!!
All the best .....
FIRST ROUND :
40 aptitude questions, contains
---> problems on numbers
---> data sufficiency questions
---> comprehension questions
---> general maths questions
SECOND ROUND :
students shortlisted from first round are separated into batches. then given a case study to individual batch . they have to discuss and present to the interviewers.
THIRD ROUND :
It is HR + Technical round.
As it is a management company, English fluency is very important !!!
All the best .....
Thursday, August 19, 2010
AMAZON AND GLOBAL SCHOLAR
AMAZON interview process :
first round : section A : 15 questions (technical aps) , section B : 3 programming questions
three to four technical rounds.
GLOBAL SCHOLAR interview process :
first round : Section A : 10 aptitute (quants) , Section B : 10 aptitude (c++ and Java) , Section C : 5 programming questions.
technical round
HR round
first round : section A : 15 questions (technical aps) , section B : 3 programming questions
three to four technical rounds.
GLOBAL SCHOLAR interview process :
first round : Section A : 10 aptitute (quants) , Section B : 10 aptitude (c++ and Java) , Section C : 5 programming questions.
technical round
HR round
Programming questions asked in Global Scholar
here are the some programming questions...
1. given the linked list with one character at each node.. our work is to find whether the given linked list is palindrome or not ?
2. Given an array .. 1, 2 , 0 , 5 , 8 , 9 , 3 , 6
output:
1,2 //increasing thread
2,0 //decreasing thread
0,5,8,9 //increasing thread
9,3 //decreasing thread
3,6 //increasing thread
3. given a binay tree...
print the elements in the zig-zag order.
eg. ---->1----------------->
<---------2 3<---------------
----->4 5 6 7--------->
8 9<-----------
1. given the linked list with one character at each node.. our work is to find whether the given linked list is palindrome or not ?
2. Given an array .. 1, 2 , 0 , 5 , 8 , 9 , 3 , 6
output:
1,2 //increasing thread
2,0 //decreasing thread
0,5,8,9 //increasing thread
9,3 //decreasing thread
3,6 //increasing thread
3. given a binay tree...
print the elements in the zig-zag order.
eg. ---->1----------------->
<---------2 3<---------------
----->4 5 6 7--------->
8 9<-----------
Subscribe to:
Posts (Atom)