Job market in NZ is much different with it in China.

Research yourself

• your skills (db, python, c#/Unity3D)
• interests (big data, data analysis)
• accomplishments (AT Tetris, aceielts)
• Experience (game development in Shanghai China, automation data in China)
• Goals and values
• make you a unique candidate both verbally and in writing

Research Externally

• creat your target criteria
• identify organisations you would like to work
• • unitec lib
• • yellow page /finda
• • professional associations
• • newspaper, magzines
• • your own network
• • emplyer eveent
• • google

develop my pitch

• write a number of bullet points that make you unique
• remeber to be authentic
• think about value you are offering an employer
• consider the different elements that make up your personal brand

take a proactive approach

• self advertise
• networking
• information interview
• approaching employers
• volunteering
• join associations
• register with agencies
• social media networking

make a job search log

Connect Sql Server throught VS Code Mssql extension

In data warehouse course, the software recommended is VS SQL Management.

And you only have it on windows. Before, I always use the desktop at shcool to connect the server. Today, I questioned my self, if the server is running on server, and VS SQL manager is only a client. Is there a client on mac for SQL server? And I found this question on stackoverflow.

• sql server clients

How to connect dochyper

1. install mssql extension on vs code
2. CMD+Ship+p, sql, choose MS SQL:Connect
3. enter server name: dochyper.unitec.ac.nz
4. leave DB name blank?
5. username
6. password
7. save pwd ?
8. save profile?

and connection is done.

CMD + Shift + E to run the sql commands. 👍

More

• tutorial about Tsql
• tutorial about vs code and mssql

Basic Coding

• define an array
• populate it
• Search - brute force
• sorting (beofore search)
• Binary Search

Code Example (C)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

#include <stdio.h>
#include <stdlib.h> // 
#include <time.h>  //for random seed
// #include <stdbool.h> //c99 for boolean

// like #include "stdafx.h"  use " " toinclude from same directory
// in c, if there is only one statement, {} is not necessary

int main(){
  printf("Set seeding\n");
  int seed = time(NULL);
  srand(seed);

  int A[100];

  // populate the array
  for (int i = 0; i<100; i++){
    A[i] =rand()%1000;
    printf("A[%d]: %d \n", i,  A[i]);
  }

  // A[99]=300; // cheating for finding

  // bubble sort
  int temp =0;
  for (int i=0; i<99;i++){
    for (int j=i+1; j<100;j++){
      if (A[i]>A[j]){
        temp = A[i];
        A[i]=A[j];
        A[j]= temp;
      }
    }
  }

  // re print sorted array
  for (int i = 0; i<100; i++)
    printf("A[%d]: %d \n", i,  A[i]);

  // searching
  int ntf =300;
  

  // brute forceing searching
  int position=-1;
  for (int i=0; i<100; i++){
    if (ntf==A[i]){
      ntf =A[i];
      break;
    }
  }

  if (position !=-1) {
    printf("Found by brute ntf %d at %i", ntf, position );
  }else {
    printf("Cannot found %d \n", ntf);
  }

  // binary search
  
  int start=0;
  int end = 99;
  int found = start+(end-start)/2;

  while (A[found] != ntf){

    if (A[found] > ntf ){
      end = found;
    }else {
      start = found;
    }

    found = start+(end-start)/2;
    if (found == start || found == end){
      found = -1;
      break;
    }
  }

  if (found ==-1){
    printf("Cannot found %d \n", ntf);
  }else{
    printf("Found throught binary searching %d\n", found );
  }

  // system("pause"); // for pause console to show result
  // getchar(); // to receive input from console
  return 0;
}

More Workds

• find 2 other sorting methods
• 1 searching method

Analyse Skydive Chicago, analysis exercise chapter 3

Hardware

• DVD
• Video tapes
• computer
• camera(hidden)

People

• students
• jumpmasters

Software

Procedures

• training program
• feedback
• watching video clips in preparation for next jump
• record the video (hidden)

Data

• Video library

3 Strategies of Porters’ Generic Strategies

• Cost Leadership Strategy (differences in cost)
• Differentation Strategy (differences in product)
• Focus Strategy

5 forces of competition

• buyers
• suppliers
• substitutes // 取代、代替
• new entrants
• existing rivals

Analyse Exercise of CenterPoint Properties

their strategies

Cost Leadership

5 forces affect

(5 forces might not all exist, if not, explain it and say it out in assignment)

how do they using IT

buy them and build on them

SWOT

• Strength
• Weakness
• Opportunities
• Threats

SQL constraint / 约束

1. Not Null
2. Default
3. Unique
4. PK
5. Foreign Key
6. Check Constraint

Data Integrity

1. Entity, nu duplicate rows
2. Domain, enforce valid entries by restricting the type, format, range of value
3. Referential Integrity, rows cannot be deleted which are used by other records
4. User-defined Integrity

Nomalization

1NF

• pk,
• no repeating, if repeating, split to more than 1 tables

2NF

• meet 1NF
• no partial dependences

3NF

• meet 2nf
• all non-primary fields are dependent on pk

SQL Comparison Operatoes

= is like ==

SQL Logical Operators

• All
• And
• Any
• Between
• Exists
• in
• Like
• Not
• or
• is Null

References

• tutorials point sql tutorial

unitec dreamspark for ms softwares

• VS Studio
• C#

DW

• Depository: all job donw after transition finished
• Store: no update/delete
• Reporting: Multi Dimentional
• Analysis: With historical records
• BI

ETL

Design A DW:

• whakt kindss of reports
• how often need to be generated
• add data or part
• can I use same structure

1. server: dochyper.u ..
2. auth: sql
3. username
4. pwd, is your birthday

Some Data type

• int 2^16 -30k - 30k, 2bytes
• long int 2^32 4bytes
• unsigned int 0!60k

Pointer

• & the memrary address

• • get the value

    int *p // just read 2 bytes from the address (p point to), because of type int
    p = & count, the var count’s address

c pointer and array

1
2
3
4
5
6
7
8
9
10
11
12

void main(void) { 

	int a[100], *p, sum=0; 
	
	// a for loop to assin the value in an array
	// array a is like a pointer
	
	for(p=a; p<&a[100]; ++p){ 
		sum+=*p;
	}

}

• p=a // p get address of a[0]

• p < &a[100] // p less than the 100 th element in a, the array which does not exsit

• ++p, address +=2, because *p is a int

book a workshop

tpa.unitec.ac.nz/learningcentre

Others

• careers.unitec.ac.nz
• moodle, career development