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 ? Use ifconfig command

一、前言 背景是應屆聯合大學資工夜校，高中讀台中市立大甲高中。我平日白天有上班，就在當牛馬的過程中漸漸體會到學歷的優勢，因此萌發了考研的想法，一開始也不太相信自己能考上，也是身邊剛好有朋友也在準備資工所，因此我四月份就跟他去了補習班，起初我超沒自信的，所以就先半工半讀 (因為我的工作機會難得，對於大學生的我來說待遇非常好)，目標訂在師大資工所，後來看了看歷屆考古題發現竟然能看懂一些，就越來越有信心，果斷在去年七月份辭職當全職考生，一路上準備的過程還蠻煎熬的，深怕自己辭職後又沒考上兩頭空，好險最後有堅持走完。可能也是我媽在考前還幫我點了文昌燈加持，使我考運還不錯，也讓我有學校唸。 二、成績 學校 數學 軟體 硬體 結果

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 <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

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

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

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>