Amazon Interview Question for Analysts






Comment hidden because of low score. Click to expand.
1
of 1 vote

A quick answer to the definition:

A hash table that grows dynamically to handle more items. The associated hash function must change as the table grows. Some schemes may shrink the table to save space when items are deleted.

- Kunzi July 27, 2009 | Flag Reply
Comment hidden because of low score. Click to expand.
1
of 1 vote

Dynamic Hashing is neither Open Addressing nor Distributed Hashing. It is kind of Extendible Hashing. Hash function will return a 120 bit value. You will use least number of bits for maping. Like if you have two entries, One bit is Ok. If four entries, you need to use two bits from 120 bits, Similarly for 8 entries 3 bits will be used, blah , blah. It grows dynamically. When we have huge records in database, we use it.

- anonymous March 19, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

it is advance version of hashing which provide more suitable address space according to the given (key) value..

- Anonymous June 21, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

Why does one need help with this? This one is easy to lookup on the web.

- LOLer July 14, 2009 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Questions posted here are not merely to seek help, but also to help others.

- Erik July 24, 2009 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

you fucking idiot moron!

- LoLer December 25, 2009 | Flag
Comment hidden because of low score. Click to expand.
-1
of 1 vote

This would be a tough question to answer, given that we need to write code. Lot of cases to be handled.

- Anonymous February 16, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

open addressing is dynamic hashing may be

- UW November 15, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

open addressing is dynamic hashing may be

- UW November 15, 2010 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More