网站大量收购独家精品文档,联系QQ:2885784924

1993年初级程序员试题介绍(国外英文资料).doc

1993年初级程序员试题介绍(国外英文资料).doc

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

1993年初级程序员试题介绍(国外英文资料) The junior programmers exam in 1993 The 1994-01-14 The computer software level of 1993 is over. For examination of the overall situation, we will have a dedicated article, recently we have to do is to junior programmers, programmers and senior programmers some questions appeared to readers, and then the teacher comment on, the paper gives the correct answer and commented about skills, methods, help people grasp the key points, whether you take level test, will be an improvement. When we publish the question, we want our readers to do the same, and then compare the correct answers with an estimate of ourselves. Junior program questions: Try a Read the following instructions and flowcharts, and put them in the corresponding column of the answer sheet. [that] Fibonacci sequence {Tk} is defined as follows: T0 = 0 T1 = 1 Tk + 1 = Tk + Tk -1 (k = 1, 2, 3,...) This flowchart describes the algorithm for calculating the sum of N (N or 2) of the Fibonacci sequence (S = T0 + T1 +... + tn-1). The flow chart] Item 2 Read the following instructions and flowcharts, and put them in the corresponding column of the answer sheet. [that] This flowchart is used to page out the contents of A in order file A. The last record of the current contract sequence file is the file ending record. The printing requirements are as follows: every 66 ACTS a page, each page prints 50 records, each recording a row. Line 6 lines over the top of each page, and after each printing ten records, each print a blank line, and the rest of each page prints blank lines. Specifies that any page must complete a page (after the last record in the last page), but no empty pages are allowed. Try to point out the points in the flowchart, which point in the diagram should be connected, and indicate what the contents should be filled in. Item 2 \ [110141] Read the following instructions and flowcharts, and fill in 1-5 words in the corresponding column of the answer. [that] This flowchart is used

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

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

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档