- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
 - 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
 - 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
 - 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
 - 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
 - 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
 - 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
 
                        查看更多
                        
                    
                数据结构期末复习提要(国外英语资料)
                    数据结构期末复习提要(国外英语资料)
Programming skills!
Summary of data structure review
(scope of application: general, adult, open specialty)
The data structure is a central computer application specialized system design required courses and professional courses, all kinds of logic which mainly studies the structure of data storage structure, in the computer, insert, delete, search, sorting, traversal and other operations on data, implementation of these operations on data structure algorithm. A good study of this course will lay a solid foundation for learning the whole computer science.
The first part, review requirements of each chapter
In accordance with the main teaching materials in each chapter order given each chapter of the specific review requirements, in order to guide students to better carry out the final review.
The first chapter is introduction
Key content:
1., the data structure of the two tuple representation, the corresponding graphical representation, order pairs and the corresponding relationship between the edges.
2. the characteristics of set structure, linear structure, tree structure and graph structure.
3. definition and presentation of abstract data types.
4. elements in one and two-dimensional array subscript and according to the address access and conversion, computing element address and the address of the array elements, calculation of storage space size and the size of the array storage space.
5. common function overloading and operator function overloading meaning, definition format and call format.
6. the function specifies the specification format and function of the median and reference parameters, and the function that is called when the function is executed.
7., the concept of time complexity and space complexity of the algorithm, the method of calculation, expressed in magnitude.
8. the computation of the time complexity of the three best, worst, and average of a simple algorithm.
The rest of this chapter is in general control.
The second chap
                
原创力文档
                        
                                    

文档评论(0)