Amazon Interview Report
- 1of 0 votes
AnswerTell me the algorithm for fibonacci series? (When i said there are two - recursive (time effcient) and iterative (otherwise)) Explain the recursive one? What is the time complexity? Why is it O(log n)?
- g.usask August 16, 2008| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Terminology & Trivia - 0of 0 votes
AnswersWhat does the "Static" keyword do? Do you know any other similar keywords? What are they?
- g.usask August 25, 2008| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Java - 0of 0 votes
AnswersWhat is the difference between Final, Finally, and Finalize?
- g.usask August 25, 2008| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Java Terminology & Trivia - 0of 0 votes
AnswersSay you are using a map in your program, how would you count the number of times the program use put() and the get() function? How would you do that if its using multiple maps in the program? How would you do that if the map is sent as a parameter in a method? How would you do it if the multiple maps are passed into the methods (as parameters), and are use differently? (it went on forever....)
- g.usask August 25, 2008| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Java Terminology & Trivia
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.