Baidu pen exam e-commerce business department

The subject of the written examination is technical. I voted for a test. Most of the tests are said to be present, and there are also web directions around me.

The questions are as follows:

1. Tree depth-first, breadth-first Traversal Algorithms, and non-Recursive Implementation features.

2. Provide a piece of code to find out where there is an error or security risk and the cause of the error.

3. assume there is a mini computer with 1 kb memory and 1 MHz processor (the status can be changed 10 ^ 6 times per second ). The maximum running time of all programs that can run on the machine and can be terminated at a certain time (without an endless loop. Set other assumptions.

4. There are many components in a large project, and the compilation between components is dependent. For example, you must compile N1 before compiling N2. Design a fast algorithm, complete the compilation process of N> 1000 components, and provide algorithm complexity.

5. code int maxcontinunum (const char * inputstr, char * outputstr) finds the longest consecutive numeric string in the string ending with '\ 0' and returns its length, and assign the numeric string to the memory known to outputstr (database functions such as strlen cannot be used), for example, abc123abcd1234acbde123456789abcdefg, and return 9. The longest numeric string is 123456789.

6. url address like http://www.baidu.com/s? WD = Baidu attributes, including fixed-length attributes (such as the time it was discovered by the system) and indefinite-length attributes (such as its description)
Implement a system
A. store and maintain 10 billion URLs and their attributes
B. add, delete, modify, and delete URLs and their attributes
C. check whether a URL is in the system and provide information
D. Quickly select all URLs under a site
Tip: large data volumes may be stored on multiple computers.

Reprinted from: http://www.e7work.com/2011/0325/393.shtml