2级c语言上机题 1（2 Level C language problem 1）.docVIP

下载本文档

1
0
约 16页
2017-10-07 发布于河南
举报
版权申诉

2级c语言上机题 1（2 Level C language problem 1）.doc

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

2级c语言上机题 1（2 Level C language problem 1）

2级c语言上机题 1（2 Level C language problem 1） Two level C language examination questions 1, write function fun, its function is: use the following simple iterative method to find the equation: cos (x) -x=0 a real root. The xn+1=cos (xn) iteration steps are as follows: (1) the initial value of X1 is 0; (2) x0 = x1, assigning the value of X1 to x0; (3) X1 = cos (x0), and find a new x1; (4) if the absolute value of x0 - X1 is less than 0.000001, execute the step (5), or else execute the step (2); (5) the X1 is a real root of the equation cos (x) -x=0, which is returned as a function value. Double x1=0.0; Do {x0=x1; x1=cos (x0);} While (Fabs (x0-x1) =0.000001); Return x; 2, write function double fun, its function is: according to the following formula to calculate s, the results of the calculation through the parameter pointer Sn return; N through the parameters of the incoming. 11111 S = - - - + - - - +... - -- 1357 2n+1 Int, I, j=1; double s=0; For (i=0; i=n; i++) {s=s+1.0/ (2*i+1) *j; j=-j;} *sn=s; 3, write function double fun, its function is: according to the following formula for the value of P, the result by the function value to bring back. M and N are two positive integers and require m n. M! P = -- N! (m-n)! Double, i=1, x=1, y=1, z=1, p=0; For (i=1; i=m; i++) x=x*i; For (i=1; i=n; i++) y=y*i; For (i=1; i= (m-n); i++) z=z*i; P=x/ (y*z); Return p; 4, write function fun, its function is to calculate: S = [ln (1), +ln (2) + ln (3) +... +ln (m)] 0.5 In the C language, you can call the log (n) function to find ln (n). The reference to the log function is: Double log (double, X); Double, I, s=0; For (i=1; i=m; i++) s=s+log (I); Return sqrt (s); 5, write function double fun (double h), its function is: four homes five, and retain two decimal places Long, int, I, j=1; If (h0) {j=-1; h=-h;} H=h*100+0.5; I=h; H=i/100.0; Return h*j; 6, write function fun, its function is: find Fibonacci Series in greater than t of the smallest number, the result is returned by function. The