Skip to content
Related Articles

Related Articles

Amazon Interview | Set 40 (On-Campus Round 1)
  • Difficulty Level : Easy
  • Last Updated : 17 Jun, 2019

20 Objective type questions (Technical: OS, Java, Networking) and 2 programs. Time given was 90 minutes.

1) Longest Remaining Rime Scheduling

2) Threads

3) subnetmask – classB – 64 departments

4) Match the following

5) On recursion, value of f(513,2)

   return 0;
   return ( n%10 + f(n/10, 2) )

6) Complexity?

f(i) = 2*f(i+1) + 3*f(i+2)
For (int i=0; i < n; i++)
   F[i] = 2*f[i+1] 

7) Frog steps either 1, 2 or 3 steps to go to top. In how many ways it reaches the top?
Based on recursion, options
a) f(i) = f(i+1)+f(i+2)+f(i+3)+1
b) f(i) = f(i-1)+f(i-2)+f(i-3)+1
c) f(i) = f(i+1)+f(i+2)+f(i+3)
d) f(i) = f(i-1)+f(i-2)+f(i-3)

8) Based on java 2 questions, one from Exceptions

9) Preorder is given, we had to find out the postorder

10) Memory management, pa=32bit, la=36bit , frame size=2^12, first page entry, second page entry

11) This question is from GATE CS previous question papers

   for (int i=0; i < n; i++)
   No of child process?

1) Print left view of binary tree

2) Sum of 3 linked list

 Digit..   123------1->2->3------------linkedlist1
 Output: 34924-------3->4->9->2->4 

Sum(linkedlist1, linkedlist2, linkedlist3)
We had to print the linkedlist form of the digit.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :