Showing posts with label Placement Papers. Show all posts
Showing posts with label Placement Papers. Show all posts
Tuesday, July 8, 2014
Akamai Placement Papers
Akamai delivers a place where great minds can get inside the Internet. Akamai has built a world class business by hiring some of the world's brightest and most talented individuals, then giving them the room and support to continue learning and growing. It's a place where people who've excelled in the academic world can put their skills to the test solving large-scale real world problems.
Akamai hires students with Bachelor's degrees, Master's degrees, and PhD's. Akamai works hard to form relationships with world-renowned colleges and universities in order to recruit the best talent in the business.
College Recruiting and Internships:
Akamai recruits through campus placements and when you join Akamai, you join a company that functions as a team, committed to excellence in delivering world-class business solutions to its clients. Akamai also provides internship opportunities to students.
About the Recruitment test:
The interview procedure of Akamai consists of following 3 rounds:
1) Written Test
2) Technical Interview
3) HR Interview
Akamai hires students with Bachelor's degrees, Master's degrees, and PhD's. Akamai works hard to form relationships with world-renowned colleges and universities in order to recruit the best talent in the business.
College Recruiting and Internships:
Akamai recruits through campus placements and when you join Akamai, you join a company that functions as a team, committed to excellence in delivering world-class business solutions to its clients. Akamai also provides internship opportunities to students.
About the Recruitment test:
The interview procedure of Akamai consists of following 3 rounds:
1) Written Test
2) Technical Interview
3) HR Interview
Download Agreeya Placement Papers
Selection Procedure:
90mins Written Test Aptitude
60mins Written Test Technical (C/C++)
HR and Technical Interview
Q1 What is the probability to get tail, at least once when 6 coins are tossed simultaneously. 63/64.
Q2. Five frnds can sit in 120 ways, how many arrangements are possible if mohan has to sit in the middle.
Q3. One question related to Relationships..
One from Direction sense Test (ans south.)
RTTI stands for......
How persistent objects are implemented in C++ (ans files)
Q int * const ptr
a) *ptr++ is legal
b)
c) both r illegal
d) none
Q what concept is implemented in Cout and Cin? Ans Opertor overloading.
There were 4-5 more questions from probability.
Some questions from mensuration. Formulas were given.
In a right angled triangle, 2 sides were given of 3 and 5 cm, we were supposed to find out the area of the inner circle inscribed inside the triangle.
Q. Member Function can be
a) are always public
b) are always private
c) can be any one of them.
Q which condition is safest to use with any data type
a) if(x!=0)
b) if(x==0)
c)if(!x) ans
Q Can we perform addition operation on two pointers?
Q There was one question from time and work. A,B,C worked together, A can do the work in 12 days, B can do in 9 days. Profit earned was divided in the ratio 4:3:2. C can do the work in how many days? Figures might not be the same
Q List of nos were given.. n they were sorted in 4 iterations
11 21 55 65 41 31
11 21 55 65 31 41
11 21 55 65 31 41
11 21 31 41 55 65
A Merge sort (ans)
B Selection sort
C insertion sort
D quick sort
Sry frnds, I can jst recall these questions.. Aptitude paper was easy but tech was quite difficult. But time to solve these question is more than enough..
90mins Written Test Aptitude
60mins Written Test Technical (C/C++)
HR and Technical Interview
Q1 What is the probability to get tail, at least once when 6 coins are tossed simultaneously. 63/64.
Q2. Five frnds can sit in 120 ways, how many arrangements are possible if mohan has to sit in the middle.
Q3. One question related to Relationships..
One from Direction sense Test (ans south.)
RTTI stands for......
How persistent objects are implemented in C++ (ans files)
Q int * const ptr
a) *ptr++ is legal
b)
c) both r illegal
d) none
Q what concept is implemented in Cout and Cin? Ans Opertor overloading.
There were 4-5 more questions from probability.
Some questions from mensuration. Formulas were given.
In a right angled triangle, 2 sides were given of 3 and 5 cm, we were supposed to find out the area of the inner circle inscribed inside the triangle.
Q. Member Function can be
a) are always public
b) are always private
c) can be any one of them.
Q which condition is safest to use with any data type
a) if(x!=0)
b) if(x==0)
c)if(!x) ans
Q Can we perform addition operation on two pointers?
Q There was one question from time and work. A,B,C worked together, A can do the work in 12 days, B can do in 9 days. Profit earned was divided in the ratio 4:3:2. C can do the work in how many days? Figures might not be the same
Q List of nos were given.. n they were sorted in 4 iterations
11 21 55 65 41 31
11 21 55 65 31 41
11 21 55 65 31 41
11 21 31 41 55 65
A Merge sort (ans)
B Selection sort
C insertion sort
D quick sort
Sry frnds, I can jst recall these questions.. Aptitude paper was easy but tech was quite difficult. But time to solve these question is more than enough..
Download ADP Placement Papers
Aptitude_Questions_With_Answers_for_Time1 (71367)
(Aptitude)
(Aptitude)
(Aptitude)
(Aptitude)
It has totally 40 questions. time 20 minutes.
10 questions -analogies
10 questions-fill up the blanks
(u have to study barrons GRE to be able to answer these questions. CAT students can do well i guess.)
remaining 20 questions from maths aptitude.......study R.S.Agarwal thoroughly...most of the them are profit-loss, percentages, time-distance/ work and numbers.
Section B:
20 questions to answer in 30 minutes.
All question are based on C programming...the questions are something like find the output of the program, compilation errors, find which line of the given program has an error. u ought to be thorough with data structures in C to answer them will not find simple C programming questions be thorough with data structures using C.
Section C:
A long C program which is about 2-1/2 pages long and it has only 5 questions to answer in 10 minutes.......i didn't understand half of the program...it had many function calls...
Section D:
Duration 10 minutes....
An essay of 100 words has to be written on the given topic. first the given topic was "My few favourite things" then they changed the topic to "Same as the last".........God knows what is the meaning of the topic.....the entire class had dumb face when they heard the topic title.....and i am sure most of them actually screwed here..
Download Adobe Systems Placement Papers
(Aptitude)
(Aptitude)
(Aptitude)
(Aptitude)
Most of the problems in Adobe are solved here, though it is not mentioned that they are from Adobe, so this means he has to go through them as many as possible
The C/Java/quant are from bestsamplequestions.com
The questions are mostly (99%) theoretical, or algo type
If he is fresher then there will also be an apti n quant paper. Otherwiser only two papers
Engineering - based on college courses
C/Java - whatever opt for - this too is theoretical
Questions like
what is transient variable
what is finally
what is the significance of package
were asked.
A few of the question that were asked to me are
A BST was given, find the fourth largest node
Evalutae the psotfix expression
Evalutae (-5) in 2's complement
An expression was given, we had to make the expression tree for that
and the postfix expression for that. It was something like
a* ((b+c/d) *d) +e
You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other
Soln : - Breadth First Search(I guess)
Some code in assembly was given and given five options. What is being calculated?
Ans (XY) 2 + Y + Z
Some commands in the assembly language were given. Then need to convert this code in assembly
Commands were like
Add- Adds top 2 elemnrts from stack and pushes the result back in to it
Sub
and others
The code is
A=300;
For (i=0 ; i<=10 ; i++)
A=A+200;
Algorithm to draw a line in a 2-D axes.
Given P1(x1,y1), P2(x2,y2) where x1>x2.
My Soln: find the slope m and intercept c, using standard formulae
Increment x2 by 1(this was given) and calculate y2'
and join the dots
Easy though
write an algorithm, to find if two binary trees are same
The C/Java/quant are from bestsamplequestions.com
The questions are mostly (99%) theoretical, or algo type
If he is fresher then there will also be an apti n quant paper. Otherwiser only two papers
Engineering - based on college courses
C/Java - whatever opt for - this too is theoretical
Questions like
what is transient variable
what is finally
what is the significance of package
were asked.
A few of the question that were asked to me are
A BST was given, find the fourth largest node
Evalutae the psotfix expression
Evalutae (-5) in 2's complement
An expression was given, we had to make the expression tree for that
and the postfix expression for that. It was something like
a* ((b+c/d) *d) +e
You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other
Soln : - Breadth First Search(I guess)
Some code in assembly was given and given five options. What is being calculated?
Ans (XY) 2 + Y + Z
Some commands in the assembly language were given. Then need to convert this code in assembly
Commands were like
Add- Adds top 2 elemnrts from stack and pushes the result back in to it
Sub
and others
The code is
A=300;
For (i=0 ; i<=10 ; i++)
A=A+200;
Algorithm to draw a line in a 2-D axes.
Given P1(x1,y1), P2(x2,y2) where x1>x2.
My Soln: find the slope m and intercept c, using standard formulae
Increment x2 by 1(this was given) and calculate y2'
and join the dots
Easy though
write an algorithm, to find if two binary trees are same
ADITI TECHNOLOGIES TECHNICAL PLACEMENT PAPER
(Aptitude)
(Aptitude)
(Aptitude)
(Aptitude)
COMPUTER AWARENESS :
NOTE: The questions are of multiple choice format in the paper
1. What is the number of functions of a three variable Boolean function?
2. Which is the most commonly used replacement algorithm?
Ans. LRU
3. Which memory management technique involves dividing the memory into fixed sized blocks?
Ans. Paging
4. What is video resolution?
5. The processing speed of a microprocessor depends on _____?
Ans. data bus width
C TEST :
NOTE: The questions are of multiple choice format in the paper
1. What is the output of the program given below
#include<stdio.h>
main()
{
char i=0;
for(;i>=0;i++) ;
printf("%d
",i);
}
2. What is the output of the following program
#include<stdio.h>
main()
{
int i=0;
fork();
printf("%d",i++);
fork();
printf("%d",i++);
fork();
wait();
}
3. What is the memory allocated by the following definition ?
int (*x)[10];
4. What is the memory allocated by the following definition ?
int (*x)();
5. In the following program segment
#include<stdio.h>
main()
{
int a=2;
int b=9;
int c=1;
while(b)
{
if(odd(b))
c=c*a;
a=a*a;
b=b/2;
}
printf("%d
",c);
}
How many times is c=c*a calculated?
6. In the program segment in question 5 what is the value of a at the end of the while loop?http://Friends
7. What is the output for the program given below
type def enum grade{GOOD,BAD,WORST,}BAD;
main()
{
BAD g1;
g1=1;
printf("%d",g1);
}
8. Give the output for the following program.
#define STYLE1 char
main()
{
typedef char STYLE2;
STYLE1 x;
STYLE2 y;
clrscr();
x=255;
y=255;
printf("%d %d
",x,y);
}
9. Give the output for the following program segment.
#ifdef TRUE
int I=0;
#endif
main()
{
int j=0;
printf("%d %d
",i,j);
}
10. In the following program
#include<stdio.h>
main()
{
char *pDestn,*pSource="I Love You Daddy";
pDestn=malloc(strlen(pSource));
strcpy(pDestn,pSource);
printf("%s",pDestn);
free(pDestn);
}
(a)Free() fails
(b)Strcpy() fails
(c)prints I love You Daddy
(d)error
11. What is the output for the following program
#include<stdio.h>
main()
{
char a[5][5],flag;
a[0][0]='A';
flag=((a==*a)&&(*a==a[0]));
printf("%d
",flag);
}
Subscribe to:
Posts (Atom)