报个FP# EB23 - 劳工卡
j*x
1 楼
1. Comp. Arch., An app takes 20% transferring data and 80%
time do the computing. What is the maximum possible speedup
if we can find new machine.
2. Given a struct of "employee" sort them according to their
years of joining the company.
3. What is hash table.
4. how to handle collision in a hash table.
5. Given a hash table of 16 buckets, inserting 8 items,
what's the probability that the last element gets no
collision.
6. Design a class for quantum bit. 这个很麻烦，没太听懂这个
quntum bit怎么工作的。。。
最后问了一下要几面，说是要3面
time do the computing. What is the maximum possible speedup
if we can find new machine.
2. Given a struct of "employee" sort them according to their
years of joining the company.
3. What is hash table.
4. how to handle collision in a hash table.
5. Given a hash table of 16 buckets, inserting 8 items,
what's the probability that the last element gets no
collision.
6. Design a class for quantum bit. 这个很麻烦，没太听懂这个
quntum bit怎么工作的。。。
最后问了一下要几面，说是要3面
