Pre-requisite Host Machine Environment $ uname -a Linux elinlinux 5.4.0-169-generic #187-Ubuntu SMP Thu Nov 23 14:53:38 UTC 2023 aarch64 aarch64 aarch64 GNU/Linux Target Machine Environment Board: BeagleBone Black processor: Sitara XAM3359AZCZ100 Cortex A8 ARM FTDI USB to Serial cable

Contributed by < Eric Lin > Source code: https://github.com/ericlinsechs/filter Aim Explain how to implement these image filters in C:Grayscale Conversion Horizontal Reflection Image Blurring Edge Detection Background

contributed by < Eric Lin > It is a report for the course quiz. Aim Implements hashtables to solve Two sum. Understand how the hashtables are implemented in Linux. Hash struct introduction hash_table

contributed by < Eric Lin > Aim Refer source code from Jserv's Linux Kernel Internals to solve Longest Consecutive Sequence. Describe how the code works. code implementation Data structure Use circular doubly-linked list structure from include/linux/types.h:

contributed by < Eric Lin > Aim Introduce Least recently used (LRU). Refer source code from Jserv's Linux Kernel Internals to solve LRU Cache. Describe how the code works. Least recently used (LRU) Least recently used (LRU) is one of the Cache replacement policies. Caching improves performance by keeping recent or often-used data items in memory locations which are faster, or computationally cheaper to access, than normal memory stores. When the cache is full, the algorithm must choose which items to discard to make room for new data. And LRU discards least-recently-used items first.

contributed by < Eric Lin > Environment Host OS: ubuntu 20.04 Arch: arm64 Target OS: Linux 5.10.198 Arch: x86_64

contributed by < Eric Lin > lab0 is a homework of the course Linux 核心設計/實作 by jserv My fork: lab0-c Original source code: lab0-c :::info This lab aims to assessing one's C Programming Skills. Some of the skills tested are:

contributed by < Eric Lin > Overview The technique used to detect \0 character by strlen in IOS: Laligned_loop: /* ((x - 0x01010101) & ~x & 0x80808080) == hasnull(word) */ sub r3, r2, r1 /* x - 0x01010101 */ bic r3, r3, r2 /* above & ~x */ tst r3, r1, lsl #7 /* above & 0x80808080 */

contributed by < Eric Lin > Half adder Overview A half adder is a fundamental digital circuit that computes the sum S and carry C outputs based on two input bits. The carry signal represents an overflow into the next digit of a multi-digit addition. The formula for the sum and carry is as follows: $S = A \oplus B$

contributed by < Eric Lin > Aim Provide solutions for the LeetCode 82. Remove Duplicates from Sorted List II Recursive method line 13: If the next node exists and its value is not a duplicate, proceed to line 20. line 15: When a duplicate value is found, skip the current node and advance to the next node in the list. line 17: After skip all consecutive nodes with the same value, continue traversing the remaining nodes of the linked list. line 20: Establish links for the subsequent nodes in the processed list.