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..

[ Data & Data Science Field ]  Data - traditional / bigData science - BI(Business Intelligence) / Traditional Methods / Machine Learning * Data Collection in TRADITIONAL DATA after gathering the data, its need to take the data pre-processing raw data -> data pre-processing -> processing -> Information Where?: Basic customer data / historical stock price data - Class labeling : / - Data cleansin..

[ MAP ] - (key-value) entries and key should be unique! - can store elements in a way that attempts to speed up the process of locating them, through the utilization of keys - main operations: search | insert | delete - methods : get(k), put(k,v), remove(k), entrySet(), keySet(), values(), size(), isEmpty() - we can efficiently implement a map using an unsorted list [ Hash Functions & Hash Table..

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..

- an ADT for storing a collection of prioritized elements; the elements are referred to as values. (ADT - Abstract Data Type, this focuses on the behaviour of a data structure rather than on any implementation detail 데이터 구조를 사용해 코드를 구현하는 것보다 데이터구조가 어떻게 작동하는지에 초점을 맞춘 것) - A key can be used to indicate the priority of a value( key: can be used to indicate the priority of a value..