- 資工期中超渡團·Last edited by Ianian Ian on Nov 23, 2023Linked with GitHubContributed by
There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.Read more
共同筆記封面
資工三 / 鄭宇翔 / terry25031069
Mar 14, 2025計算機結構 Computer Architecture
Chapter 1 Chapter 2 Chapter 3 Chapter 4 Chapter 5
Nov 4, 2024進階資料結構(期末)
CH 9 Heap Min-Max heap Definition A mix-max heap is a complete binary tree such that if it is not empty, each element has a field called key. Alternating levels of this tree are min levels and max levels, respectively. Let x be any node in a min-max heap. If x is on a min (max) level then the element in x has the minimum (maximum) key from among all elements in the subtree with root x. We call this node a min (max) node. example 樹中為min-heap的部分，仍需符合min-heap的特性如圖Level 1的節點鍵值，會小於Level為3的子樹(10小於19、13、18、15) 樹中為max-heap的部份，仍需符合max-heap的特性
Jan 19, 2024Embedded System Final
Mid term questions are skipped Progress: 1,2,3,4,5,6,7,8,9,10,11,12,13 (total 13) 1. Device drivers are broadly classified into two basic categories: character devices and block devices. Please individually describe them. (10%) Appeared in 99, 99_2, 101, 102, 104, 105_1, 105_2, 106, 108 Derivation Please simply describe the Device Driver concepts. (10%) 103_2驅動程式，允許High-Level的軟體與硬體溝通的程式，建立了一個硬體與硬體，或硬體與軟體溝通的介面，讓device可以交換資料。
Dec 18, 2023
HackMD