Code&Data Insights

[ Discrete random variables : Bernoulli / Binomial / Geometric / Poisson ]

Marcov's Inequality : For a continuous nonnegative random variable X, and c>0, then * One of the application of E(x)* Chebyshev's Theorem : a fact that applies to all possible data sets. It describes the minimum proportion of the measurements that lie must within one, two, or more standard deviations of the mean. Conditional Probability P(A | B) = P(A and B) / P(B) : a measure of an event occuri..

[ Joint Distribution ] : the probability mass function and the probability distribution function can also be functions of more than one variable. [ Joint Probability Functions ] - Joint Cumulative Distribution Function For a pair of random variables X,Y, the joint cumulative distribution function (CDF) Fxy is given by

Mutually exclusive -> disjoint, two events cannot occur at same time -> NO INTERSECTION Q) Find the probabitliy that all of the events A, B, C occurs if A, B, C are mutually exclusive. => Since A, B, C are mutually exclusive, they have no union. The probability that all the events A, B, C occur is 0. P( ABC | A,B,C mutually exclusive ) -> P(ABC) = 0 Independent -> One does not affect to the othe..

Q) What is CFG? [ CFG - Context Free Grammar ] : Context Free Grammar from CFL(Context-Free Language) Grammar G = (V,T,S,P) V(variables) | T(Terminal symbols) | S(Start variable) | P(Productions of the form: A -> x) * CFL(Context-Free Languages): A language L is context-free if and only if there is a context-free grammar(CFG) G that generates it, L = L(G). * Derivation Tree * Normal Forms for CF..

What is Pointer? => A pointer is a variable whose value is the address of another variable. Like any variable or constant, you must declare a pointer before you can work with it. The general form of a pointer variable declaration is − ( 포인터란 다른 변수의 주소를 가진 변수이다. 다른 변수나 상수와 같이, 반드시 포인터를 사용하기 전에 선언되어야 한다. ) type *var-name; * the pointer's base type int *ip; // pointer to an intege..

순열과 조합 1) 순열 [ Permutation ] - 서로 다른 n개 중에 r개를 선택하는 경우의 수 (순서가 존재O, 중복허용X) - Determines the number of possible arrangements in a set when the order of the arrangements matters. - 순열 규칙 (1) 대상: 서로 다른 n개 (2) 갯수 : r개 (3) 중복 : X (4) 순서의 구분 : O import java.util.stream.IntStream; System.out.println(" [ Factorial ] :"); // 5! int n = 5; int result = 1; for(int i = 1; int (..

점화식과 재귀함수 - Recursion means "defining a problem in terms of itself". - For example, the Fibonacci sequence is defined as: F(i) = F(i-1) + F(i-2) -The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. System.out.println(" [ 점화식과 재귀함수 ] "); // 1,3,9,27, ... 의 n번째 수 int n = 4; int result = 1; for(int i ..