|
|
@@ -79,20 +79,20 @@ Translations:
|
|
|
- 인접행렬
|
|
|
- 인접리스트
|
|
|
- 운행: 너비우선탐색(BFS), 깊이우선탐색(DFS)
|
|
|
-- [Even More Knowledge](#even-more-knowledge)
|
|
|
- - [Recursion](#recursion)
|
|
|
- - [Dynamic Programming](#dynamic-programming)
|
|
|
- - [Object-Oriented Programming](#object-oriented-programming)
|
|
|
- - [Design Patterns](#design-patterns)
|
|
|
- - [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
|
|
|
- - [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
|
|
|
- - [Caches](#caches)
|
|
|
- - [Processes and Threads](#processes-and-threads)
|
|
|
- - [Papers](#papers)
|
|
|
- - [Testing](#testing)
|
|
|
- - [Scheduling](#scheduling)
|
|
|
- - [Implement system routines](#implement-system-routines)
|
|
|
- - [String searching & manipulations](#string-searching--manipulations)
|
|
|
+- [더 많은 지식](#even-more-knowledge)
|
|
|
+ - [재귀](#recursion)
|
|
|
+ - [동적 프로그래밍](#dynamic-programming)
|
|
|
+ - [객체 지향 프로그래밍](#object-oriented-programming)
|
|
|
+ - [디자인 패턴](#design-patterns)
|
|
|
+ - [조합 & 확률](#combinatorics-n-choose-k--probability)
|
|
|
+ - [NP, NP-완전 and 근사 알고리즘](#np-np-complete-and-approximation-algorithms)
|
|
|
+ - [캐쉬](#caches)
|
|
|
+ - [프로세스와 쓰레드](#processes-and-threads)
|
|
|
+ - [논문](#papers)
|
|
|
+ - [테스팅](#testing)
|
|
|
+ - [스케쥴링](#scheduling)
|
|
|
+ - [시스템 루틴의 구현](#implement-system-routines)
|
|
|
+ - [문자열 검색 & 조작](#string-searching--manipulations)
|
|
|
- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
|
|
|
- [Final Review](#final-review)
|
|
|
- [Coding Question Practice](#coding-question-practice)
|
Keonil Kim