contributed by < brian049 > GitHub 實驗環境 $ gcc --version gcc (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0 $ lscpu Architecture: x86_64

contributed by < brian049 > 閱讀〈因為自動飲料機而延畢的那一年〉的啟發 閱讀心得 最為感觸的是「你該學習的不是看到事情要完蛋了就去避免失敗，而是應該學習如何處理與承受失敗，你才能變得比以前更強大。」，對我來說如果在遇到困難時會不禁胡思亂想我這樣作是否是正確的前進方向，或是其實我在一開始就選錯路線前進？就會因為害怕失敗不敢前進或是躊躇不前，事實上目標就在那裡，遇到困難想辦法解決而不是逃避，最後會走到目的地。 教材疑問 什麼情況下使用 workqueue,什麼情況下使用 tasklet? tasklet 建構在 softirq 之上

contributed by <brian049> Quiz 3 測驗三 在測驗三當中針對 ilog 有三種版本，第一種版本透過不斷向右位移二進位位元來計算以 2 為底的對數。 int ilog2(int i) { int log = -1; while (i) {

contributed by < brian049 > Modify queue.[ch] :::danger Enhance your English writing by making the report's structure more cohesive. Start each paragraph by summarizing its motivation and purpose. Got it. I would add additional information after I finish all parts of queue.c. :warning: No! Before developing any C code, you should put your ideas and findings in writing. When you are fine-tuning the code, you should also include your observations. :::

contributed< brian049 > Quiz1 測驗 1 Optimized QuickSort — C Implementation (Non-Recursive) 填空及解釋運作原理 list_tail 函式藉由 while 迴圈迭代來找到 list 的尾端。 node_t *list_tail(node_t **left)