amazon placement paper - Total Views 628

Paper Title :  amazon placement paper -




Amazon latest company profile,amazon fresjer jobs engineeris recruitment questions,Amazon latest free sample placement papers, Amazon off and on campus recruitment written test pattern and selection procedure, Amazon 2010,2012,2013 solved placement papers and on line test,amazon technical written test questions and amazon aptitude questions,amazon technical and hr interview procedure,amazon job interview questions,amazon previous years solved papers,amazon alogrithm questions,amazon c,c++ progrmaing questions,amazon networking,dbms,os questions

Amazon Latest Placement Paper Pattern

amazonWritten Test has 2 Sections A, B

In Section A there were 20 Questions:

Technical Questions :15

Aptitude :5

Time Limit :30 min

· Small Answer Type

· Multiple choice

· Aptitude

Amazon Interview questions

1. Write an algorithm to determine if 2 linked lists intersect

2. Find the 2nd-largest node in a binary tree

3. Probably the most difficult question they asked me was, he put a binary tree on the whiteboard and I had to write a function that would find if the tree was symmetrical or not. Anyone who's familiar with data structures and recursion should be fine with this, just don't freak out when they propose the question.

4. Find the element from the array that has odd number of occurences

5. Generate words from a n *n matrix

6. How would you, specifically, build Amazon Web Services?

Amazon internship questions SEPTEMBER @ VIT

Test Format:

1. 25 Objective Questions (45 minutes)

2. 2 Subjective Questions (30 minutes)

Key Areas:

1. C and Data Structures. (Major Emphasis 20 questions)

2. OS/DBMS - one or two questions from them (Generally Queries in SQL).

3. Networking basics (Subnetting etc.) - one or two questions.

They'll be declaring the results the following day or so. Carry a copy of your resume for your written test.

Go through the site of Amazon and read about its products and what it does. This will help you in the PPT they give.

1. There are three cards, first one is coloured blue on both sides, the second is colored red on both sides and the third has one face painted

Red and the other face painted blue. A card is picked at random. If the face visible to the person is red, what is the probability that the other faceis blue?

2. Subjective 1:

Given two sorted arrays A and B of sizes n and m+n,containing n and m elements respectively. Write a routine to merge the array A into B such that B is still sorted. Your code should be in O(1) extra space.

Subjective 2:

Given an array of intergers. Write a program to print all the permutations of the numbers in the array. The output should be sorted in a non-increasing order. For example for the array { 12, 4, 66, 8, 9}, the output should be:

9866412

9866124

9846612

....

....

1246689

What is the running time of your program?

3. There are 6 Resouces to be shared among n Processes. Each process may acquire 2 resource. What is the maximum no. of processes (out of n) so

that a deadlock doesn't occur?

a)3

b)4

c)5

d)6

4. How many times does the following program print "hello world" ?

void foo()

{

fork();

if(fork() || !fork())

printf("Hello World");

}

main()

{

foo();

}

5. Given: Four resources r[1],r[2],r[3],r[4] to be shared among four processes p[1],p[2],p[3],p[4].

If the following code is executed:

for(int i=1;i<=4;i++) {

wait(r[i]); wait(r[i+1] mod 4);

.... /* Isn't it a solution to a famous synchronization problem? Refer silberschatz. */

....

release(r[i+1] mod 4); release(r[i]);

}

The situation is a :

a) no starvation and no deadlock

b) Starvation and a deadlock

c) Starvation but no deadlock

d) no starvation but a deadlock

6. What is the space complexity for the following code?

void fib(n)

{

if(n==1)

return n;

else

return fib(n-1) + fib(n-2);

}

7. How many zeros are there in the factorial of 100?

8. Given two IP addresses: 207.197.2.71 and 207.197.75.13 and their respective subnet masks: 255.255.128.0 and 255.255.192.0.

a) The addresses belong to the same network.

b) The addresses belong to different networks.

c) The addresses are the broadcast addresses of their networks.

d) cannot determine.

9. In the following code of reversing a linked list, fill your code where specified:

node *reverse( node *node)

{

node *m;

if(node==NULL || node->next == NULL)

return node;

else

/* Your code here */

return node;

}

a) m=reverse(node->next->next);

node->next->next=node;

node=NULL;

b) m=reverse(node->next->next->next);

node->next->next=node;

node=NULL;

c) m= node -> next;

node = reverse (m);

node->next = NULL;

d) Something again with node->next->next, i dont remember. ( It was not m=reverse(node->next); m->next=node; )

10. Given two tables: table1(player, ground_name, num_centuries);

table2(ground_name, country);

Write and SQL query for the following:

" Select all the players from table1 who has made a century in every country."

11. What does the following code do?

struct tree {

int val;

node *left;

node *right;

}*node;

int value=0,counter=0;

int doSomething(node *node)

{

if(node->left)

return 1 + doSomething(node->left);

else

counter = counter + value;

if(node->right)

return max(value, 1+doSomething(node->right));

else

counter = counter - value;

return value;

}

a) Finds the number of nodes with only one child.

b) Double the length of the maximum path in the tree.

c) Finds the height of the tree.

d) Finds all the leaf nodes of the tree.

e) Finds the shortest path from the root to a node.

12. A queue is to be implemented using stack, that has an additional operation REVERSE apart from PUSH and POP, that reverses the contents of the

stack. How many operations on the stack are required to perform ENQUEUE and DEQUEUE operations on the queue?

a)1,3

b)3,3

c)3,1

d)1,1

13. int x=2;

void Q(int z)

{

z= z+x;

printf(z);

}

void P(int x)

{

x=x+2;

Q(x);

}

void main()

{

int x=5;

P(x);

}

What is the output of the above program?

Amazon does not stress upon Aptitude questions. So focus on your technical part.

CTC for Amazon: 9.5 lacs/annum.

Duration for internship: 4 Months.

Good Luck !

Some Sample Questions

1.Two tables emp(empid,name,deptid,sal) and dept(deptid,deptname) are there.write a query which displays empname,corresponding deptname also display those employee names who donot belong to any dept.

2.Display the employees whose salary is less than average salary.

3.what is the output of the program
main()
{
int c=5;
printf("%d %d %d",c,c<<2,c>> 2);
}

4.
main()
{
int a[8][10],c=0,i,j;
for(i=0;i<10;
i++) for(j=0;
j<8;j++) a[j][i]=c++;
printf("%d",a[3][6]);
}

5.What is the wrong in this program
main()
{
char *p,*q;
p=(char *)malloc(25);
q=(char*) malloc(25);
strcpy(p,"amazon" );
strcpy(q,"hyd");
strcat(p,q);
printf("%s",p);
}