201,100 Degree Data mining engineer intern test face test

201,100 Degree Data mining engineer intern test face testContributor/Author: Network reprint date: 2012-04-30 11:48:45 submission to CHINAKDD

Written questions:
One, Jane answer 30 points
1. The function of extern "C" {} is good for application scene;
2. Write the two familiar design patterns, and the application scene, you can give pseudo code;
3.TCP Time_wait is the state, and the application of the scene, as well as the advantages and disadvantages;

Two, algorithm problem 40 points
1. There is a task executing machine, the number of tasks n<1000, the machine can only perform one task at a time, and the task has dependencies,
However, there is no cyclic dependency between tasks, please give the appropriate order of task execution. Algorithm, pseudo code, and analyze its time complexity and
The complexity of the space.

2. Write a function to count the number of complete sentences in a paragraph of English text, which includes only uppercase and lowercase letters, spaces, dots (.), commas (,).
The complete sentence must contain at least one letter and end with a point number.
Requirements: Complete code, achieve goal, efficient, concise;

Third, system architecture 30 points
There is a monitoring system, a large number of data records include {URL, user access IP, time}, to the monitoring system maintenance, and provide inquiries.
Design a can store and maintain 100 billion records, real-time monitoring, and support two kinds of queries:
1. Specify any time period (accurate to minutes) and a URL to investigate the total amount of access to all URLs in this time period.
2. Specify any one time period (accurate to minutes) and an IP, query the total amount of IP access in this time period.

Interview A
1. Introduce yourself and simply introduce yourself with your resume.
2. Introduction to the project, combining the main projects with their own, as well as with the project presentation materials, interactive to explain the relationship between the interviewer is machine learning related issues.
3. Algorithm problem; non-recursive implementation of binary tree sequence traversal;
4. Algorithm design questions, how to remove duplicate pages;

Interview two
1. Self-Introduction (IBID.)
2. Project Description (IBID.)
3. Algorithm question; asked for a ttest;
4. Algorithm design questions; how to classify query; interview three

1. Self-introduction;

2. Project introduction;

3 algorithm question two ways;

1> a string of beads (m), there are n colors (n "=10"), design an algorithm, take out a paragraph, the request contains all n in color, and make the shortest length. And analyze the time complexity and space complexity.

2> from 1 to 100 million, all appearing numbers and (125=1 2 5), manual computers come out;