阿摩線上測驗
登入
首頁
>
中山◆資工◆離散數學與演算法
>
109年 - 109 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#105755
> 申論題
8. Let T = (V,E) be a complete m-ary tree of height h. This tree is called a full m-ary tree if all of its leaves are at level h. If T is a full m-ary tree with height 7 and 279,936 leaves, how many internal vertices are there in T?
相關申論題
(a) What is the completion time of process Pi using a nonpreemptive priority (a smaller priority number implies a higher priority) scheduling?
#450074
(b) What is the average waiting time using shortest-job-first scheduling?
#450075
2. A machine has 64-bit virtual addresses and 32-bit physical addresses. Pages are 32 KB. How many entries are needed for the page table?
#450076
(a) f
#450077
(b)
#450078
4. What would be the output of the following C program that uses the Pthreads API? (Nole that the linemumbers are for reference only.)
#450079
(a) What would be the size of the smallest file allowed in bytes?
#450080
(b) What would be the size of the largest file allowed in bytes?
#450081
(a) SSTF
#450082
(b) SCAN
#450083
相關試卷
110年 - 110 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#104300
110年 · #104300
109年 - 109 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#105755
109年 · #105755
108年 - 108 國立中山大學_碩士班招生考試_資工系(資安):離散數學與演算法#105778
108年 · #105778