contributed by < JimmyChongz > :::danger 注意細節 ::: 閱讀〈因為自動飲料機而延畢的那一年〉的啟發 看完作者製作自動飲料機的心路歷程後，我深刻體會到「不輕易放棄」有多難。當困難接踵而至時，選擇放棄很簡單，但我會因為放棄而失去解決問題與累積經驗的機會，若未來有人問我：「在你的求學或工作經驗中，遇過最大的挑戰是什麼？你是如何克服的？」我可能會因為當初的退縮而無話可說。 <s>我覺得這堂課的作業內容對我來說難度頗高</s> ，目前完成度最高的作業是作業一，在寫作業的過程中，我意識到我還有太多東西要補，搞不清楚自己到底要先補哪一個，且我使用 LLM 的機率很高，當我遇到問題時，都習慣先問 LLM，因為它能夠馬上給我「符合邏輯」的解釋，讓我能夠免強跟上作業繳交進度，但這就是為了交作業而交作業，並沒有真的學到東西，這部分我需要改變心態，應先把一件事做好再做另一件事。

contributed by <JimmyChongz> 安裝 Ubuntu 24.04 在 Windows 11 安裝 Ubuntu 24.04.1 LTS 環境 $ lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description: Ubuntu 24.04.2 LTS

C 語言規格書 Data Types 資料型態 Size (Byte) 格式 (unsigned) short 2 %d

contributed by < JimmyChongz > :::danger 注意書寫規範！ ::: ksort 閱讀 LKMPG 嘗試插入 Hello World Module 到 Kernel 確認 Linux 核心版本

Contributed by <JimmyChongz> Quiz 3 測驗一 Accuracy VS Precision 參考 精度和精度 (Accuracy and Precision) Accuracy 準確度測量出的數據有多接近正確的數值 Precision 精密度

Module 1 secure shell headless disconnect keyboard, mouse and screen Secure SHell deamon (SSHD) Deamon is a generic term on Unix Linux machines that is just a process that is forever running in the background waiting for something happen. How to get your Raspberry Pi IP address ? $ ifconfig

contributed by <JimmyChongz> 第一週課堂測驗 測驗一 解釋 list_insert_before 運作原理 老師說明 宣告一個指標 p，指向 head 指標 ~[圖一]~，透過 for 迴圈依序指向每一個節點的 next 指標 (也就是指向下一個 node 的指標)，直到 *p (指向下個節點的指標) 為 before 跳出回圈~[圖二]~。此時，將 p 指向的指標 Node2->next（即*p ） 改指向 item~[圖三]~。 圖一： list_item_t **p = &l->head;

contributed by <徐崇智> Quiz1 - Problem C C implementation of __builtin_clz :::warning In the case where x = 0, the result is undefined according to the GCC documentation, so we cannot allow 0 to be used as an input to the my_clz function. ::: Example For x = 1Binary representation of 1 is 0000 0000 0000 0000 0000 0000 0000 0001

Part A Mathematical Functions Task 1: ReLU In this part, we need to iterate through the entire input array. For each element in the array that is less than zero, we should change it to zero, ensuring that all elements in the input array are non-negative. Tsak 2: ArgMax In this approach, we begin by assuming the first element of the input array is the maximum value. Starting from the second element, we iterate through each element in the array. At each step, we compare the current element with the current maximum value. If the current element is larger, we update the maximum value accordingly. This process continues until we have examined all elements in the array, leaving us with the maximum value of the input array. Task 3.1: Dot Product In this section, there are two input arrays, and we need to calculate the precise offset for each element in the arrays. It’s important to also consider the stride of each array. For example:

Reference: https://ivonblog.com/posts/windows11-ubuntu2204-dual-boot/ https://ivonblog.com/posts/ubuntu-fcitx5/ 騰出空間來裝 Ubuntu 在不刪除Windows 11資料的情況下安裝Ubuntu，需要準備空間給Ubuntu安裝。 右鍵點選 Windows 圖示，點選磁碟管理。 對目前使用的磁碟(C槽)按右鍵，點選壓縮磁碟。 輸入壓縮 65536 MB ( 1024MB x 64 = 64GB ) 或更多。

contributed by <JimmyChongz>