（畢業(yè)論文）-數(shù)據(jù)結(jié)構(gòu)與算法實(shí)驗(yàn)論文

1、I北方民族大學(xué)

2、 學(xué)士學(xué)位論文論文題目: 《數(shù)據(jù)結(jié)構(gòu)與算法》實(shí)驗(yàn) 院(部)名 稱: 信息與計算科學(xué)學(xué)院 學(xué) 生 姓 名: 專 業(yè): 統(tǒng)計學(xué) 學(xué) 號:指導(dǎo)教師姓名: 論文提交時間:

3、 論文答辯時間: 學(xué)位授予時間: 北方民族大學(xué)教務(wù)處制 IIIABSTRACTThe paper introduces five commonly used data structure design of experiment,

4、 Mainly expounds each data structure inherent logic relationship, discuss the storage form of them in the computer, and the operations (operating) of the data structure, to analyze and discusse the efficiency of the algo

5、rithm briefly. The first chapter introduces the first chapter and orderly, insert table and delete, insert and delete operation of understanding algorithm, The second ZhangLian table and the main discussion, polynomial l

6、inear chain store structure, the watch list of the algorithm, and polynomials, The third chapter sparse matrix and transposed, mainly introduce the ternary sparse matrix forms of storage and storage of ternary table algo

7、rithm; transposed matrix, The fourth chapter binary tree and its first traverse sequence, a tree structure and binary tree's first traverse sequence, The fifth chapter sequence clues binary tree, main narrative clues

8、 binary tree algorithm and traverse sequence clues and the implementation process. And can effectively inspection program design and learning effect. Algorithm is described in Visual Basic C++ 6.0 and in the operating en