For example, you could use this table to quickly compute that a bit vector mapping every 32-bit inte
a boolean value could fit in memory on a typical machine. There are 2 32 such integers. Because each in
akes one bit in this bit vector we need 32 bits (or 29 bytes) to store this mapping. That's about halfa
byte of memory, which can be easily held in memory on a typical machine
lf you are doing a phone screen with a web-based company, it may be useful to have this table in
Exact Value (X)
128
256
1024
65,536
1,048,576 1 million
1,073,741,824 I billion
4,294,967,296
1,099,511,627,776 1 trillion
Approx. Value
XBytes into MB,
GB, etc.
or each of
he space and time complexity.
acticing implementing the data structures and algorithm (on paper, and then on a computer) is
reat exercise. It will help you learn how the internals of the data structures work, which is importa
nany interviews
ese
table below is useful for many questions involving scalability or any sort of memory limitation. Me
Did you miss that paragraph above? It's important. If you don't feel very, very comfortable wit
each of the data structures and algorithms listed, practice implementing them from scratch.
7
Power of 2
this table isn't strictly required, but it can be useful. You should at least be comfortable deriving
s of 2 Table
ata structure.
articular, hash tables are an extremely important topic. Make sure you are very comfortable with
No comments:
Post a Comment