活動名稱
【解題達人! We want you!】
活動說明
阿摩站上可謂臥虎藏龍，阿摩發出200萬顆鑽石號召達人們來解題!
針對一些題目可能有疑問但卻缺少討論，阿摩主動幫大家尋找最佳解!
懸賞試題多達20萬題，快看看是否有自己拿手的科目試題，一旦你的回應被選為最佳解，一題即可獲得10顆鑽石。
懸賞時間結束後，只要摩友觀看你的詳解，每次也會得到10顆鑽石喔!
關於鑽石
如何使用:
- ✔懸賞試題詳解
- ✔購買私人筆記
- ✔購買懸賞詳解
- ✔兌換VIP
(1000顆鑽石可換30天VIP) - ✔兌換現金
(50000顆鑽石可換NT$4,000)
如何獲得:
- ✔解答懸賞題目並被選為最佳解
- ✔撰寫私人筆記販售
- ✔撰寫詳解販售(必須超過10讚)
- ✔直接購買 (至站內商城選購)
** 所有鑽石收入，都會有10%的手續費用
近期考題
1.All the following questions are multiple-choice questions. Please explain your reasons for the
choices, which you don't select. (10%)
【題組】1.3 (2%) To solve the cache coherence problem, Snoopy protocol is the simplest. Regarding the Snoopy coherence protocol, what is the following description true?
(A) Any CPU should invalidate the cache block if it receives a write miss signal to the data in the local cache block from the bus.
(B) Any CPU should invalidate the cache block if it receives a read miss signal to the data in the local cache block from the bus.
(C) The Snoopy coherence protocol is an atomic operation.
(D) The Snoopy coherence protocol is proper to apply to a single-core system.
【題組】1.3 (2%) To solve the cache coherence problem, Snoopy protocol is the simplest. Regarding the Snoopy coherence protocol, what is the following description true?
(A) Any CPU should invalidate the cache block if it receives a write miss signal to the data in the local cache block from the bus.
(B) Any CPU should invalidate the cache block if it receives a read miss signal to the data in the local cache block from the bus.
(C) The Snoopy coherence protocol is an atomic operation.
(D) The Snoopy coherence protocol is proper to apply to a single-core system.
12. 小音在購買洗髮精時，總是仔細比較所有的資訊、分析各個品牌的要求與差異，
也總會比較製造日期、沃爾瑪、家樂福、大潤發、樂購等哪一家比較便宜等資
訊。小音在洗髮精的購買行為可算是？
(A)品牌忠誠者
(B)轉換使用者
(C)低涉入程度消費者
(D)高涉入程度消費者
(A)品牌忠誠者
(B)轉換使用者
(C)低涉入程度消費者
(D)高涉入程度消費者
【非選題】
【題組】(c)Dieckmann condensation
IV. Give an’ example for each of the following name reactions, (2% each, 20%)
【題組】(c)Dieckmann condensation
Question set Il
Suppose we have a stack for storing integers. Initially, the stack is empty. We perform 10 operations
push(1),push(2), pop(), push(3),pop(), pop(),push(4), push(5), push(6), and pop(). Please answer the
following questions.
【題組】8.We use the linked-based implementation for the stack. Let the latest input be stored at the location with address in first. What is the value of first for the empty stack?
(A) first=-1；
(B) first=0；
(C)first=1；
(D) first=2.
Suppose we have a stack for storing integers. Initially, the stack is empty. We perform 10 operations
push(1),push(2), pop(), push(3),pop(), pop(),push(4), push(5), push(6), and pop(). Please answer the
following questions.
【題組】8.We use the linked-based implementation for the stack. Let the latest input be stored at the location with address in first. What is the value of first for the empty stack?
(A) first=-1；
(B) first=0；
(C)first=1；
(D) first=2.