资料结构小考解答.ppt

資料結構第一次小考解答 1.(16%)Determine whether the following statements are correct 以定義判斷 10nlogn+12n2+8n ≤ C(n2) 存在 C=22, n0 = 2 當n ≧n0 時, 10nlogn+12n2+8n ≤ C(n2)成立 本題為True 找等式左邊成長速度最快的是不是3n 15n3n常數乘法可以忽略 只討論n3n n3n比3n成長速度還快 ,所以本題為False 找等式左邊成長速度最快的是不是 nlogn 5n2常數乘法可以忽略 只討論n2 n2比nlogn成長速度還快 ,所以本題為False 以定義判斷 8n5+3n≧C(2n) 存在 C=1, n0 = 1 當n ≧n0 時, 8n5+3n≧C(2n)成立 本題為True 2.(10%)Compute the failure function for pattern “aabaababaa” failure function初始值為-1 與前一項『 failure function 值+1』項做比較 ?相等 :failure function = 前一項『 failure function 值+1』 ?不相等: failure function= -1 3.(10%) Please write an algorithm to calculate the result of a postfix expression. Algorithm定義 1.一定要有Input 2.每一指令清楚說明要做什麼 3.在有限的步驟結束 本題解答 由左到右讀取 post expression 3分 當讀取到數字則push進stack 3分 當讀取到運算符號,pop出兩個數字並做運算,再把結果push進stack 4分 4.(10%) Please analyze the time complexity (in terms of q()) of the following program. ? int F(int n) { int x=n; +1 if (n=1) +1 return n; +1 else +1 {for (int i=0; i n; i++) +( n+1 ) x=x+i; +n return x; }} +1 5.If following declaration is used to implement a “circular queue”, please answer the following questions.int queue[MAX_QUEUE_SIZE];int front,rear; a.(4%) Initially, what values will you assign to front and rear? Front = Rear = 0 各2分? b.(10%) When inserting and deleting, please state the equations that you use to change the values of front and rear. 寫出insert和delete時 rear 跟front的通式 為了防止超出Queue的範圍 需mod 最大容量 Insert: rear = (rear + 1) % [MAX_QUEUE_SIZE]; 5分 delete: front = (front + 1) % [MAX_QUEUE_SIZE]; 5分 c.(6%) How do you judge the queue is