https://yowdesert.github.io/icon.png 一起從零開始踏進這個世界 2026-09-09T15:42:00.000Z https://yowdesert.github.io/ YowDesert Hexo https://yowdesert.github.io/posts/65f4596b.html 2026-09-09T15:42:00.000Z 2026-09-09T15:42:00.000Z

<div class="table-container"> <table> <thead> <tr> <th>看到這個

https://yowdesert.github.io/posts/49207314.html 2026-09-09T15:42:00.000Z 2026-09-09T15:42:00.000Z

<h1>資工研究所常見演算法時間複雜度整理</h1> <blockquote> <p>版本：2026-09-09<br> 語言：繁體中文（zh-TW）<br> 定位：資工研究所入學考、演算法／資料結構課程、口試與複習速查<br> 主要依據：CLRS、原始論文、Princeton

https://yowdesert.github.io/posts/5bbc732a.html 2026-09-02T06:49:00.000Z 2026-09-10T02:58:53.554Z

<ul> <li>CPU產生的是Logical Address，Memory -&gt; Physical Address <ul> <li>Memory 真正使用的是Physical

https://yowdesert.github.io/posts/513a4877.html 2026-08-28T02:18:00.000Z 2026-08-29T05:58:01.728Z

<h1 id="Search-and-Sort"><a href="#Search-and-Sort" class="headerlink" title="Search and Sort"></a>Search and Sort</h1><h1 id="Search"><a

https://yowdesert.github.io/posts/917205a6.html 2026-08-25T06:49:00.000Z 2026-08-26T13:53:49.572Z

<ul> <li><strong>Single</strong> Resource RAG : Cycle &lt;=&gt; Deadlock</li> </ul> <blockquote> <p>但是多個Resources

https://yowdesert.github.io/posts/f184578f.html 2026-08-22T03:30:00.000Z 2026-08-25T04:01:54.770Z

<h1>Tree 總整理</h1> <h2 id="一、各種-Tree-關係圖">一、各種 Tree 關係圖</h2> <figure class="highlight text"><table><tr><td class="gutter"><pre><span

https://yowdesert.github.io/posts/3e53adeb.html 2026-08-21T08:12:00.000Z 2026-08-28T13:34:15.812Z

<ul> <li>Double Priority Queue <ul> <li>Insert(x)：插入任意元素</li> <li>Delete-Max：刪除最大值</li> <li>Delete-Min：刪除最小值</li> </ul> </li> <li><p>SMMH

https://yowdesert.github.io/posts/514e5281.html 2026-08-21T08:12:00.000Z 2026-08-31T13:12:38.789Z

<ul> <li>Ordered-Linked-List 就算有排序也不能直接Binary Sort</li> <li>兩個Array，大的n個，小的m個，要找兩個有沒有相同的 =&gt; $O(nlogm)$<ul> <li><code>m</code> Array 先

https://yowdesert.github.io/posts/23cf8539.html 2026-08-20T03:30:00.000Z 2026-08-25T04:01:39.078Z

<h1>Double-Ended Priority Queue</h1> <table> <thead> <tr> <th>Operation</th> <th>Time

https://yowdesert.github.io/posts/603b4b38.html 2026-08-14T09:49:00.000Z 2026-08-17T08:04:06.715Z

<ul> <li> <p>I/O Device Queue 是OS管理的</p> </li> <li> <p><strong>Timer</strong> 不在PCB裡 ， 他是用來產生Interrupt的，不是CPU使用時間資訊</p> </li> <li> <p>Which

https://yowdesert.github.io/posts/374236ea.html 2026-08-13T14:05:00.000Z 2026-08-16T04:40:30.017Z

<h1 id="Thread"><a href="#Thread" class="headerlink"

https://yowdesert.github.io/posts/6f2552db.html 2026-08-13T02:30:00.000Z 2026-08-16T15:19:27.642Z

<h1>Scheduling Critiiria and Goal</h1> <ol> <li> <p><strong>CPU utilization</strong> : Process execution time / CPU Total

https://yowdesert.github.io/posts/12e18ab3.html 2026-08-12T06:30:00.000Z 2026-08-14T16:00:48.662Z

<h1 id="Process-Management"><a href="#Process-Management" class="headerlink" title="Process Management"></a>Process Management</h1><h2

https://yowdesert.github.io/posts/96b225e3.html 2026-08-11T15:09:00.000Z 2026-08-11T15:09:58.108Z

<h1 id="各種資料結構優點整理"><a href="#各種資料結構優點整理" class="headerlink" title="各種資料結構優點整理"></a>各種資料結構優點整理</h1><h2 id="1-Array"><a href="#1-Array"

https://yowdesert.github.io/posts/1f21266d.html 2026-08-09T06:16:00.000Z 2026-08-11T15:06:12.241Z

<h1>Heap</h1> <ol> <li>MAX heap <ul> <li>complete binary tree</li> <li>父點要 <strong>大於</strong>

https://yowdesert.github.io/posts/841a1f01.html 2026-08-05T08:00:00.000Z 2026-08-14T09:52:18.242Z

<h1 id="第一章-到-第三章-題目提醒"><a href="#第一章-到-第三章-題目提醒" class="headerlink" title="第一章 到 第三章 題目提醒"></a>第一章 到 第三章 題目提醒</h1><ol> <li><p>Bootstrap

https://yowdesert.github.io/posts/978b4c60.html 2026-08-04T08:00:00.000Z 2026-08-04T15:54:30.626Z

<h1>System call</h1> <p>為User Process 與 Kernel 的溝通介面</p> <p><strong>System call 經常利用 Trap(Software Interrupt) 進入

https://yowdesert.github.io/posts/7fac9819.html 2026-08-04T07:20:00.000Z 2026-08-04T07:33:57.243Z

<h1 id="基礎建設"><a href="#基礎建設" class="headerlink" title="基礎建設"></a>基礎建設</h1><h2 id="Dual-Mode-operation"><a href="#Dual-Mode-operation"

https://yowdesert.github.io/posts/3f087bff.html 2026-04-03T05:20:00.000Z 2026-04-03T08:21:26.041Z

<h1>MIPS 暫存器架構筆記</h1> <ul> <li>所有暫存器都是 32 bits</li> </ul> <h2 id="2-CPU-暫存器分類">2. CPU 暫存器分類</h2> <p>CPU 內的暫存器可以分成兩大類：</p> <h3

https://yowdesert.github.io/posts/1460649e.html 2026-03-19T15:08:00.000Z 2026-03-19T15:46:55.659Z

<h1 id="矩陣是否可以對角化的判斷"><a href="#矩陣是否可以對角化的判斷" class="headerlink" title="矩陣是否可以對角化的判斷"></a>矩陣是否可以對角化的判斷</h1><p>對 (n \times n) 矩陣 (A)