Data Structure

                   Spring 2007

                                     課上發問次數記錄 :  唐老師班    張老師班

                                     Q1: magic squre if n is even (920932)

                                     Q2: figure 3.16中stack應該清空 (920932)

                                     Q3: explain lg(n+1)  (940942)

                                     Q4: 若想自訂多項式的data type要如何定義才能保證自己訂的abstrct data type 可以完成所有形式的運算 (941536)

                                     Q5: 問strcpy (942073)

                                     Q6: 字串比對問題 (9562102)

                                     Q7: circular link和chain串接的差別 (9562102)

                                     Q8: P8 compare(x,y) NP. Complete (9562109)

                                     Q9: figure 3.15 & 3.16是否運算元優先順序低於上一個時必先pop出來 (9562109)

                                     Q10: incoming precedence和instack precedence於中序轉前序的問題 (9562109)

                                     Q11: max heap (9562144)

                                     Q12: call by value; call by reference & if 敘述 (9562145)

                                     Q13: short int跟int的區別 (9562227)

                                     Q14: max heap (9562227)

                                     Q15: question about "done" at page 161 (9562228)

                                     Q16: infix->postfix先堆*再堆+; "+"會pop出嗎 (9562307)

                                     Q17: marco expension (9562311)

                                     Q18: 問typedef問題 (9562329)

                                     Q19: pass by value (9562336)

                                     Q20: avail為何不用circular link?  (9562336)

                                     Q21: equivelence algorithm為何不用tree DS做 (9562336)

                                     Q22: 回答魔術方陣問題 (9562338)

                                     Q23: 問複雜度問題 (9232065)

                                     Q24: 問lg(n+1)問題 (9232065)

                                     Q25: 指出課本錯誤 (9232065)

                                     Q26: 比較array, stack, queue

                                         A: array size 較為受限 (9562229)

                                     Q27: 比較array, stack, queue

                                         A: linked list 對於insert, delet較為便利，linked list 中的pointer相對於array較為 redundant, information density 較低。 (9562209)

                                     Q28: 建heap為什麼要用array, 不用linked list

                                         A: 因為heap為complete binary tree的結構，可引用 Lemma 5.3 來尋找 parent, children的關係 (9562326)

                                     Q29: U-array的FindMax都已經 Θ(n), 為什麼Delete_Max是O(n), Delete_Max應該是比FindMax大吧？(9562229)

                                         A: Delete_Max比Find Max多一個常數項。O(n)有包括Θ(n)，不過的確用Θ(n)較適當。

                                     Q30: 何時用MSD,何時用LSD (9562320)

                                         A: 一般都用LSD, 因為用LSD比較自然。