Hunting New Job Preparation

In 2014, I need to change my role from a SDET into Dev or to be a better SDET. Current job and work environment cannot provide enough passion to continue. The ideal work environment for me is where I can develop software or do automation with colleagues, and we are a team we can cooperate not work alone. In order to achieve this dream I have a lot things to do.  Following are technology and habit I need to change and study from now on:

 English

 1. Go through documents before working at Microsoft.

 2. Read and Listen more English materials.

 3. Write articles to recode learn process by English.

Develop Technology

 1. Read Technology Books and articles by experts.

 2. Go through Framework Code and documents seriously.

 3. Write more code as possible as I can. Analyses others good code.

 4. More discussion with others to expand technology view and mind.

 5. Learn develop software basic knowledge including Language, Database, Data structure, Design mode and so on.

Testing Technology

 1. Review Testing concept and knowledge including term, Framework, Tools and Testing platform.

 2. Go through one note recoded before at Microsoft.

 3. Read excellent testing code and framework.

 4. Try to use automation testing tools and IDE to learn new testing technology.

Framework

 1. Learn more about Testing technology framework such as automation testing framework: XACC, Coded UI, Mita, UIA and so on.

 2. Lean more about developing Framework such as how to handle Data including ADO, Entity Framework, MSAA, Linq, NHibernate and so on.

 3. Software develop framework including MVC, MVVM and so on.

Interview Skills

 1. Read interview skills book and articles from forum and blogs.

 2. Self-examination such as technology, work attitude, self-advantage and disadvantage.

 3. Prepare interview materials including  resume(both EN and CN), company introduction, and matters needing attention.

This article was wroten in 2014.2.15, now one and half an year passed by. Read this article again, it makes me relized that I have not draw up new plan to learn to improve myself.
And for my new job, I found I didn‘t like it either. But I should not give up to learn from my current job and hunting new job. Every one have difficult time on job and they should not via change job to void and solve problems. So it‘s time to consider how to resolve my current problem to improve my English communication and improve my learning initiative.

时间: 2024-10-17 14:23:01

Hunting New Job Preparation的相关文章

ZOJ 3959: Problem Preparation

Problem Preparation ///@author Sycamore, ZJNU ///@date 4/22/2017 #include <iostream> #include <sstream> #include <iomanip> #include <cmath> #include <string> #include <algorithm> #include <numeric> #include <fu

HDU3236 Gift Hunting

1 /* 2 HDU3236 Gift Hunting 3 http://acm.hdu.edu.cn/showproblem.php?pid=3236 4 dp 滚动数组 5 * 6 * 7 */ 8 #include <cstdio> 9 #include <algorithm> 10 using namespace std; 11 const int Nmax=305; 12 const int INF=1e9; 13 int dp[2][505][55][2]; 14 in

10 tools and platforms for data preparation

10 tools and platforms for data preparation Traditional approaches to enterprise reporting, analysis and Business Intelligence such as Data Warehousing, upfront modelling and ETL have given way to new, more agile tools and ideas. Within this landscap

Treasure Hunting (hdu 3468 二分匹配+bfs最短路径)

Treasure Hunting Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 1509    Accepted Submission(s): 393 Problem Description Do you like treasure hunting? Today, with one of his friend, iSea is on

Thesis - Preparation

1. Choose a topic. 2. Decide what to develop. 3. Check feasibility of your idea, including the tools, time, etc. 4. If feasible, write a project proposal (Mainly about what you are going to do). Thesis - Preparation,布布扣,bubuko.com

HDU 3468 Treasure Hunting(BFS+网络流之最大流)

题目地址:HDU 3468 这道题的关键在于能想到用网络流.然后还要想到用bfs来标记最短路中的点. 首先标记方法是,对每一个集合点跑一次bfs,记录所有点到该点的最短距离.然后对于任意一对起始点来说,只要这个点到起点的最短距离+该点到终点的最短距离==起点到终点的最短距离,就说明这点在某条从起点到终点的最短路上. 然后以集合点建X集,宝物点建Y集构造二分图,将从某集合点出发的最短路中经过宝物点与该集合点连边.剩下的用二分匹配算法或最大流算法都可以.(为什么我的最大流比二分匹配跑的还要快....

Account Hunting for Invoke-TokenManipulation 伪造token前的账号猎取

source: https://www.trustedsec.com/january-2015/account-hunting-invoke-tokenmanipulation/ I've been searching quite a while now for the best way to search for domain admin tokens, once admin rights are attained on a large number of systems during a p

HDU 3468 Treasure Hunting (最大流SAP)经典(看似广搜实则最大流)

Treasure Hunting Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 1532    Accepted Submission(s): 400 Problem Description Do you like treasure hunting? Today, with one of his friend, iSea is on

hdu 3641 Treasure Hunting 强大的二分

1 /** 2 大意:给定一组ai,bi . m = a1^b1 *a2^b2 * a3^ b3 * a4^b4*...*ai^bi 3 求最小的x!%m =0 4 思路: 将ai 质因子分解,若是x!%m=0 那么x! 质因子分解之后 质因子的个数一定大于等于m的个数.二分求解可得 5 注意: 二分时,需要将,上下限 设定好,low =0: high = 1ll<<60; 6 **/ 7 8 #include <iostream> 9 #include <cstring&g