AMAZON
Company Description
Amazon.com, Inc. , often referred to as simply Amazon, is an American electronic commerce and cloud computing company with headquarters in Seattle, Washington. It is the largest Internet-based retailer in the United States. Amazon.com started as an online bookstore, later diversifying to sell DVDs, Blu-rays, CDs, video downloads/streaming, MP3 downloads/streaming, audiobook downloads/streaming, software, video games, electronics, apparel, furniture, food, toys and jewelry. The company also produces consumer electronics—notably, Amazon Kindle e-book readers, Fire tablets, Fire TV and Fire Phone—and is the world's largest provider of cloud infrastructure services (IaaS).Amazon also sells certain low-end products like USB cables under its in-house brand AmazonBasics.
Job Profile
Software Engineer
Year Package CPI cutoff Eligible Branches Students Selected
2012-16 29.96lpa(B.Tech) 5.0 CSE,IT,ECE 2(1 B.Tech ECE)
Amazon.com, Inc. , often referred to as simply Amazon, is an American electronic commerce and cloud computing company with headquarters in Seattle, Washington. It is the largest Internet-based retailer in the United States. Amazon.com started as an online bookstore, later diversifying to sell DVDs, Blu-rays, CDs, video downloads/streaming, MP3 downloads/streaming, audiobook downloads/streaming, software, video games, electronics, apparel, furniture, food, toys and jewelry. The company also produces consumer electronics—notably, Amazon Kindle e-book readers, Fire tablets, Fire TV and Fire Phone—and is the world's largest provider of cloud infrastructure services (IaaS).Amazon also sells certain low-end products like USB cables under its in-house brand AmazonBasics.
Job Profile
Software Engineer
Year Package CPI cutoff Eligible Branches Students Selected
2012-16 29.96lpa(B.Tech) 5.0 CSE,IT,ECE 2(1 B.Tech ECE)
Feedback
2016 Batch
Selection Procedure by Shubham Luthra:
1 Written Round + 4 Technical Interview.
1) Written Round 20 objective questions related to DS and OS + 2 coding questions.
Objective questions were mostly easy. There were questions related to arrays , trees, linked lists and graphs. OS questions were mostly related to memory management. Coding questions were easy. One was to find whether a given sequence of parenthesis was balanced or not. Second question was to print the left side view of a binary tree(http://www.geeksforgeeks.org/print-left-view-binary-tree/).
2) 1st Technical Interview
Ques 1)- Maximum of all subarrays of size k( http://www.geeksforgeeks.org/maximum-of-all-subarrays-of-size-k/).
Ques 2)- Find whether a given binary tree is subtree of another given binary tree or no. He asked me to write a full running code for that
(http://www.geeksforgeeks.org/check-if-a-binary-tree-is-subtree-of-another-binary-tree/)
(http://www.geeksforgeeks.org/check-binary-tree-subtree-another-binary-tree-set-2/)
Ques 3)-Find whether a given binary tree is a BST or not.
(http://www.geeksforgeeks.org/a-program-to-check-if-a-binary-tree-is-bst-or-not/)
For all three above questions he asked me multiple solutions.
3) 2nd Technical Interview
This interview was totally based on linked lists.He first asked me some theory about linked lists and then 2 coding questions.
1)Add 2 numbers represented in the form of linked lists.Write full running code.( http://www.geeksforgeeks.org/sum-of-two-linked-lists/)
2)- Find middle of a stack in O(1). The idea is to use a doubly linked list to represent the stack.
(http://www.geeksforgeeks.org/design-a-stack-with-find-middle-operation/)
4) 3rd Technical Interview
This was the longest round .He asked me questions related to DS, OS, networking and OOPS.
Some questions that I remember are-
-What are threads. Difference between threads and processes on the basis of context switching.
- What is a singleton class. Implement a singleton class.
-Write a code for moving a segment of data from one memory location to another.
-Function of network and transport layer in OSI model.
-He asked me to implement a function that I haven’t heard of so he explained me the functionality and asked me to implement that. The algorithm was basically topological sorting of graph. He then asked me to write a full running code of that.
There were 2-3 more questions that I don’t remember. He asked me a question of DBMS but I told him that I haven’t studied DBMS , I just know to write some basic queries .He was OK with that as I didn’t have it as a course and didn’t asked me further questions on DBMS.
5) 4th Technical Interview-
This was the shortest of all the four rounds and lasted for about 20 minutes. The interviewer started with the question “tell me about yourself” and then he asked me why software why not core. Then there was a brief discussion about my projects for like 15 minutes.Overall there main focus was on coding skills. Only knowing the algorithms won’t work, you should know how to write a full running code.
2016 Batch
Selection Procedure by Shubham Luthra:
1 Written Round + 4 Technical Interview.
1) Written Round 20 objective questions related to DS and OS + 2 coding questions.
Objective questions were mostly easy. There were questions related to arrays , trees, linked lists and graphs. OS questions were mostly related to memory management. Coding questions were easy. One was to find whether a given sequence of parenthesis was balanced or not. Second question was to print the left side view of a binary tree(http://www.geeksforgeeks.org/print-left-view-binary-tree/).
2) 1st Technical Interview
Ques 1)- Maximum of all subarrays of size k( http://www.geeksforgeeks.org/maximum-of-all-subarrays-of-size-k/).
Ques 2)- Find whether a given binary tree is subtree of another given binary tree or no. He asked me to write a full running code for that
(http://www.geeksforgeeks.org/check-if-a-binary-tree-is-subtree-of-another-binary-tree/)
(http://www.geeksforgeeks.org/check-binary-tree-subtree-another-binary-tree-set-2/)
Ques 3)-Find whether a given binary tree is a BST or not.
(http://www.geeksforgeeks.org/a-program-to-check-if-a-binary-tree-is-bst-or-not/)
For all three above questions he asked me multiple solutions.
3) 2nd Technical Interview
This interview was totally based on linked lists.He first asked me some theory about linked lists and then 2 coding questions.
1)Add 2 numbers represented in the form of linked lists.Write full running code.( http://www.geeksforgeeks.org/sum-of-two-linked-lists/)
2)- Find middle of a stack in O(1). The idea is to use a doubly linked list to represent the stack.
(http://www.geeksforgeeks.org/design-a-stack-with-find-middle-operation/)
4) 3rd Technical Interview
This was the longest round .He asked me questions related to DS, OS, networking and OOPS.
Some questions that I remember are-
-What are threads. Difference between threads and processes on the basis of context switching.
- What is a singleton class. Implement a singleton class.
-Write a code for moving a segment of data from one memory location to another.
-Function of network and transport layer in OSI model.
-He asked me to implement a function that I haven’t heard of so he explained me the functionality and asked me to implement that. The algorithm was basically topological sorting of graph. He then asked me to write a full running code of that.
There were 2-3 more questions that I don’t remember. He asked me a question of DBMS but I told him that I haven’t studied DBMS , I just know to write some basic queries .He was OK with that as I didn’t have it as a course and didn’t asked me further questions on DBMS.
5) 4th Technical Interview-
This was the shortest of all the four rounds and lasted for about 20 minutes. The interviewer started with the question “tell me about yourself” and then he asked me why software why not core. Then there was a brief discussion about my projects for like 15 minutes.Overall there main focus was on coding skills. Only knowing the algorithms won’t work, you should know how to write a full running code.
