Relative Complexity Measurement for Special Application software

碩士 === 國立中央大學 === 資訊管理學系碩士在職專班 === 93 === In this study, we try to define a measure method which is sensitive to many software characteristics for the complexity of special application software. Thus, we choose a credit card system of a bank in Taiwan. The system environment of this credit card syst...

Full description

Bibliographic Details
Main Authors: Chia-yi Lee, 李佳毅
Other Authors: none
Format: Others
Language:zh-TW
Published: 2005
Online Access:http://ndltd.ncl.edu.tw/handle/47610979673575096206
Description
Summary:碩士 === 國立中央大學 === 資訊管理學系碩士在職專班 === 93 === In this study, we try to define a measure method which is sensitive to many software characteristics for the complexity of special application software. Thus, we choose a credit card system of a bank in Taiwan. The system environment of this credit card system is IBM z/OS390. The computer language used to write this system is IBM Mainframe COBOL. We randomly select several programs from the system to be the sample. We use our method to measure these programs’ complexity first, and then obtain these programs’ relative complexity by sorting their complexity measures. To verify if our method is acceptable, we also request some programmers who are responsible for the development of this credit card system to sort those sample programs by complexity. Then we use the correlation coefficient test to measure the association between the two sorting results. The correlation test shows that our measure method is acceptable. We hope the measure method can be applicable in some management work, for example, man power allocation for software development, the prediction of fault rate of a software system, etc..