課程名稱︰資料結構
課程性質︰工科海洋系資組必修
課程教師︰張瑞益
開課學院：工學院
開課系所︰工科海洋系
考試日期（年月日）︰2007.11.14
考試時限（分鐘）：9:10~12:00
是否需發放獎勵金：是
（如未明確表示，則不予發放）
試題 :
1.Ordering by asymptotic grown rate in descending order
{9^logN,(logN)^9,logN^9} 10%
2.(a)What is System Life circle? 10%
(b)What is Circular Array? 10%
3.Give an array of integers, Write a non-recursive binary search procedure.10%
4.Write the declaration of "class" structure which contains one "teacher" and
a linked list (with dummy head node) of "student" where "teacher" and
"student" are represented by their identification number (integers).10%
Write a procedure to read and store students identification numbers (into
the linked list) from a text-file "CLASS_S.TXT" (until it is end of file) 10%
5.Give a 2-D array x of integer ADT. It starts from x(1,1). The address of
x(2,3) is 36, the address of x(3,2) is 56 and the address of x(4,5) is 92.
What is the address of x(1000,4). 10%
(老師考試時公佈答案為16008 但後來信更正為23992 答對加分)
6.Use array to implement sparse matrix and show its fast-transpose algorithm.
10%
┌ ┐
│15 0 0 22 0 -15│
│ 0 11 3 0 0 0│
│ 0 0 0 -6 0 0│
│ 0 0 0 0 0 0│
│91 0 0 0 0 0│
│ 0 0 28 0 0 0│
└ ┘
7.Show the KMP algorithm. 10%
8.Give an inorder expression A-B-C*D-(E-F). Use the stack ADT to generate its
postfix representation. 10%
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.59.252.119
※ 編輯: miracle0722 來自: 61.59.252.119 (11/17 00:41)