Kruskal’s Algorithm
신장 트리
신장 트리
플로이드 워셜 알고리즘 개요
Dijkstra’s algorithm allows us to find the shortest path between any two vertices of a graph.
Selection Sort
Linear Search (순차 탐색)
Dynamic Programming is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal ...
탐색(Search)이란 많은 양의 데이터 중에서 원하는 데이터를 찾는 과정
Stack
알고리즘은 간단한데 코드가 지나칠 만큼 길어지는 문제 실수 연산을 다루고, 특정 소수점 자리까리 출력해야 하는 문제 문자열을 특정한 기준에 따라서 끊어 처리해야 하는 문제 적절한 라이브러리를 찾아서 사용해야 하는 문제
The algorithm never reverses the earlier decision, even if the choice is wrong. It works in a top-down approach.
Data Types
Time complexity
A perfect data set is usually a big win for any data scientist or machine learning engineer. Unfortunately, more often than not, datasets will have missing d...
Eigenvectors and Eigenvalues
We summarize how well a supervised model performs on a given dataset. Accuracy Classification accuracy is a metric that summarizes the performance of...
Encoding for Categorical variables Most Machine learning algorithms can not handle categorical variables unless we convert them to numerical values...
House price regression Techniques Goal: We predict the final price of each home based on the given features. Metric: Root-Mean-Squar...
It is important that credit card companies are able to recognize fraudulent credit card transactions so that customers are not charged for items that t...
From frontline support teams to C-suites, customer satisfaction is a key measure of success. Unhappy customers don’t stick around. What’s more, unhappy...
This is for the interview of SQL.
Q1. Weather Observation Station 3
Add data to a table
1. (Inner) JOIN