阿摩線上測驗
登入
首頁
>
研究所、轉學考(插大)◆資訊工程概論
>
110年 - 110 國立臺灣科技大學_碩士班招生試題_資訊工程系:資訊工程概論#100775
> 申論題
題組內容
4. Answer the following questions. (20%)
(a)Write down the RAID levels of the following schemes. (I) Mirrored disks, (ii) non-redundant striping, (iii) bit-interleaved parity, and (iv) block-interleaved distributed parity. (4%)
相關申論題
(b) CPU scheduling decides which process in the queue is to be allocated the CPU. FCFS (first-come, first-served), SJF (shortest-job-first), Priority, and RR (round- robin) are four basic scheduling algorithms. Which one(s) of them could result in starvation? (4%)
#422074
(c) A deadlock situation can occur if four necessary conditions hold simultaneously. Which one(s) of the following belongs to these conditions? (i) Mutual execution, (li) hold and wait, (ili) critical section, (iv) circular wait, and (v) equal allocation. (5%)
#422075
(d) Consider a system consisting of 11 resources of the same type, being shared by n processes. Each process may need at most 3 of these resources at the same time. What is the maximum value of n that keeps the system deadlock free? Explain your answer to receive full credit. (7%)
#422076
(a) Use the first-fit algorithm to place processes of size 220 KB, 420 KB, 120 KB, 380 KB, and 90 KB (in order). Which one(s) will be placed in the partition of 500 KB? Which one(s) will be placed in the partition of 300 KB? (7%)
#422077
(b) Now use the best-fit algorithm to place the above processes. Which one(s) will be placed in the partition of 500 KB? Which one(s) will be placed in the partition of 300 KB? (7%)
#422078
(a) Give the prefix expression for the following expression. (3%) A*(B+C)/D-E
#422079
(b) What is the post-order traversal of the following tree? (4%)
#422080
(c) What is the minimum and maximum number of nodes in a complete binary tree of height h? (6%)
#422081
(d) Draw the binary min heap that results from inserting 12, 9, 14, 16, 4, 17, 6, 8, 2 in that order into an initially empty binary heap. Draw the final tree. (10%)
#422082
(e) Remove the first two smallest values from the heap created in (d) and reconstruct the min heap. Draw the resulting tree. (5%)
#422083
相關試卷
110年 - 110 國立臺灣科技大學_碩士班招生試題_資訊工程系:資訊工程概論#100775
110年 · #100775