成員： 林　釗?-- 201421123105 吳世榮 -- 201421123119 ?王坤彬 -- 201421123108?

coding地址：https://coding.net/u/linzhao/p/UnitTest/git

需求分析：

1.整數加減乘除的測試；

2.分數加減乘除的測試；

3.最大公約數測試；

4.判斷真分數測試；

計算模塊：

public?int?gcd(int?a,?int?b)//公約數

????????{ ????????????if?(a == 0) ????????????{ ????????????????return?b; ????????????} ???????????else?if?(b == 0) ????????????{ ????????????????return?a; ????????????} ????????????else ????????????{ ????????????????return?gcd(b % a, a); ????????????} ????????} ????????public?int?Calculate(int?type,?int?op1,?int?op2)//整數四則運算 ????????{ ????????????int?result = 0; ????????????if?(type == 1) ????????????{ ????????????????result = op1 + op2; ????????????} ????????????if?(type == 2) ????????????{ ????????????????result = op1 - op2; ????????????} ????????????if?(type == 3) ????????????{ ????????????????result = op1 * op2; ????????????} ????????????if?(type == 4) ????????????{ ????????????????result = op1 / op2; ????????????} ????????????return?result; ????????} ????????public?string?CalculateFengsu(int?up1,?int?down1,?int?up2,?int?down2,?int?type)//分數四則運算 ????????{ ????????????string?result =?""; ????????????if?(type == 1) ????????????{ ????????????????up1 = (up1 * down2 + up2 * down1); ????????????????down1 = down1 * down2; ????????????????up2 = gcd(up1, down1); ????????????????up1 = up1 / up2; ????????????????down1 = down1 / up2; ????????????????result = up1.ToString() +?"/"?+ down1.ToString(); ????????????????return?result; ????????????} ????????????if?(type == 2) ????????????{ ????????????????up1 = (up1 * down2 - up2 * down1); ????????????????down1 = down1 * down2; ????????????????up2 = gcd(up1, down1); ????????????????up1 = up1 / up2; ????????????????down1 = down1 / up2; ????????????????result = up1.ToString() +?"/"?+ down1.ToString(); ????????????????return?result; ????????????} ????????????if?(type == 3) ????????????{ ????????????????up1 = up1 * up2; ????????????????down1 = down1 * down2; ????????????????up2 = gcd(up1, down1); ????????????????up1 = up1 / up2; ????????????????down1 = down1 / up2; ????????????????result = up1.ToString() +?"/"?+ down1.ToString(); ????????????????return?result; ????????????} ????????????if?(type == 4) ????????????{ ????????????????up1 = up1 * down2; ????????????????down1 = down1 * up2; ????????????????up2 = gcd(up1, down1); ????????????????up1 = up1 / up2; ????????????????down1 = down1 / up2; ????????????????result = up1.ToString() +?"/"?+ down1.ToString(); ????????????????return?result; ?????????????? ????????????} ???????????? ????????????return?result; ????????} ????????public?string?CalculateZfengsu(int?up1,int?down1)//判斷及生成真分數 ????????{ ????????????string?result =?"true"; ????????????int?mid = 0; ????????????? ????????????????if?(up1 > down1) ????????????????{ ????????????????????mid = down1; ????????????????????down1 = up1; ????????????????????up1 = mid; ????????????????????result = up1.ToString() +?"/"?+ down1.ToString(); ????????????????????return?result; ????????????????} ????????????????????if?(up1 == down1) ????????????????????{ ????????????????????????down1 += 3; ????????????????????????result = up1.ToString() +?"/"?+ down1.ToString(); ????????????????????????return?result; ????????????????????} ? ??return?result; }

一、公約數測試：

gcd(int?a,?int?b)

二、整數加減乘除測試：

Calculate(int?type,?int?op1,?int?op2) //其中type為運算類型，op1，op2為整數。

?

三、分數四則運算：

?CalculateFengsu(int?up1,?int?down1,?int?up2,?int?down2,?int?type) //其中up1，up2為分子，down1，down2為分母，type為運算類型。

?

四、判斷真分數：

CalculateZfengsu(int?up1,int?down1) //up1，down1分別為分子分母。

?

五、代碼覆蓋率：

?

?六、小結：

?這是結對編程的第二次作業，難度會大一些，萬事開頭難，不知道從何下手，摸索了一段時間后才開始做的，一些代碼也不夠熟練，總得好好的去找其他同學請教請教才行。還有就是要看以前的書籍。

?

七、Git 版本控制系統保存工作文件：

?

?

八、PSP表格：

PSP2.1	Personal Software Process Stages	Time Senior Student	Time
Planning	計劃	0.5h	0.5h
· Estimate	估計這個任務需要多少時間	2h	2.5h
Development	開發	1.5h	1h
· Analysis	需求分析?(包括學習新技術)	20min	10min
· Design Spec	生成設計文檔	10min	6min
· Design Review	設計復審	10min	16min
· Coding Standard	代碼規范	5min	3min
· Design	具體設計	20min	12min
· Coding	具體編碼	40min	21min
· Code Review	代碼復審	15min	9min
· Test	測試（自我測試，修改代碼，提交修改）	15min	21min
Reporting	報告	5min	6min
·	測試報告	5min	2min
·	計算工作量	5min	1min
·	提出過程改進計劃	10min	3min

轉載于:https://www.cnblogs.com/wkb2040/p/6640093.html

總結

以上是生活随笔為你收集整理的结对编程之单元测试 201421123108 王坤彬的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。