Issue an internship at NEC China Research Institute

Source: Internet
Author: User

I. Resume delivery: it is very important to find an internship resume. In total, five of them have been submitted, and only three have passed (one has been rejected and one has been rejected ). It is also because I didn't respond after the first two positions, I realized that my job-seeking email may be faulty. Generally, if the other party does not have a clear requirement, it is best not to include attachments (I just made such a mistake ). I sent a cover letter to NEC in total. The first time I had an attachment, I had no message. The second response was received without an attachment.

Ii. process: the other Party sends an interview notification by email and confirmation. Therefore, check the email carefully during the intern application process.

The email will tell you the interview process. I am "Please give a PPT to introduce your study, internship and work experience. Interview for half an hour. After the written test, test the BASIC Program capability, about 1 hour .".

I will go to the interview on the day. The actual process is more than two hours:

Three interviewers interview a person to ask questions based on the situation described in the PPT, focusing on natural language processing-related issues. It is mainly about what you have done in the relevant work and how you understand the relevant knowledge. We recommend that you review the previous projects before the interview.
I personally feel that the focus of the interview is whether you have the scientific research ability, that is, whether you can find out the rules in complicated situations.
In addition, the theoretical knowledge and hands-on capabilities of natural language processing are two important points.
Written test: the written test is quite simple, and the focus is on the interview.
A basic C language question, pointer usage, memory allocation. There are only a few lines of programs.
Several algorithm questions, such as recursive calling and binary search, the most difficult one is binary search (the first question is very simple). Below is a simplified version:
Given a group of numbers, such as 1, 2, 3 ...... 16. specify a number in the sorted order and test whether the number is in this array. If so, specify the number. After four comparisons, we can get the results. If we can compare the results four times, but we must submit a comparison scheme at a time, how can we find this number?
Project question: A crawler implements algorithms and databases are not allowed.
At last, there was another database question. However, according to the interviewer's response, it seems that the question was wrong and I don't know what I was trying to come up.

Iii. Treatment: I didn't talk about treatment at the time, because I pay more attention to two points: Top five hundred enterprises and professional counterparts. If you think the treatment is very important, you can ask the personnel before signing the contract, such a large company generally has clear provisions on intern salaries. The benefits of the NEC research institute should be moderate in their counterparts.

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.