微软、IBM、宝洁、普华等笔试
后拿者赢
2 有1000 个表，每个表有若干个item，每个item 形式为（x,y)，寻找这些表中overlapped 的
item
3 用一串节点存放N 个数据，每个节点可放k 个数据，其中包含额外的b 个数据，问k 为多少
最能节省存储空间（假设N/(k‐b)mod1=1/2）
4 一个链表排序程序，补足其中一些丢失的语句（排序中不用额外的存储空间）
5 一篇英文，将打乱的各段排序并写个总结，大意是吹嘘SAP 如何的好
6 两个仓库的进货，出货和仓库间的货物转移交易的流水帐，写出每次交易的货物数，单价，交
易后仓库中的货物数和amount(货物数*单价）
题目B
1.Jeff and Diamond like playing game of coins,One day theydesigned a new set of rules:
1)Totally 10 coins
2)One can take away 1,2or 4 coins at one time by turns
3)Who takes the last loses.
Given these rules Whether the winning status is pre‐determined or not
解答：
1：从后面开始考虑，最后肯定要留1 个才能保证自己赢
2：所以要设法让对方留下2，3，5 个
3：也就是要自己取后留下1，4，6，7，8，9。。。
4：如果自己取后留下6，对方取2 个，与（3）矛盾，所以排除6
5：如果自己取后留下8，对方取4 个，与（3）一样情况，所以也排除8
6：同样，9 也不行，如果我抽后剩下9，对方抽2 个，就反过来成对方抽剩成7 个了，也与（3）矛盾，所以也排除
www.77xue.com哦
7：所以很显然，我只能抽剩1，4，7
8：因为只能抽后剩1，4，7 才能赢，我先抽得话不可能达到这几个数，很显然，只能让对方先
抽，也即是先抽的人输
2. The UI specialist Dafna found a problem that some of the Items on the marketing
document form overlapped with each other. Because this form was implemented by different
developers and they didnʹt care the particular appearance of one item. Product manager
Tidav decided to write one small checking tool to generate the overlapped items on all forms.
He called in his guys to discuss about it. Suppose the input is the integer coordinates (x,y)od
the items (all rectangles) on one form. Construct an efficient method to find out the
overlapped items. Hint: The most direct way to do so is comparing each items with the others,
Given 1000 forms. Each with 100‐1000items on average. The O(n2) algorithm is costly.Some
guru suggested that one O(n) method could help only if 6.5 kilobytes extra storage is
available. One elite argued that he could cut down the number to 1%,Itʹs now your turn to
describe the idea. Write out the pseudocodes, vertify his algorithm and propose more
advanced optimization if possible.
3 in a file system ,data need not be sequentially located in physical blocks, We use a number
of tables storing nodes imformation. Suppose now we use a fixed node size of variable‐length
n, it takes [n/(k‐b)] nodes to store this item.(Here b is a constant, signifying that b words of
each node contain control information, such as a link to the next node).If the average length n
of an Item is N,what choise of k minimizes the average amount of storage space required?
(Assume that the average value of (n/(k‐b)) mod 1 is equal to 1/2 ,for any fixed k, as n varies)
10. Goldman Sachs
两个公司A,B 的股票分别在伦敦纽约交易，市值分别为10 亿英镑，18 亿美元一年内的利润分别
- 上一篇：国开总行笔试题
《微软、IBM、宝洁、普华等笔试》相关文章
- 微软、IBM、宝洁、普华等笔试
- › 微软、IBM、宝洁、普华等笔试
- › 微软、IBM、惠普三巨头招聘攻略
- 在百度中搜索相关文章：微软、IBM、宝洁、普华等笔试
- 在谷歌中搜索相关文章：微软、IBM、宝洁、普华等笔试
- 在soso中搜索相关文章：微软、IBM、宝洁、普华等笔试
- 在搜狗中搜索相关文章：微软、IBM、宝洁、普华等笔试
