[課業]97學年資料結構期中考

[gingkoginkgo (拉拉)]

同上篇 ....


97學年第一次資料結構期中考

1.
In an array declared as A[50][40][30],the address for A[0][0][0] is α .
What are the address for A[10][15][20] in row major
and in column major respectively ?(6%)

2.
State the difference between a stack and a queue ?(4%)

3.
Suppose a binary tree with depth k ;
what are the maximum number of nodes on level i of the binary tree ,
and the maximum number of nodes of binary tree ?(6%)

4.
What are static and dynamic memory allocations ?
And discuss their advantages and disadvantages. (12%)

5.
Convert the following infix expressions into prefix
and postfix expressionss.(12%)
(a)A*B+C>D/E||F     (b)++A+B*(C-D)/E

6.
Give an alorithm to evaluate a prefix expression.(10%)

7.
Decribe the preorder,inorder,postorder and level-order algorithms
for traversing a binary tree .
And write results with these algorithms for the following binary tree.(20%)

8.
Construct a max heap and draw the results for the following operations;(15%)
(a)insert with following order 17,23,33,41,26,10,16
(b)then delete a node form the heap in (a)
(c)and then insert 36,55 in (b)

9.
Construct a binary search tree and draw the results
for the following operations;(15%)
(a)insert with the following order 50,70,40,30,60,100,150,45,20,10
(b)delete 150 in (a)
(c)delete 90 in (b)
(d)and then delete 20 in (c)



--
唸書真的是一件美好的事情
一點一點 覺得腦袋更加充實了點 真的有抓住什麼東西的感覺
和電玩帶給人的愉悅 是兩種不同層次的享受
想知道更多更多 想要更清楚所有的一切
更加的了解這個世界和人事物 它的運轉 它的架構 它的關係 它的演變 它所有的所有
一種純粹而美好的乾淨欲望

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 120.127.36.141
推 didi12252001:幹  原文  我倒了
推 tsj20719:不要急著倒坦..老師會幫你翻譯(如果你有問的話
→ gingkoginkgo:去年有個學長...每一題都問....XD
推 jerry771210:那個人蠻高的還有打系籃
→ aeolus1215:是有點腦__的那個嘛?
→ jerry771210:       瘤