数据结构(第2版)_在线作业_A（Data structure (Second Edition) _ webassign _A）.doc

下载文档 降价啦

2
0
约5.89千字
约 17页
2017-08-02 发布于河南
举报
版权申诉
保障服务

数据结构(第2版)_在线作业_A（Data structure (Second Edition) _ webassign _A）.doc

1、本文档共17页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

数据结构(第2版)_在线作业_A（Data structure (Second Edition) _ webassign _A） Final result: 70, a single choice question 1. The data logic structure is: Data= (D, R); D={d1, D2, D3, D4, D5, D6, D7} R={d1, d2, d2, d1, d1, d4, d4, d2, d3, d3, d2, d2, d6, d6, d2, d2, d7, d7, d5}, d2, d3, d7, d7, d7d7, d1, d3d4, d6d6, d5, d4, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, D, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C Try to analyze which logic structure the data structure belongs to () Linear logic structure tree structure network structure Graph structure Subject matter: 5 User score: 0 User answer: tree structure Knowledge points: 1.2 basic concepts and terminology -------------------------------------------------------------------------------- Two Determine the time complexity, degree, magnitude of the following program segments. For (i=1; in; i++) For (j=1; j=i; j++) For (k=1; k=j; k++) X=x+1; O (N2) O (n) O (N3) O (1) Subject matter: 5 User score: 0 User answer: O (n) Knowledge points: 1.3 C programs and examples -------------------------------------------------------------------------------- Three In a linear storage table of length N, when inserting a new element into the position of the first I element (1=i=n+1), you need to move (backward) backwards from behind. I N-i N-i+1 N-i-1 Subject matter: 5 User score: 5 User answer: n-i+1 Knowledge point: 2.2 order storage structure linear table -------------------------------------------------------------------------------- Four In a single chain table, if you want to insert a new node after the node pointed to by P, you need to modify the contents of the pointer field one after another. Four Two Three One Subject matter: 5 User score: 5 User answer: 2 Knowledge point: 2.3 link storage structure linear table -------------------------------------------------------------------------------- Five When a stack is stored sequentially in an array of size N, assum