How to Become a Data Scientist
SF Data Science Meetup, June 30, 2014
Video of this talk is available here: https://www.youtube.com/watch?v=c52IOlnPw08
More information at: http://www.zipfianacademy.com
Zipfian Academy @ Crowdflower
Booz Allen Hamilton created the Field Guide to Data Science to help organizations and missions understand how to make use of data as a resource. The Second Edition of the Field Guide, updated with new features and content, delivers our latest insights in a fast-changing field. http://bit.ly/1O78U42
1. The document discusses basic flowcharting concepts including system flowcharts, program flowcharts, and decision tables. 2. It provides examples of various flowchart symbols like terminator, process, preparator, and connector. 3. Specific examples are given showing how to represent logic like reading input, performing calculations, and displaying output using flowcharts.
The document discusses different programming concepts including sequence, selection, iteration, and variables. It provides examples of pseudocode for basic logic structures like if/else statements, loops, and case statements. Flowcharts are also shown to illustrate program flow and logic. Common programming elements such as variables, arithmetic operators, input/output, and conditional statements are demonstrated.
The document contains examples of basic programming concepts including sequence, selection/decision, iteration, variables, arithmetic operations, input/output, and calculating electric bills based on meter readings and a fee per meter. It demonstrates simple Python-like code snippets and pseudocode to illustrate foundational programming structures and logic.
1. The document discusses basic flowcharting concepts including system flowcharts, program flowcharts, and decision tables.
2. It provides examples of different flowchart symbols like terminals, processes, documents, and predefined processes.
3. Sample flowcharts are given that show sequences, decisions/conditions, and iterations using symbols like START, STOP, and arrows.
This document discusses various computing concepts including terminals, processes, documentation, manual input, preparation, in-page connectors, punch cards, punched tape, magnetic disks, predefined processes, auxiliary operations, and communication links. It provides basic descriptions and examples of how each concept works at a high level without going into detailed technical explanations.
This document discusses different types of diagrams used in systems analysis including system flowcharts, program flowcharts, and decision tables. It also mentions equations for calculating sample size in surveys and references the American National Standards Institute.
This document appears to be an incomplete flowchart or set of instructions related to basic flowcharting. It includes section headings, question marks indicating missing information, and numerical references but lacks meaningful descriptive text to summarize.
The document outlines a process with 6 main sections and various subsections. Section 1 discusses initial steps, section 2 covers additional requirements, section 3 describes necessary reviews, section 4 provides implementation details, section 5 addresses assessments, and section 6 discusses finalizing the process. The document methodically breaks down a complex process into defined stages with clear sub-parts and responsibilities.
4. 犖犖園硯 犖犖∇犖 犖犢犖犖犢犖犖犖:
ReadL ine
犢犖犖犢犖犖犖÷犢犖橿犖ム犖橿犖犖萎犖犢犖犖項犢犖犢犖犖犖犖犖劇賢
犢 犢
犢犖ム鍵犖犖ム犖橿硯犖犖橿験犖犖園犖犖橿権
using System;
using System;
class HelloYou
class HelloYou
{
{
static void Main()
static void Main()
{
{
string name;
string name;
Console.Write("What is your name: ");
Console.Write("What is your name: ");
name = Console.ReadLine();
name = Console.ReadLine();
Console.WriteLine("Hello, {0}", name);
Console.WriteLine("Hello, {0}", name);
}
}
}
}
5. 犖犖橿牽犢犖犖ム元犢犖 犖犖犖犖犖巌 犢犖犢犢 犖犢犖
犖犖園硯 犢犖ム 犖橿犖÷犢犖犖 Console.ReadLine
犢犖犢犖犖犖朽犖犖犖橿犖о
犖犖劇犖犢犖橿犖犢犖犖犖犖犖巌
犖犖園硯犢犖ム犖犖朽犖犖∇弦犢犖犖犖項犖犖犖犖巌犢犖÷犖犖橿検犖橿牽犖犖犖橿験犢犖犢犖犢
犢
犢犖犖犖橿牽犖犖橿験犖犖о犢犖犢犢犖犖∇犖犖
string s = "12";
string s = "12";
int x = s+1; // Error!
int x = s+1; // Error!
犖犖犖巌犖犢犖犖÷弦犖ム犖園硯犢犖ム犖犖伍犖犖犖巌犖÷元犢犖÷犢犖犖 Parse
犖犖謹犖犖犖橿験犖犖犢犖橿犖朽犢犖犖ム元犢犖∇犖犢犖犖÷弦犖ム肩犖犖犖巌犢犖犢犢犖犢犖犖犖犖巌
犖犖string ss == Console.ReadLine();
犖о犖ム犖犖橿検犢犖犖犖犢犖犖÷弦犖ム犖園犖 犢
string Console.ReadLine();
int x = int.Parse(s);
int x = int.Parse(s);
double y = double.Parse(s);
double y = double.Parse(s);
7. 犢犖犖犖犖謹 犖犖園 : 犢犖犢犖 犖÷犖橿牽
犢犖犖朽権犖犢犖犖犢犖犖犖÷犖犖劇犖犖犢犖橿犖犢犖 x+y 犢犖ム鍵
xy, 犖犖橿犖犖園犖犢犖犢犖犖犖犖о犖橿犢犖橿犖犖 x 犢犖ム鍵 y
犖犖劇賢犢犖犢犖橿犖
犢犖犖巌犖÷犢犖犖犖橿犖犖橿牽犖犖巌犖犖園犖犖犖犖犖о鹸犖犖 犢犖ム鍵犢犖犖朽権犖
pse udo -co de
犖犖橿験 pseudo-code 犖÷験犢犖犖朽権犖犢犖犢犖犢犖犖犢犖犖犖
8. 犖犖橿牽犢犖犖ム元犢犖 犖犖犖犖巌 犖犢犖 犖÷弦犖
犖犖園硯 犖ム鍵犢犖犖朽権 犖犖÷験犖
犢犖ム 犖ム鍵犢犖犖朽権 犖犖犢犖 犖
double float long int short sbyte
ulong uint ushort byte
犖犖橿牽犖犖橿験犖犖犖犖犢犖橿犖犢犖犖園硯犢犖犖犖犖朽犢犖犢犖犖犢犖犖÷弦犖ム犖犢犖ム鍵犢犖犖朽権犖
char
犖÷験犖犖犖о犖 int i = 50;
int i = 50;
犖犖橿験犢犖犢犖犖園犖犖 double d = i; // OK
double d = i; // OK
犢犖犖劇犖犖犖犖橿犖犢犖犖÷弦犖ム犖÷犖÷犖橿牽犖犖項犖犖橿権
犖
C# 犖犖園犖犖園犢犖犢犖犖萎犖伍犖犖巌犖犢犖犖÷弦犖ム犖犢犖犖園犢犖犖犖о犖橿犢犖橿犖犖橿牽
犖犖萎犖伍 犖犢犖犖犖犖 犖 犖犖犖園
犖
犢犖犖ム元犢犖∇犖犢犖 double 犢犖犢犖
犖犖橿牽犖犖橿験dd == 5000.78; 犖犖園硯犢犖犖犖犖朽犖ム鍵犢犖犖朽権犖犖犢犖犖∇犖о犖
double 犖犖犖犖犢犖橿犖犢
double 5000.78; long
long x = d;
long x = d; // ERROR!!!
// ERROR!!!
long x = (long) d; // OK
long x = (long) d; // OK
9. 犖犖園硯 犖犖橿験 犢犖犖巌 犖犖橿牽犢犖犖
"modify-and-assign"
犢犖犖橿肩犖橿検犖橿牽犖犖犖犖÷犖園硯犖犖橿験犢犖犖巌犖犖橿牽犖犖橿
犖犖犖巌犖犖橿肩犖犖犢犖犖橿犖犖園硯犢犖犢犖橿犖園 "=" 犢犖犖劇犖犢犖犢犢犖犢犖
犖犖園 犢犖犖犖犖橿験犖犢犖犖犖橿牽犢犖犖 modify-and-assign
犖犖項硯犖犖橿験犢犖犖 犖犖 犖犖о験犖÷見犖÷験犖
var += expression 犢犖犖巌検犖犢犖橿犖 var 犢犖犢犖犖犖橿験犖犖о犢犖犢犖橿犖園
犢
expression
var -= expression 犖ム犖犢犖橿犖 var 犢犖犢犖犖犖橿験犖犖о犢犖犢犖橿犖園 expression
var *= expression 犖犖項犖犢犖 var 犖犢犖о権 expression 犢犖犢犖犖犖ム献犖園犖犢犢犖
var
var /= expression 犖犖橿牽犖犢犖 var 犖犢犖о権 expression 犢犖犢犖犖犖ム献犖園犖犢犢犖
var
犖犖園硯犖犖∇犖橿
sum += x; // 犢犖犢犖 犖ム犖犖÷厳犖 犖犖犖園 sum = sum + x
prod *= 2.5; // 犢犖犢犖 犖ム犖犖÷厳犖 犖犖犖園 prod = prod * 2.5
y -= 3+a; // 犢犖犢犖 犖ム犖犖÷厳犖 犖犖犖園 y = y (3+a)
10. 犖犖園硯 犖犖橿験 犢犖犖巌 犖犖橿牽犖犖橿験 犖犖犖園 犢犖犖巌犖 /
犖ム犖犢犖橿犖犖巌犖犖橿牽 ++ 犢犖ム鍵 犢犖犢犖犖橿験犖犖犖園犢犖犖巌検
犖犖園硯犖犖
犖 犢
犢犖ム鍵犖ム犖犢犖橿犖犢犖犖園硯犢犖犖
犖犖朽献犖 1 犖犖橿験 犖犖園犖 犖犖ム献犖園 犖犢
x++ 犢犖犖巌検犖犢犖 x 犖犖謹犖 1
犢
x-- 犖ム犖犢犖 x 犖ム 1
犖犖園硯int nn 犖:0;
int 犖 = 0;
犖犖∇ =
n++;
n++; // 犢犖犢犖 犖ム犖犖÷厳犖 犖犖犖園 n = n+1, or n += 1
// 犢犖犢犖 犖ム犖犖÷厳犖 犖犖犖園 n = n+1, or n += 1
n++;
n++; // n 犖÷元犖 犢犖 犢犖犢犖 犖犖園 2
// n 犖÷元犖 犢犖 犢犖犢犖 犖犖園 2
n--;
n--; // n 犖÷元犖 犢犖 犢犖犢犖 犖犖園 1
// n 犖÷元犖 犢犖 犢犖犢犖 犖犖園 1
11. 犖犖橿牽犢犖犖朽権 犖犢犖犢犖 犖橿犢犖÷犢犖 犖
犖犖ム験犖犖犖ム験犖∇犖ム験犖犖÷元犢犖÷犢犖犖犖犖犖巌犖犢犖犖犖巌
(static) 犖犖朽犖犖橿検犖橿牽犖犢犖犖朽権犖犢犖犢犖犢犖橿犖犖ム験犖
犢犖犖∇犖犖犢犖犢犖犖園犖犖
犢犖犖朽権犖犢犖÷犢犖犖 me tho dN ame 犖犢犖橿犖犖ム験犖
namespaceName.犖犖朽犖犖∇弦犢犢犖犢犖犖÷肩犢犖犖
classN ame className.methodName(optional-arguments)
name space N ame
犖犖橿犢犖犖÷肩犢犖犖 name space N
using namespaceName;
:
ame 犖犖項犖犖萎犖伍犢犖橿
犖犖橿験犖犖園犖 using 犢犖о犖(犢犖犖犖犖犢犖橿犖朽 犖犖橿牽犢犖犖朽権犖犢犖÷犢犖犖
className.methodName optional-arguments)
犢犖÷犖犖橿験犢犖犢犖犖犢犖犖犖犖萎犖伍犖犖÷肩犢犖犖
12. 犖犖ム験犖 Math
犖犖ム験犖 Math 犢犖犢犖犖÷肩犢犖犖 System 犢犖犢犢犖犖犖朽権犖÷犖÷犢
犖犖犢犖ム鍵犖犢犖橿犖犖犖朽犢犖о犖犖ム験犖∇犖園硯犖犖橿験犖犖犖園犖犖橿牽犖犖橿験犖犖о
犖犖橿犖犖犖巌犖犖橿肩犖犖犢犖犖朽犖犖園犖犢犖犖犖犖謹犖
犖犖園硯犖犖∇犖橿 (犖犖橿犖犢犖о):
犢犖÷犢 犖犖園硯 犖犖∇犖 犖犖犖橿牽 犖犖ム献犖園
犖犖 / 犖
犖犢 犖犢犖 犖犖朽犖 犖劇 犖犖ム険犖 犖÷験
犢犖犢犖 犖橿 犖犢
犖犖犖犖朽
3.14159
PI 犖犢犖 Math.PI
27
Max(x,y)
犖犢犖橿犖朽犖÷験犖犖犖о犖橿牽犖萎見犖о犖橿 Math.Max(1,2) 2
x 犢犖ム鍵 y
Abs(x) 犖犢犖橿肩犖園検犖犖項牽犖犢犖犖犖 x Math.Abs(-1.3) 1.3
Sqrt(x) 犖犖橿犖犖朽犖犖犖犖犖犖 x Math.Sqrt(4.0) 2.0
Round(x)
犖犢犖 x 犖犖朽犖犖園犢犖犢犖 Math.Round(0.8) 1
犖犖橿験犖犖о犢犖犢犖
Math.Pow(3,2)