简单题：
1. 内存使用情况
2. 根据内存使用对进行号排序
3. dns 和 cname（多个别名映射到同一个主机的机制）
4. 子网和主机数据计算
问答题
逻辑推导
n个数最小堆的个数
多项选择
跨网站攻击
MVC模式
算法题
子集和的问题，数组中是否存在任意m个数之和等于n（已知条件存在P算法在多项式时间内找到一个子集和等于该子集的补集)
http://cs.stackexchange.com/questions/6111/how-can-i-reduce-subset-sum-to-partition
Let (L,B) be an instance of subset sum, where L is a list (multiset) of numbers, and B is the target sum. Let S=∑L. Let L′ be the list formed by adding S+B,2S−B to L.
(1) If there is a sublist M⊆L summing to B, then L′ can be partitioned into two equal parts: M∪{2S−B} and L?M∪{S+B}. Indeed, the first part sums to B+(2S−B)=2S, and the second to (S−B)+(S+B)=2S.
(2) If L′ can be partitioned into two equal parts P1,P2, then there is a sublist of L summing to B. Indeed, since (S+B)+(2S−B)=3S and each part sums to 2S, the two elements belong to different parts. Without loss of generality, 2S−B∈P1. The rest of the elements in P1 belong to Land sum to B.
应用设计题
根据request，break（广告中断）来投放广告（ad）算法设计与实现
系统估算题目
估算广告日志生成所需要的时间，系统瓶颈，如何改进？