数据结构习题4858(国外英文资料).docVIP

  1. 1、本文档共34页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
数据结构习题4858(国外英文资料)

数据结构习题4858(国外英文资料) The winner of the private heart can destroy the duke - Lin Bu Data structure problem sets First order theory Consider: The following: data, data elements, data objects, data structures, storage structures, data types, abstract data types Operations: 1.2 has data structures (D, R), among them D = {d1, d2, d3, d4} R = {r1, r2} R1 = { d1, d2 , d2, d3 , d3, d4 , d1, d4, , d4, d2 , d4, d1, } R2 = {(d1, d2), (d1, d3), (d1, d4), (d2, d4), (d2, d3)} Try to draw a schematic of its logical structure So 1.3 is the positive integer Try to write down the frequency of the statements marked delta in the following sections: (1) I = 1; K = 0; While (I = n minus 1) { Delta k plus is equal to 10 times I; I++; } (2) I = 1; K = 0; Do { Delta k plus is equal to 10 times I; I++; (I = n minus 1) (3) I = 1; K = 0; Do { Delta k plus is equal to 10 times I; I++; While (I = = n); (4) I = 1; J = 0; While I + j is less than or equal to n Delta if (I j) I + +; The else j++; } (5) x = n; Y = 0; / / n is a constant of not less than one While (x = (y + 1) * (y + 1)) {. Delta y++; } (6) x = 91; Y = 100; While (y, , 0) Delta if (x 100) {x - = 10; Y --; } Else x + +; } (7) for (I = 0; I n; I + +) For (j = I; j n; j + +) For (k = j; k n; k + +) Delta x + = 2; Chapter 2 linear tables Consider: 2.1 describes the difference between the first pointer, the head, and the first 2.2 describes the following concepts: sequential storage structure, chain storage structure, sequential tables, and ordered tables Operations: The data elements in the ordered table, La, are arranged in a non-decreasing order Try writing an algorithm to insert element x into the appropriate location of La and keep the table in order The data elements in the single linked list, La, are arranged in a non-decreasing order In two different situations, the algorithm is written, and the element x is inserted into the appropriate position of La, and the order of the table is maintained: (1) La leading node; (2)

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档