【2018-2019】采购英文自我介绍面试-范文模板 (5页)

【2018-2019】采购英文自我介绍面试-范文模板

本文部分内容来自网络整理，本司不为其真实性负责，如有异议或侵权请及时联系，本司将立即删除！

== 本文为word格式，下载后可方便编辑和修改！ ==

采购英文自我介绍面试

在进行公司采购的 面试 时需要做好 自我介绍 ，那么应该如何准备英文的自我介绍呢?下面就和小编一起来看看吧。

采购英文自我介绍面试【一】

I'm glad to introduce myself to you. My Chinese name is Ma Lin, but you can call me Rock, my English name. I chose Rock to be my English name because I want to be as tough as a rock, hehe. I was

born and raised in Guangdong, so I speak both Cantonese and Mandarin. I'll soon graduate from Zhongshan University, majoring in

accounting. I think you may have interviewed quite a lot of students from our school, so you know this major prepares us for CGA and most courses are taught in English. My GPA is 3.6, it ranks number 9 in the 115 students in my grade. And I've passed 15 exams in CGA, I anticipate I will get the CGA qualification in 201X.

Besides having good academic performance, I was actively involved in student activities. I was in charge of Student Welfare (生活委员) in my class, and in the Student union of our school. I enjoyed this position because what I did was very important to everybody, although it was mostly small details.

I had a three-month internship in Guangdong Zhengzhong Accounting Firm. I did the inventory check and helped the accountants to make the auditing reports. My boss was pleased with my performance and he asked me to recommend my classmate to join our team.

KPMG is my dream company. What’s more, I have great interest in joining the Tax Department as my long term career goal is to be a tax consultant. I wish my dream could come true today. Thank you!

采购英文自我介绍面试【二】

【2018-2019】采购英文自我介绍面试-范文模板

I am a third year master major in automation at Shanghai Jiao Tong University, P. R. China. With tremendous interest in Industrial Engineering, I am writing to apply for acceptance into your Ph.D. graduate program. Education background

In 1995, I entered the Nanjing University of Science & Technology (NUST) -- widely considered one of the China’s best engineering schools. During the following undergraduate study, my academic

records kept distinguished among the whole department. I was granted First Class Prize every semester, and my overall GPA(89.5/100) ranked No.1 among 113 students. In 1999, I got the privilege to enter the graduate program waived of the admission test. I selected the Shanghai Jiao Tong University to continue my study for its best

reputation on Combinatorial Optimization and Network Scheduling where my research interest lies.

At the period of my graduate study, my overall GPA(3.77/4.0) ranked top 5% in the department. In the second semester, I became

teacher assistant that is given to talented and matured students only. This year, I won the Acer Scholarship as the one and only candidate in my department, which is the ultimate accolade for distinguished students endowed by my university. Presently, I am preparing my graduation thesis and trying for the honor of Excellent Graduation Thesis. Research experience and academic activity

When a sophomore, I joined the Association of AI Enthusiast and began to narrow down my interest for my future research. In 1997, I participated in simulation tool development for the scheduling system in Prof. Wang’s lab. With the tool of OpenGL and Matlab, I designed a simulation program for transportation scheduling system. It is now widely used by different research groups in NUST. In 1998, I assumed and fulfilled a sewage analysis & dispose project for Nanjing sewage treatment plant. This was my first practice to convert a laboratory idea to a commercial product.

In 1999, I joined the distinguished Professor Yu-Geng Xis

research group aiming at Network flow problem solving and Heuristic algorithm research. Soon I was engaged in the FuDan Gene Database

Design. My duty was to pick up the useful information among different kinds of gene matching format. Through the comparison and analysis for many heuristic algorithms, I introduced an improved evolutionary algorithm -- Multi-population Genetic Algorithm. By dividing a whole population into several sub-populations, this improved algorithm can