여행다니는 펭귄

목차 ▪ Machine ▪ Process and Thread ▪ Process synchronization ▪ Process scheduling ▪ Deadlocks ▪ Main memory ▪ Virtual memory ▪ Mass-storage structure ▪ File system ▪ I/O subsystem Q1. 어떤 교재를 사용하나요? Operating Systems: Three Easy Pieces (wisc.edu) Operating Systems: Three Easy Pieces Blog: Why Textbooks Should Be Free Quick: Free Book Chapters - Hardcover - Softcover (Lulu) - Softcover (Amazon) - B..

Chapter : CLRS 2.1 2.2 3 1. 알고리즘의 타당성 증명 2. 알고리즘의 runtime 분석과 asymptotic analysis

● Algorithmic Analysis ● Divide and Conquer ● Randomized Algorithms ● Tree Algorithms ● Graph Algorithms ● Dynamic Programming ● Greedy Algorithms ● Advanced Algorithms ● NP-completeness Jupyter notebook 을 활용하여 진행합니다.