同上篇 .... 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