BOJ - 9735 - ์ผ์ฐจ ๋ฐฉ์ ์ ํ๊ธฐ
```python import sys from decimal import *
```python import sys from decimal import *
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys
```python import sys def solution(): _discount = {โMugunghwaโ : 0, โITX-Saemaeulโ : 0, โITX-Cheongchunโ : 0, โS-Trainโ : 0.5 , โV-Trainโ : 0.5} _city...
```python import sys def solution(): _INF = 1e9 N, M = map(int, sys.stdin.readline().split())
```python def solution(): N = int(input())
```python import sys from collections import deque
```python import sys
```python import sys from collections import deque
import sys L, R, A = map(int, sys.stdin.readline().split()) print(min(L+A, R+A, L+R+A >> 1) * 2)
```python import sys
```python import sys, math
```python import sys from collections import deque
```python import sys from copy import deepcopy from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
print("๋น์์ด")
```python import sys, math
```python import sys, math
```python import sys
```python import sys
```python def Contact(index, state, N): if(state == -1): print(โNOISEโ) return
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys import math
```python import sys
```python import sys
```python import sys
```python def solution(): while True: N = int(input()) if N == -1: break
```python import sys
```python import sys
print(int(input()) ** 0.5 * 4)
```python import math def fact(n): a = 1 for i in range(1, n+1): a = a * i return a
print(int(input()) ** 0.5 * 4)
```python import sys
```python import sys
```python import sys
```python import sys import heapq
```python import sys
```python import sys
```python import sys
```python import sys import math import heapq
```python import sys
```python import sys
```python import sys import math import heapq
```python import sys from collections import deque
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys from decimal import * import math
```python import sys
```python import sys
```python import sys import math
```python import sys
```python import sys
```python import sys _INF = 1e9
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys from collections import defaultdict
```python import sys _INF = 1e10
```python import sys import math
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys _INF = 1e10
```python import sys
```python import sys import math
```python import sys
```python import sys
```python import sys import math
```python import sys
```python import sys _INF = 1e10
```python import sys import heapq
```python import sys
```python import sys
```python import sys import math
```python import sys from decimal import Decimal A, B = map(str, sys.stdin.readline().split()) A, B = Decimal(A), Decimal(B) c = Decimal(โ299792458โ) ret = (...
```python import sys import math
```python import sys import math
```python import sys _INF = 1e9 def solution(): N, M = map(int, sys.stdin.readline().split()) dist = [] maps = [] for _ in range(M): ...
```python import sys
```python import sys import math
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys _INF = 1e9 def solution(): M, N = map(int, sys.stdin.readline().split()) matrix = [[_INF for _ in range(26)] for _ in range(26)]...
```python import sys import math
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys import math
```python import sys import math
```python import sys
```python import sys import math
```python import sys import math
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python def solution(): N = int(input()) arr = [] for _ in range(9): arr.append(list(map(int, input().split())))
```python def solution(): N = int(input())
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys
```python import sys
def solution(): a, b = map(int, input().split()) people = list(map(int, input().split())) party = a * b for i in people: print(i - pa...
```python def solution(): H, Y = map(int, input().split())
```python def solution(): N = int(input()) idx = 64 while N % 2 == 0: N //= 2 idx -= 1 print(idx)
```python def solution(): N = int(input()) bit = 1 if N < 0: print(32) elif 0 <= N < 2: print(1) else: count = 0 while bit <= N:...
```python import sys
```python import sys
```python import sys from collections import deque dx = [0, 0, 1, -1] dy = [1, -1, 0, 0]
```python import sys from heapq import heappush, heappop
```python import sys from heapq import heappush, heappop INF = 1e9 def Dijkstra(K, graph, V): heap = [] distance = [INF] * (V +1) distance[K] = 0...
```python import sys INF = sys.maxsize
```python import sys from heapq import heappush, heappop
```python import sys from heapq import heappush, heappop
```python import sys from collections import deque
```python import sys INF = sys.maxsize
```python import sys import heapq
```python import sys
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python _INF = 1e9 def solution(): N = int(input()) Floyd = [[_INF for _ in range(52)] for _ in range(52)]
```python import sys
```python import sys _INF = 1e9
```python _INF = 1e9 def solution(): N = int(input()) Floyd = [[_INF for _ in range(26)] for _ in range(26)]
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys
```python import sys from collections import deque
```python import sys from heapq import heappush, heappop
```python import sys
```python import sys from heapq import heappush, heappop
```python import sys from collections import deque
```python import sys
```python import sys from heapq import heappush, heappop
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys def solution(): N = int(input()) ip = [] for _ in range(N): ip.append(sys.stdin.readline().strip().split(โ.โ))
```python def getPartialMatch(P): pLength = len(P)
```python import sys
```python import sys
```python import sys import heapq
```python import sys import heapq
```python import sys
```python import sys
```python def solution(): N = int(input()) number = list(map(int, input().split()))
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys from heapq import heappush, heappop
```python retMax = -1e9 retMin = 1e9
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys
```python def solution(): coin = [] N, K = map(int, input().split(โ โ)) coin.append(0) for _ in range(N): coin.append(int(input()))
```python room = int(input())
```python import sys sys.setrecursionlimit(10**9)
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from heapq import heappush, heappop
```python import sys from collections import deque
```python import sys from heapq import heappush, heappop
def solution(): N = int(input()) if ((N - 1) % 5 + 1) == 2 or ((N - 1) % 5 + 1) == 5: print('CY') else: print('SK') solution()
```python import sys from collections import Counter
```python import sys from heapq import heappush, heappop
```python import sys from collections import deque
```python import sys from heapq import heappush, heappop
```python import sys
```python import sys
```python import sys from heapq import heappush, heappop
```python import sys import copy from collections import deque
```python import sys import heapq
def solution(): N = int(input()) if N % 7 == 0 or N % 7 == 2: print('CY') else: print('SK') solution()
```python import sys
```python def solution(): string = str(input()) bomb = str(input())
```python import sys import itertools
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys from collections import deque
```python import sys, math
```python import sys, math
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python def recursive(arr, N, x1, y1, x2, y2): if N == 2: ret = [] for i in range(x1, x2): for j in range(y1, y2): ...
```python def solution(): N = int(input()) arr = list(map(int, input().split()))
```python def solution(): N = int(input()) arr = list(map(int, input().split())) money = int(input()) left, right = 0, max(arr)
```python import sys, math
```python import sys
```python import sys INF = 314152965 def solution(): N, M, T, D = map(int, sys.stdin.readline().split())
```python import sys, math
```python from decimal import Decimal, getcontext
```python import sys sys.setrecursionlimit(20_000)
```python import sys, math
```python import sys, math mod = 1000000007
a=int(input()) for i in range(1,a+1): print("*"*i)
```python import sys from math import *
```python def drawFirstLastLine(N): for i in range(4 * N - 3): if N <= i <= 3 * N - 4:print(โ โ, end=โโ) else: print(โ*โ, end=โโ) ...
```python def recursive(n, index, Star): if n == 1: Star[index][index] = โโ Star[index + 1][index] = โโ Star[index + 2][index] = ...
```python def recursive(N, Star, startCol, startRow, endCol, endRow):
```python import sys sys.setrecursionlimit(10 ** 9)
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys def solution(): line = [] K, N = map(int, sys.stdin.readline().split())
```python import sys
def solution(): N = int(input()) value = 666 while N: if '666' in str(value): N -= 1 value += 1 print(value ...
```python from collections import deque
A,B=map(int,input().split());print(A*B)
```python import sys
import sys A, B, C = map(int, sys.stdin.readline().split()) print(A+B+C)
print(ord(input())-44031)
```python import sys from collections import Counter
```python from collections import deque
```python KeyBoard = { โ1โ : โ`โ, โ2โ : โ1โ, โ3โ : โ2โ, โ4โ : โ3โ, โ5โ : โ4โ, โ6โ : โ5โ, โ7โ : โ6โ, โ8โ : โ7โ, โ9โ : โ8โ, โ0โ : โ9โ, โ-โ : โ0โ, โ=โ : โ-โ...
```python def solution(): variables = str(input())
```python def solution(): H, W = map(int, input().split()) Map = [] for _ in range(H): Map.append(list(str(input())))
```python def solution(): L = int(input()) string = input() ret = 0 for i in range(L): ret += (ord(string[i]) - 96) * (31 ** i) print(ret % 12...
```python def solution(): cnt = 1 while True: N = int(input()) if not N: break array = []
```python def solution(): count = int(input()) if count == 1: print(โ1 bottle of beer on the wall, 1 bottle of beer.โ) print(โTake on...
alphabet = [ ' ', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z' ] ...
```python def solution():
```python def solution(): S = str(input())
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python def solution(): N = int(input())
```python import sys
```python from collections import deque import sys
def solution(): idx = 2 while True: word = str(input()) if word == "Was it a cat I saw?": break print(word[::idx]...
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys
```python def solution(): fibo =[0, 1, 1] for i in range(1, 80): fibo.append(fibo[i] + fibo[i+1])
```python import sys
```python import sys from collections import deque
```python import sys
```python import sys
```python import sys from collections import deque
```python import sys
N = int(input()) print(N - 543)
```python import sys
```python import sys
```python import sys
```python from collections import deque import sys
```python import sys
```python
```python
```python def solution(): N = int(input()) Seat = str(input()) data = [โ*โ] flag = False for i in range(N):
```python def solution(): N = int(input()) div = 10 while N > div: if N % div >= div // 2: N += div N -= (N % d...
```python def solution(): A, B = map(str, input().split(โ โ))
```python def solution(): ret = 0 for i in range(4): Puzzle = list(input()) for j in range(4): if Puzzle[j] != โ.โ: ...
```python import sys
```python
```python def solution(): R, C = map(int, input().split(โ โ)) A, B = map(int, input().split(โ โ))
```python def solution(): alphabet = [โaโ, โbโ, โcโ, โdโ, โeโ, โfโ, โgโ, โhโ, โiโ, โjโ, โkโ, โlโ, โmโ, โnโ, โoโ, โpโ, โqโ, โrโ, โsโ, โtโ,...
```python import sys
```python
```python import sys
```python def solution(): N = str(input())
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python import sys
```python def solution(): dataX = [] dataY = [] for _ in range(3): x, y = map(int, input().split(โ โ)) dataX.append(x) da...
```python from collections import deque import sys
```python
```python import sys
```python def GCD(x, y): mod = x % y while mod > 0: x = y y = mod mod = x % y return y
```python def solution(): H, W = map(int, input().split())
```python def solution(): A, B, C = map(int, input().split()) I, J, K = map(int, input().split())
```python import sys
```python Alphabet = โABCDEFGHโ
```python import sys
```python def solution(): data = [] for _ in range(10): data.append(int(input()))
```python def solution(): data = list(map(int, input().split(' ')))
```python import sys import heapq
```python def solution(): N = int(input()) data = [] Stack = [] ret = []
```python def solution():
```python import sys
```python import sys
```python import sys import heapq
```python def solution(): data = list(map(int, input().split())) N = min(data)
```python import sys
```python import sys
```python import sys
```python import sys from queue import Queue
solve = sum
```python import sys
```python def solution(): N = int(input()) stair = []
```python import sys from collections import deque
```python import sys
```python import math
```python import sys
```python import sys from collections import deque
```python import sys from collections import deque
Java Junit5 Assert ํจ์ ์ ๋ฆฌ
JDK 17 New Features
Java 16 New Features
Java 15 New Features
Java 14 New Features
Java 13 New Features
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Visitor Pattern
Java 12 New Features
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Template Method Pattern
Java 11 New Features
Python 3.10์ ์๋ก์ด ๊ธฐ๋ฅ
Java 10 New Features
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Strategy Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - State Pattern
Python3 Install Mecab NameError: name โTaggerโ is not defined` Solution
Java 9 New Features
Python 3.9์ ์๋ก์ด ๊ธฐ๋ฅ
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Observer Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Memento Pattern
Python 3.8์ ์๋ก์ด ๊ธฐ๋ฅ
Python 3.7์ ์๋ก์ด ๊ธฐ๋ฅ
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Mediator Pattern
Python 3.6์ ์๋ก์ด ๊ธฐ๋ฅ
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Iterator Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Interpreter Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Command Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Chain of Responsibility Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Proxy Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Flyweight Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Facade Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Decorator Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Composite Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Bridge Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Adapter Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Singleton Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Prototype Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Factory Method Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Abstract Factory Pattern
๋์์ธ ํจํด ํบ์๋ณด๊ธฐ - Builder Pattern
Java 8 Optional ์ดํด๋ณด๊ธฐ
Java 8 Stream API ์ดํด๋ณด๊ธฐ -4- Collector ์ดํด๋ณด๊ธฐ
Java 8 Stream API ์ดํด๋ณด๊ธฐ -3- findAny() vs findFirst()
Java 8 Stream API ์ดํด๋ณด๊ธฐ -2- Stream ๊ฐ๊ณตํ๊ธฐ / ๊ฒฐ๊ณผ ๋ง๋ค๊ธฐ
Java 8 Stream API ์ดํด๋ณด๊ธฐ -1- Stream ์์ฑํ๊ธฐ
JAR / WAR
Python์ C์ธ์ด์์ ์ฌ์ฉํ๋ struct๋ฅผ ์ฌ์ฉํ ์ ์์ต๋๋ค.
๊ณต๊ณต๋ฐ์ดํฐ ํฌํธ์ ์ด์ฉํ์ต๋๋ค.
OverLoading
Generator
์ฌ์ฉํ ๋๋ ํ ๋ฆฌ ์์
๊ฐ์ํจ์
Case 1
equals() ๋ฉ์๋๋ ๋น๊ต์ํ๋ ๋์์ ๋ด์ฉ ์์ฒด๋ฅผ ๋น๊ตํ์ง๋ง, == ์ฐ์ฐ์๋ ๋น๊ตํ๊ณ ์ ํ๋ ๋์์ ์ฃผ์๊ฐ์ ๋น๊ตํฉ๋๋ค.
Abstract Class
[Python] ๋ฌธ์์ด์ ๋ฉ๋ชจ๋ฆฌ ํ ๋น ๋ฐฉ์
MTBF, MTTR, MTTF ์ค๋น ๋ณด์ ์ ์ ๋ขฐ์ฑ ์งํ๋ก ์ฌ์ฉํฉ๋๋ค. ์ด๋ ํ๋์จ์ด ์ ํ ๋๋ ๊ตฌ์ฑ ์์์ ์ฑ๋ฅ, ์ฅ๋น ์ค๊ณ, ์ ๋ขฐ์ฑ ๋ฐ ์์ ์ ๋ํ ์ค์ํ ์ ์ง๊ด๋ฆฌ ์กฐ์น์ ๋๋ค.
ํ ํฌ์คํธ์์๋ ํด์ ํจ์์๋ํด ๊ฐ๋ตํ๊ฒ๋ง ์ดํด๋ณด๊ฒ ์ต๋๋ค.
Routing Protocol ๊ฐ๋
์ง๊ทธ๋น(Zigbee) ์๊ฐ
OSI 7 Layer
Load Balancing ๊ฐ๋
AJP Protocol
Static Page / Dynamic Page
Protocol Stack ์ด๋
Gateway
์ธ๋งํฌ์ด์ ๋ฎคํ ์ค, DeadLock๊ณผ ๊ฐ์ ๊ฐ๋ ์ ๋ชจ๋ฅด์ ๋ค๋ฉด ํ๋ก์ธ์ค์ ์ค๋ ๋์ ์๊ณ์์ญํฌ์คํธ๋ฅผ ๋ณด๊ณ ์ค์๋ฉด ๋ฉ๋๋ค.
๋๊ธฐํ
์ธ๋งํฌ์ด์ ๋ฎคํ ์ค, DeadLock๊ณผ ๊ฐ์ ๊ฐ๋ ์ ๋ชจ๋ฅด์ ๋ค๋ฉด ํ๋ก์ธ์ค์ ์ค๋ ๋์ ์๊ณ์์ญํฌ์คํธ๋ฅผ ๋ณด๊ณ ์ค์๋ฉด ๋ฉ๋๋ค.
Synchronous / Asynchronous
SSL (Secure Socket Layer)
HTTP (HyperText Transfer Protocol)
๊ณต๊ฐ ํค ์ํธ ๋ฐฉ์ (Public-Key Cryptography)
Caches
์๋์ธ(Endianness)
๊ฐ์ ๋ฉ๋ชจ๋ฆฌ
ํ๋ก์ธ์ค ์ค์ผ์ฅด๋ง(Process Scheduling)
๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๋ฐฐ๊ฒฝ
ํ๋ก์ธ์ค vs ์ค๋ ๋
MapReduce
์ปค๋
SQL(Structed Query Language)
์ปดํ์ผ๋ฌ ์ธ์ด vs ์ธํฐํ๋ฆฌํฐ ์ธ์ด
Apache
์์ฉ ๊ณ์ธต (Application Layer)
๋จผ์ kruskal๊ณผ prim์๊ณ ๋ฆฌ์ฆ์ ์๊ธฐ์ ์ MST๋ฅผ ์์์ผ ํฉ๋๋ค.
Graph
ํ๋ก์ด๋-์์ (Floyd-Warshall)
Dijkstra
DFS / BFS
๋ฐ์ดํฐ ๋งํฌ ๊ณ์ธต (Data Link Layer)
Sort
Tree
์คํ (Stack)
๋ฐฐ์ด(Array)
์ ์ก ๊ณ์ธต(Transport Layer)
๋คํธ์ํฌ ๊ณ์ธต(Network Layer)
๊ตฌ์กฐ์ฒด ํฌ๊ธฐ๋ฅผ ๊ตฌํ๊ธฐ์ ๊ตฌ์กฐ์ฒด์ ์๋ฃํ ํฌ๊ธฐ์ ๋ํด์ ์ ๋ฆฌ๋ฅผ ํ๊ณ ์์ํ๊ฒ ์ต๋๋ค.
MVC (Model - View - Controller)
CI (์ง์์ ์ธ ํตํฉ, Continuous Integration)
TDD Test-Driven Development(TDD)๋ ๋งค์ฐ ์งง์ ๊ฐ๋ฐ ์ฌ์ดํด์ ๋ฐ๋ณต์ ์์กดํ๋ ์ํํธ์จ์ด ๊ฐ๋ฐ ํ๋ก์ธ์ค์ด๋ค. ์ฐ์ ๊ฐ๋ฐ์๋ ์๊ตฌ๋๋ ์๋ก์ด ๊ธฐ๋ฅ์ ๋ํ ์๋ํ๋ ํ ์คํธ์ผ์ด์ค๋ฅผ ์์ฑํ๊ณ ํด๋น ํ ์คํธ๋ฅผ ํต๊ณผํ๋ ๊ฐ์ฅ ๊ฐ๋จํ ์ฝ๋๋ฅผ ์์ฑํ๋ค. ์ผ๋จ ํ ์คํธ ํต๊ณผํ๋...
REST ์๋ ์์ด๋ ์น(World Wide Web a.k.a WWW)๊ณผ ๊ฐ์ ๋ถ์ฐ ํ์ดํผ๋ฏธ๋์ด ์์คํ ์ ์ํ ์ํํธ์จ์ด ์ํคํ ์ฒ์ ํ ํ์์ผ๋ก ์์์ ์ ์ํ๊ณ ์์์ ๋ํ ์ฃผ์๋ฅผ ์ง์ ํ๋ ๋ฐฉ๋ฒ ์ ๋ฐ์ ๋ํ ํจํด
OOP(Object Oriented Programming)
[๋ฆฌ๋ทฐ]์ต์ , ํ์ค๋ฅด๋ค
[๋ฆฌ๋ทฐ]๋ ธ๋ฅด์จ์ด์ ์ฒ
[๋ฆฌ๋ทฐ]์ฏ๋ค๋ฅดํ
[๋ฆฌ๋ทฐ]์๋ ๋ฐํด ์๋์
[๋ฆฌ๋ทฐ]์ด๋ฐฉ์ธ
[๋ฆฌ๋ทฐ]๋ฐ๋ฏธ์
[๋ฆฌ๋ทฐ]ํ๊ท ์ ์ข ๋ง - ํ๊ท ์ด๋ผ๋ ํ์์ ์ด๋ป๊ฒ ๊ต์ก์ ์์ฌ์๋
[๋ฆฌ๋ทฐ]๋ด๊ฐ? ์ ์น๋ฅผ? ์? - ์์ฆ ๊ฒ๋ค์ ์ํ ์ต์ํ์ ์ ์น ์์
[๋ฆฌ๋ทฐ]์ธ์์ ๋ง์ง๋ง ๊ธฐ์ฐจ์ญ
[๋ฆฌ๋ทฐ]๋๋ฅผ ์๊ณ ์ถ์ ๋ ๋๊ณผํ์ ๊ณต๋ถํฉ๋๋ค - ๋๊ฐ ๋ฉ์ถ ์๊ฐ, ์ถ์ด ์์๋์๋ค
[๋ฆฌ๋ทฐ]ํธ๋ชจ ๋ฐ์ฐ์ค - ๋ฏธ๋์ ์ญ์ฌ
[๋ฆฌ๋ทฐ]๊ตฐ์ฃผ๋ก
[๋ฆฌ๋ทฐ]๋ ธ์ธ๊ณผ ๋ฐ๋ค
[๋ฆฌ๋ทฐ]๋๋ฌผ๋์ฅ
[๋ฆฌ๋ทฐ]์ฐ๋ฆฌ๊ฐ ๋น์ ์๋๋ก ๊ฐ ์ ์๋ค๋ฉด
[๋ฆฌ๋ทฐ]ํ๋ณตํ๋ ฅ์ฑ - ์๋ จ์ ํ์ด์ผ๋ก ๋ฐ๊พธ๋ ๋ง์ ๊ทผ๋ ฅ์ ํ
[๋ฆฌ๋ทฐ]์์ธ์ ์ก SEASON 1 - ์์๋๋ฉด ์ธ๋ฐ์๋ ์ ๋นํ ์กํ์ฌ์
[๋ฆฌ๋ทฐ]์ธ๊ฐ์ค๊ฒฉ
[๋ฆฌ๋ทฐ]ํฌํฐ๋ฆฌ์ฆ - ๊ต์ ์๊ฐ ์ฒซ๋จ์ถ ์๋ฆฌ์ฆ 36
[๋ฆฌ๋ทฐ]ๆต
[๋ฆฌ๋ทฐ]ํธ์์ ์ธ๊ฐ
[๋ฆฌ๋ทฐ]ํฉ๋ฆฌ์ ๋จ์ : ์ ์ธ๊ณ ๋จ์ฑ๋ค์ด ๊ตฌ๋ ํ๋ ํซ ๋ธ๋ก๊ฑฐ์ ์ฐ์ ๋ฉํ ๋ง
[๋ฆฌ๋ทฐ]๊ตญ๊ฒฝ ์ ์ - ๊ตญ๊ฐ์ ๋ฏธ๋๋ฅผ ์ข์ฐํ๋ ์๋ก์ด ์ง์ ํ ์ ํฌ
[๋ฆฌ๋ทฐ]๊ถ๋ ฅ์ ์ฌ๋ฆฌํ - ๋๊ฐ ๊ถ๋ ฅ์ ์ฅ๊ณ , ๊ถ๋ ฅ์ ์ฐ๋ฆฌ๋ฅผ ์ด๋ป๊ฒ ๋ฐ๊พธ๋๊ฐ
[๋ฆฌ๋ทฐ]๋ง์ดํด ์๋ธ, ์ค๊ตญ์ ๋ง๋๋ค - ์ค๊ตญ์ ๋์ผ๋ก ๋ฐ๋ผ๋ณธ ๋ง์ดํด ์๋ธ์ โ์ ์โ
[๋ฆฌ๋ทฐ]์ด๋ ๋ , ๋ด ์ฃฝ์์ ๋ค๊ฐ ๋ค์ด์๋ค
[๋ฆฌ๋ทฐ]์ค๋ ๋ฐค, ์ธ๊ณ์์ ์ด ์ฌ๋์ด ์ฌ๋ผ์ง๋ค ํด๋
[๋ฆฌ๋ทฐ]์ธ๋ธ ํ ํฌ - 3๋ ํ ๋น์ ์ ๋ฏธ๋๋ฅผ ๋ฐ๊ฟ 7๊ฐ์ง ๊ธฐ์
[๋ฆฌ๋ทฐ]์ฌํผ์์ค - ์ ์ธ์์์ ์ฌ์ด๋ณด๊ทธ๊น์ง ์ธ๊ฐ ์ญ์ฌ์ ๋๋ดํ๊ณ ์๋ํ ์ง๋ฌธ
[๋ฆฌ๋ทฐ]1984
[๋ฆฌ๋ทฐ]์ด์ ์ค์ธ์, ํด๋จ๋ ์์ ์ ๋๋ค
[๋ฆฌ๋ทฐ]์์ ๋ก
[๋ฆฌ๋ทฐ]์ฌ๋ ๋ ๋ค์ด์๋ชฌ๋์ ๋์ ์ธ๊ณ - ์ธ๋ฅ์ ๋ด์ผ์ ๊ดํ ์ค๋ํ ์ง๋ฌธ
[๋ฆฌ๋ทฐ]๊ณต์ ํ๋ค๋ ์ฐฉ๊ฐ - ๋ฅ๋ ฅ์ฃผ์๋ ๋ชจ๋์๊ฒ ๊ฐ์ ๊ธฐํ๋ฅผ ์ ๊ณตํ๋๊ฐ
[๋ฆฌ๋ทฐ]2030 ์ถ์ ์ ํ
[๋ฆฌ๋ทฐ]์ด์์ธก - ์ธ๊ณ ์ํ 8์ธ์๊ฒ ์ธ๋ฅ์ ๋ฏธ๋๋ฅผ ๋ฌป๋ค
Settings
Network ๊ตฌ์ฑ
Hyperledger
BlockChain
Bitcoin
Anchor Peer
Hyperledger Fabric Nonce
Gossip Protocol
CA(Certificate Authority)
Settings
PoW (์์ ์ฆ๋ช , Proof of Work)
Public BlockChain
๊ธฐ์กด ํฌ์คํธ ๊น์ง๋ orderer์ ํ์ ์ solo๋ก์ kafka ๋๊ณ ์งํํ์ต๋๋ค. ์ด๋ฒ ํฌ์คํธ์์๋ raft๋ฅผ ์ด์ฉํด์ ๋ง๋ค์ด ๋ณด๊ฒ ์ต๋๋ค.
Orderer.example.com
๊ธฐ์กด ํฌ์คํธ ๊น์ง๋ orderer์ ํ์ ์ solo๋ก ๋๊ณ ์งํํ์ต๋๋ค. ์ด๋ฒ ํฌ์คํธ์์๋ kafka๋ฅผ ์ด์ฉํด์ ๋ง๋ค์ด ๋ณด๊ฒ ์ต๋๋ค.
docker-compose -f docker-compose-kafka.yaml up
Network ๊ตฌ์ฑ
docker-compose -f docker-compose-cli.yaml up
Network ๊ตฌ์ฑ
์ด ํฌ์คํธ๋ Hyperledger Korea User Group์์ ๋ง๋ ๊ธ์ ๋ฐํ์ผ๋ก ๋ง๋ค์์ต๋๋ค.
Hyperledger
์ด ํฌ์คํธ๋ฅผ ์ฝ์ผ์๋ ๋ถ์ ์ํํธ์จ์ด ๋ง์์คํธ๋ก์ ๋ํด ๋ง์ ๊ด์ฌ์ด ์์๊ฑฐ๋ผ๊ณ ์๊ฐํฉ๋๋ค.
์ฌ์ง์ ์ถํ ์ ๋ฐ์ดํธ ํ๊ฒ ์ต๋๋ค. !
SW Maestro ์ฐ์์ ์ผ์
JSTL ๋ฌธ๋ฒ ํบ์๋ณด๊ธฐ -5- JSTL functions
JSTL ๋ฌธ๋ฒ ํบ์๋ณด๊ธฐ -4- JSTL XML
JSTL ๋ฌธ๋ฒ ํบ์๋ณด๊ธฐ -3- JSTL sql
JSTL ๋ฌธ๋ฒ ํบ์๋ณด๊ธฐ -2- JSTL fmt
JSTL ๋ฌธ๋ฒ ํบ์๋ณด๊ธฐ -1- JSTL core
Spring Boot Banner ๋ฌธ๊ตฌ ๋ณ๊ฒฝํ๊ธฐ
Spring Boot AOP ๋ฅผ ์ด์ฉํ์ฌ ๋ก๊ทธ๋ฅผ ์์ฑํ๊ณ ELK ์คํ ์ฐ๋ -1-
Spring Boot AOP ๋ฅผ ์ด์ฉํ์ฌ ๋ก๊ทธ๋ฅผ ์์ฑํ๊ณ ELK ์คํ ์ฐ๋ -2-
Spring Boot Tiles ์ค์ ํ๊ธฐ
VM (Virtual Machine)
Install Docker
์ด์ ์ Goorm์ ์ฌ์ฉํ๋๋ฐ Docker๋ฅผ ๋ณด์์์ ์ด์ ๋ก ์ฌ์ฉ์ ์ ํํด ๋จ์ต๋๋ค. ๊ทธ๋์ ๋ถ๋์ดํ๊ฒ Docker๋ก ๋ฐฐํฌํ๋ ๋ถ๋ถ๋ง AWS์์ ์์ ํ๊ฒ ์ต๋๋ค.
๊ฐ๋ฐํ๊ธฐ์ ์์ https://i.kakao.com/login ์ฌ๊ธฐ์ ๊ฐ๋ฐ ์ ํด ์ ์ฒญ์ ํ์๊ณ ์งํํ์ ์ผ ํฉ๋๋ค.
๊ธฐ์กด ๊ฐ๋ฐ ์์คํ
ํ๊ฒฝ ๊ตฌ์ฑ์ ์๋ 1, 2 ๋ฅผ ๋ชจ๋ ํด๊ฒฐํ์ ํ ์งํํ์๋ฉด ๋๊ฒ ์ต๋๋ค.
Wildfly Standalone ๋ฐฉ์์ผ๋ก ์ค์ ํ๊ฒ ์ต๋๋ค.
Load Balancing ์ ๋ํ ๊ฐ๋ ์ ๋ชจ๋ฅด์ ๋ค๋ฉด Load Balancing ํฌ์คํธ๋ฅผ ๋ณด์๋ฉด ๋ฉ๋๋ค.
WEB ๊ณผ WAS ์ ์ฐจ์ด์ ๊ฐ๋ ์ ์ ํํ๊ฒ ๋ชจ๋ฅด์ ๋ค๋ฉด WEB / WAS ์ ์ฐจ์ด ํฌ์คํธ๋ฅผ ๋ณด์๋ฉด ๋ฉ๋๋ค.
netstat Overview
traceroute Overview
INNER JOIN
ํ๋ธ๋ฃจ(Homebrew)๋ ์์ -์คํ ์์ค ์ํํธ์จ์ด ํจํค์ง ๊ด๋ฆฌ ์์คํ ์ ๋๋ค. ๊ฐ๋ฐ์ ์ ์ฅ์์ ๋งฅ OS ๋ฅผ ์ฌ์ฉํ๋ฉด ์ป๊ฒ๋๋ ํฐ ์ด์ ์ค ํ๋๊ฐ ์ด Homebrew ์ ๋๋ค.