{"id":13757411,"url":"https://github.com/Seogeurim/CS-study","last_synced_at":"2025-05-10T05:32:13.108Z","repository":{"id":42109559,"uuid":"325462800","full_name":"Seogeurim/CS-study","owner":"Seogeurim","description":"🌎 진정한 컴퓨터공학도가 되기 위한 우리들의 지식 정리 공간 💥","archived":false,"fork":false,"pushed_at":"2023-03-14T04:45:58.000Z","size":19992,"stargazers_count":1232,"open_issues_count":2,"forks_count":120,"subscribers_count":8,"default_branch":"main","last_synced_at":"2025-04-08T20:18:12.622Z","etag":null,"topics":["algorithm","computer-science"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Seogeurim.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2020-12-30T05:25:24.000Z","updated_at":"2025-04-08T13:00:08.000Z","dependencies_parsed_at":"2024-01-15T03:41:38.686Z","dependency_job_id":null,"html_url":"https://github.com/Seogeurim/CS-study","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Seogeurim%2FCS-study","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Seogeurim%2FCS-study/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Seogeurim%2FCS-study/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Seogeurim%2FCS-study/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Seogeurim","download_url":"https://codeload.github.com/Seogeurim/CS-study/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253371076,"owners_count":21897998,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","computer-science"],"created_at":"2024-08-03T12:00:37.076Z","updated_at":"2025-05-10T05:32:09.790Z","avatar_url":"https://github.com/Seogeurim.png","language":"Java","readme":"# Basic Knowledge of Computer Science\n\n\u003e Since 2020.09.04\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://user-images.githubusercontent.com/22045163/111120575-d9370f00-85ae-11eb-8fa3-54f47ed3caa3.png\" alt=\"coding\" width=\"150px\" /\u003e\n\u003c/p\u003e\n\n## Table of Contents\n\n- [About](#about)\n  - [Repository Rule](#repository-rule)\n  - [Collaborator](#collaborator)\n  - [Reference](#reference)\n- [Data Structure (자료구조)](#data-structure-자료구조)\n- [Algorithm (알고리즘)](#algorithm-알고리즘)\n- [Operating System (운영체제)](#operating-system-운영체제)\n- [Database (데이터베이스)](#database-데이터베이스)\n- [Network (네트워크)](#network-네트워크)\n- [Design Pattern (디자인 패턴)](#design-pattern-디자인-패턴)\n- [Software Engineering (소프트웨어 공학)](#software-engineering-소프트웨어-공학)\n- [Language](#language)\n\n## About\n\n알고리즘과 CS 기초 지식의 이론부터 구현까지, 컴퓨터공학 전공자 및 예비 개발자로서 알아야 할 필수 전공 지식들을 공부하고 기록한 저장소입니다. 매주 스터디한 흔적인 **발표 자료**들이 업로드되어 있으며, 더 나아가 **글**로, **질의응답** 형태로 문서화하는 것을 목표로 합니다.\n\n### Repository Rule\n\n\u003e [CS-study Repo 가이드](https://www.notion.so/CS-study-Repo-3428a7e4213345ffa08362c7abea8528)\n\n- **주제별 정리** : 이론정리, 구현, 자료업로드, 질의응답\n- **Commit convention rule** : [대주제] 소주제 분류(이론정리/구현/...) _ex) [DataStructure] Stack 자료정리_\n- **Branch naming convention** : 대주제/닉네임 _ex) DataStructure/Nickname_\n\n### Collaborator\n\n\u003cp\u003e\n\u003ca href=\"https://github.com/KimKwon\"\u003e\n  \u003cimg src=\"https://github.com/KimKwon.png\" width=\"100\"\u003e\n\u003c/a\u003e\n\u003ca href=\"https://github.com/Seogeurim\"\u003e\n  \u003cimg src=\"https://github.com/Seogeurim.png\" width=\"100\"\u003e\n\u003c/a\u003e\n\u003ca href=\"https://github.com/yoongoing\"\u003e\n  \u003cimg src=\"https://github.com/yoongoing.png\" width=\"100\"\u003e\n\u003c/a\u003e\n\u003ca href=\"https://github.com/3people\"\u003e\n  \u003cimg src=\"https://github.com/3people.png\" width=\"100\"\u003e\n\u003c/a\u003e\n\u003ca href=\"https://github.com/JuseobJang\"\u003e\n  \u003cimg src=\"https://github.com/JuseobJang.png\" width=\"100\"\u003e\n\u003c/a\u003e\n\u003ca href=\"https://github.com/Hee-Jae\"\u003e\n  \u003cimg src=\"https://github.com/Hee-Jae.png\" width=\"100\"\u003e\n\u003c/a\u003e\n\u003ca href=\"https://github.com/ggjae\"\u003e\n  \u003cimg src=\"https://github.com/ggjae.png\" width=\"100\"\u003e\n\u003c/a\u003e\n\u003c/p\u003e\n\n### Reference\n\n- [JaeYeopHan/Interview_Question_for_Beginner](https://github.com/JaeYeopHan/Interview_Question_for_Beginner)\n- [gyoogle/tech-interview-for-developer](https://github.com/gyoogle/tech-interview-for-developer)\n- [WeareSoft/tech-interview](https://github.com/WeareSoft/tech-interview)\n- [jobhope/TechnicalNote](https://github.com/jobhope/TechnicalNote)\n\n## Data Structure (자료구조)\n\n### [📖 정리노트](./contents/data-structure)\n\n#### 기본 자료 구조\n\n- Array\n- Linked List\n- Stack\n- Queue\n- Tree\n- Binary Tree\n- Graph\n\n#### 응용 자료 구조\n\n- Deque\n- Heap \u0026 Priority Queue\n- Indexed Tree (Segment Tree)\n- Trie\n\n[🔝 목차로 돌아가기](#table-of-contents)\n\n## Algorithm (알고리즘)\n\n### [📖 정리노트](./contents/algorithm)\n\n#### 알고리즘 기본\n\n- 시간복잡도와 공간복잡도\n- 완전 탐색 알고리즘 (Brute Force)\n  - DFS와 BFS\n  - 순열, 조합, 부분집합\n- 백트래킹 (Backtracking)\n- 분할 정복법 (Divide and Conquer)\n- 탐욕 알고리즘 (Greedy)\n- 동적 계획법 (Dynamic Programming)\n\n#### 알고리즘 응용\n\n- 정렬 알고리즘\n- 그래프\n  - 최단 경로 알고리즘\n  - Union Find \u0026 Kruskal\n- 두 포인터 (two-pointer)\n- 문자열 처리 알고리즘\n  - KMP 알고리즘\n\n[🔝 목차로 돌아가기](#table-of-contents)\n\n## Operating System (운영체제)\n\n### [📖 정리노트](./contents/operating-system)\n\n- 프로세스와 스레드\n- 멀티 프로세스와 멀티 스레드\n- 프로세스 스케줄링\n- CPU 스케줄링\n- 동기와 비동기의 차이\n- 프로세스 동기화\n- 메모리 관리 전략\n- 가상 메모리\n- 캐시\n\n[🔝 목차로 돌아가기](#table-of-contents)\n\n## Database (데이터베이스)\n\n### [📖 정리노트](./contents/database)\n\n- 데이터베이스\n- 정규화\n- Index\n- Transaction\n- NoSQL\n\n[🔝 목차로 돌아가기](#table-of-contents)\n\n## Network (네트워크)\n\n### [📖 정리노트](./contents/network)\n\n- OSI 7 계층\n- TCP 3-way-handshake \u0026 4-way-handshake\n- TCP 와 UDP\n- HTTP 요청 방식 - GET, POST\n- HTTP 와 HTTPS\n- DNS round robin 방식\n- 웹 통신의 큰 흐름\n\n[🔝 목차로 돌아가기](#table-of-contents)\n\n## Design Pattern (디자인 패턴)\n\n### [📖 정리노트](./contents/design-pattern)\n\n- 디자인 패턴의 개념과 종류\n- Singleton 패턴\n- Factory 패턴\n- MVC 패턴\n\n[🔝 목차로 돌아가기](#table-of-contents)\n\n## Software Engineering (소프트웨어 공학)\n\n### [📖 정리노트](./contents/software-engineering)\n\n- 프로그래밍 패러다임\n  - 명령형 프로그래밍 vs 선언형 프로그래밍\n  - 함수형 프로그래밍\n  - 객체지향 프로그래밍\n- 애자일 개발 프로세스\n\n[🔝 목차로 돌아가기](#table-of-contents)\n\n## Language\n\n### [📖 정리노트](./contents/language)\n\n- Java\n- C++\n\n[🔝 목차로 돌아가기](#table-of-contents)\n","funding_links":[],"categories":["Lecture"],"sub_categories":["Overall"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FSeogeurim%2FCS-study","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FSeogeurim%2FCS-study","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FSeogeurim%2FCS-study/lists"}