from mitbbs.com.
發(fā)信人: nanomag (笨)
(Fri Jan 12 16:40:55 2007)
1. primary key vs index
2. 1M 7 digit phone numbers, 2MB spare memory, read each number only once
and sort them.
3. you need read a lot of records, you don‘t know how many records here
before you complete it. After you read all those records, you need select
one record randomly.In another words, every record has same chance to be
selected. The memory is limited, that means you cannot store all those
records at one time.
slowsnow (calvin) 于 (Tue May 16 15:01:44 2006) 提到:
剛打完電話(huà)，跟大家分享一下。
1. Find links/urls from one html page using C++, then how do you store those
links that you found.
2. Design a schema for actors and movies database (one actor can be act one or
more movies and one movie has more than one actor). Search name of actor, you
can get a list of movies and search name of movie, you can get a list of
actors. 我數據庫老早以前上過(guò)一門(mén)課，現在全忘光了。:(
3. In a linked list find the nth node from the end of this list.
4. questions about interface and abstract class.
是印度人，口語(yǔ)不錯，人很nice，問(wèn)問(wèn)題的時(shí)候強調要立刻講給他程序中要用到哪些具體
的function, data structure等等。
第一個(gè)問(wèn)題前幾天這里也有人提到過(guò)，是用C，不是C++，除了檢測Anchor Tag還有別的方
法嗎？我想來(lái)想去只想到這個(gè)，但是面試人好像還期待有別的方法的樣子。
本站僅提供存儲服務(wù)，所有內容均由用戶(hù)發(fā)布，如發(fā)現有害或侵權內容，請
點(diǎn)擊舉報。
