


全文預(yù)覽已結(jié)束
下載本文檔
版權(quán)說(shuō)明:本文檔由用戶(hù)提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)
文檔簡(jiǎn)介
浙江工業(yè)大學(xué)2003年數(shù)據(jù)結(jié)構(gòu)試卷 2003 Data Structure Test (120 minutes)Class: Student Number: Name: No.12345678TotalMark1.Single-Choice(20 points)(1) The Linked List is designed for conveniently b data item.a. getting b. inserting c. finding d.locating(2) Assume a sequence list as 1,2,3,4,5,6 passes a stack, an impossible output sequence list Is c .a. 2,4,3,5,1,6 b.3,2,5,6,4,1 c.1,5,4,6,2,3 d.4,5,3,6,2,1(3) A queue is a structure not implementing b .a. first-in/first-out b. first-in/last-out c. last-in/last-out d. first-come/first-serve(4) Removing the data item at index i from a sequential list with n items, d items need to be shifted left one position.a. n-i b. n-i+1 c. i d. n-i-1 (5) There is an algorithm with inserting an item to a ordered SeqList and still keeping the SeqList ordered. The computational efficiency of this inserting algorithm is c .a. O(log2n) b. O(1) c. O(n) d.(n2)(6) The addresses which store Linked List d .a. must be sequential b. must be partly sequential c. must be no sequential d. can be sequential or discontiguous(7) According the definition of Binary Tree, there will be b different Binary Trees with 5 nodes.a. 6 b. 5 c. 4 d. 3(8) In the following 4 Binary Trees, c is not the complete Binary Tree. a b c d(9) A Binary Tree will have a nodes on its level i at most.a.2i b. 2i c.2i+1 d.2i-1(10) If the Binary Tree T2 is transformed from the Tree T1, then the postorder of T1 is the b of T2. a. preorder b. inorder c. postorder d. level order(11) In the following sorting algorithm, c is an unstable algorithm.a. the insertion sort b. the bubble sort c. quicksort d. mergesort(12) Assume there is a ordered list consisting of 100 data items, using binary search to find a special item, the maximum comparisons is d .a. 25 b.1 c. 10 d.7(13) The result from scanning a Binary Search Tree in inorder traversal is in c order.a. descending or ascending b. descending c. ascending d. out of order(14) The d case is worst for quicksort.a. the data which will be sorted is too larger.b. there are many same item in the data which will be sorted .c. the data will be sorted is out of order d. the data will be sorted is already in a sequential order.(15) In a Binary Tree with n nodes, there is a non-empty pointers.a. n-1 b. n+1 c. 2n-1 d.2n+1(16) In a undirected graph with n vertexs, the maximum edges is b .a. n(n+1)/2 b. n(n-1)/2 c. n(n-1) d.n2(17) The priority queue is a structure implementing c .a. inserting item only at the rear of the priority queue.b. inserting item only at the front of the priority queue.c. deleting item according to the priority of the item.d. first in/first out(18) The output from scanning a minimum heap with level traversal algorithm c . a. must be an ascending sequence.b. must be descending sequencec. must have a minimum item at the head position.d. must have a minimum item at the rear position.(19) Assume the preorder of T is ABEGFCDH, the inorder of T is EGBFADHC, then the postorder of T will be a .a. GEFBHDCA b. EGFBDHCA c. GEFBDHCA d. GEBFDHCA(20) When a recursive algorithm is transformed into a no recursive algorithm, a structure b is generally used.a. SeqList b. Stack c. Queue d. Binary Tree2. Please convert the following infix expression (a*(b+c)+(b/d-e)*a into postfix expression, in the converting process, please draw the change of operator stack and the change of the output. (10 points)3. Assume a list is xal, wan, wil, zol, yo, xul, yum, wen, wim, zi, xem, zom, please insert these items to an empty Binary Search Tree and then construct the AVL tree. Please draw the whole processes including inserting an item, or rotate nodes to restore height balance.(10 points)4. Assume a list is 48,35,64,92,77,13, 29,44, firstly insert these items to an empty complete Binary Tree according to the sequence one by one, then please heapify the complete Binary Tree and implement the heap sort. Please draw the whole heapigying process and sorting process. (10 points) 5. For the following directed graph, give the adjacency matrix and adjacency list. Then according your adjacency list, please scan the graph using the depth-first search and the breadth-first search and give the corresponding result. (10 points)ABECD6. Assume a list is 35,25,47,13,66,41,22,57, please sorting the list with quicksort algorithm. Please write every sorting pass result (no programming).(10 points)7. Assume keys=32,13,49,55,22,39,20, Hash function is h(key)=key%7. The linear probe open addressing is used to resolve collisions. Please try to calculate the value of Hash for each key and give the final hash table. (10 points)8. Programming (All methods have been declared in textbook can be used directly, or you can rewrite them if they are not same in your answer) (20 points)(1) Assume there are two ascending ordered lists L1 and L2, please merge L1 and L2 into a new l
溫馨提示
- 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶(hù)所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶(hù)上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶(hù)上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
- 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶(hù)因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。
最新文檔
- 深度解析教育科技行業(yè)未來(lái)發(fā)展方向
- 教育機(jī)構(gòu)如何利用游戲化平臺(tái)提高教學(xué)效果
- 企業(yè)培訓(xùn)中多媒體技術(shù)的應(yīng)用與創(chuàng)新-以智慧教室為例
- 新版培訓(xùn)課件模板圖片
- 碧桂園張家港拓客內(nèi)部培訓(xùn)89
- 全民健身設(shè)施補(bǔ)短板工程實(shí)施方案在城市老舊小區(qū)健身設(shè)施改造中的應(yīng)用研究
- 全球鈾礦資源市場(chǎng)前景與2025年核能產(chǎn)業(yè)綠色低碳發(fā)展戰(zhàn)略報(bào)告
- 公交優(yōu)先戰(zhàn)略在2025年城市交通擁堵治理中的可持續(xù)發(fā)展報(bào)告
- Carpetimycin-B-生命科學(xué)試劑-MCE
- 成都文理學(xué)院《游戲美術(shù)設(shè)計(jì)》2023-2024學(xué)年第一學(xué)期期末試卷
- 2023年高考遼寧卷化學(xué)真題(解析版)
- (修訂版)糧油質(zhì)量檢驗(yàn)員理論考試復(fù)習(xí)題庫(kù)-上(單選題)
- 糧油食材配送投標(biāo)方案(大米食用油食材配送服務(wù)投標(biāo)方案)(技術(shù)方案)
- 2023-2024學(xué)年廣東省深圳市福田區(qū)七年級(jí)(下)期末數(shù)學(xué)答案
- 2024版商戶(hù)入駐合同
- 和公司直播合作協(xié)議書(shū)范本
- 兒科護(hù)理學(xué)高職全套教學(xué)課件
- 北師大版八年級(jí)數(shù)學(xué)下冊(cè)??碱}專(zhuān)練專(zhuān)題18平行四邊形中的周長(zhǎng)和面積問(wèn)題(原卷版+解析)
- 山東省濟(jì)寧市曲阜市2023-2024學(xué)年七年級(jí)下學(xué)期期末數(shù)學(xué)試題
- 湖南省長(zhǎng)沙市雨花區(qū)2023-2024學(xué)年三年級(jí)下學(xué)期期末考試英語(yǔ)試題
- 2024年糧食購(gòu)銷(xiāo)合同電子版(2篇)
評(píng)論
0/150
提交評(píng)論