| 9/2 |
▶ Slides
|
Week주차 1
Introduction Chapter 1: Information in Memory Introduction Chapter 1: Information in Memory 📖 p. 1-12 | |
| 9/9 |
▶ Slides
|
Week주차 2
Chapter 2: Binary Search Chapter 3: Dynamic Data Structures Chapter 2: Binary Search Chapter 3: Dynamic Data Structures 📖 p. 13-42 | GitHub File Repository
과제 → |
| 9/16🔴 No Class휴강 |
No Class Chuseok
No Class Chuseok
| ||
| 9/23 |
▶ Slides
|
Week주차 3
Chapter 4: Stacks and Queues
Chapter 4: Stacks and Queues
📖 p. 43-54 | |
| 9/30 |
▶ Slides
|
Week주차 4
Chapter 4: Breadth-First Search, Depth-First Search
Chapter 4: Breadth-First Search, Depth-First Search
📖 p. 55-74 | |
| 10/7🔴 No Class휴강 |
Chapter 5: Binary Search Trees No Class Hangul Day Chapter 5: Binary Search Trees No Class Hangul Day | ||
| 10/14📝 Exam시험 |
Linked List coding Midterm Study Guide Linked List coding Midterm Study Guide | ||
| 10/21📝 Exam시험 |
Midterm Test Midterm Test | ||
| 10/28 |
▶ Slides
|
Week주차 5
Chapter 6: Tries and Adapting Data Structures Chapter 7: Priority Queues and Heaps Chapter 6: Tries and Adapting Data Structures Chapter 7: Priority Queues and Heaps 📖 p. 75-112 | |
| 11/4 |
▶ Slides
|
Week주차 6
Chapter 8: Grids Chapter 9: Spatial Trees Chapter 8: Grids Chapter 9: Spatial Trees 📖 p. 112-170 | |
| 11/11 |
▶ Slides
|
Week주차 7
Chapter 10: Hash Tables
Chapter 10: Hash Tables
📖 p. 171-186 | |
| 11/18 |
▶ Slides
|
Week주차 8
Chapter 11: Caches
Chapter 11: Caches
📖 p. 187-198 | Coding with Stacks & Queues
과제 → |
| 11/25 |
▶ Slides
|
Week주차 9
Chapter 12: B-Trees
Chapter 12: B-Trees
📖 p. 199-224 | |
| 12/2 |
▶ Slides
|
Week주차 10
Chapter 13: Bloom Filters
Chapter 13: Bloom Filters
📖 p. 225-246 | |
| 12/9 |
▶ Slides
|
Week주차 11
Chapter 14: Skip Lists Chapter 15: Graphs Conclusion Chapter 14: Skip Lists Chapter 15: Graphs Conclusion 📖 p. 247-270 | |
| 12/16📝 Exam시험 |
Final Test Study Guide Final Test Study Guide | ||
- No formal prerequisites. Curiosity required. 공식 선수 과목 없음. 호기심 필수.
스택, 큐, 연결 리스트, 트리, 그래프 등 핵심 자료구조의 이론과 구현을 학습합니다. 커피를 테마로 한 재미있는 예제로 자료구조 개념을 익힙니다.
This course covers fundamental data structures — stacks, queues, linked lists, trees, graphs — through theory and implementation, using coffee-themed examples to make the concepts approachable.
-
★ Required교재Data Structures the Fun Way: An Amusing Adventure with Coffee-Filled ExamplesNo Starch Press | 2022년 11월 08일Buy구매 →
Aaron Snowberger earned his Ph.D. in Information and Communications Engineering from Hanbat National University in South Korea in 2023. He also holds degrees in Computer Science and Media Design. He has taught technology courses for over 8 years, English for over 15 years, and has freelanced as a web developer and magazine designer for over 5 years. His current research interests include computer vision, natural language processing, image processing, signal processing, and machine learning.
Aaron Snowberger는 2023년 한국 한밭대학교에서 정보통신공학 박사 학위를 취득했습니다. 그는 또한 컴퓨터 과학 및 미디어 디자인 학위를 취득했습니다. 그는 8년 이상 기술 과정을 가르쳤고, 15년 이상 영어를 가르쳤으며, 5년 이상 웹 개발자 및 잡지 디자이너로 프리랜서로 일했습니다. 현재 연구 관심사는 컴퓨터 비전, 자연어 처리, 영상 처리, 신호 처리, 기계 학습입니다.