EngLib USM > Ω School of Electrical & Electronic Engineering >

Implementing automatic combinatorial test data generation algorithm in java / Ong Hui Yeh

Implementing automatic combinatorial test data generation algorithm in java_Ong Hui Yeh_E3_2009_875004507_00003095328_NI

Abstract Algoritma gabungan yang terdiri daripada algoritma Gabungan Lelahan, algoritma Pemilihan Binari dan algoritma Gabungan T Way seperti yang diperincikan dalam twayGenerator (Kamal Zuhairi Zamli, 2007) telah dikaji dan ditinjau. Penguatkuasaan sebenar algoritma tersebut adalah dalam Bahasa Pengaturcaraan C++, telah disiasat dan diubah ke Bahasa Pengaturcaraan JAVA. Program ini dikuatkuasakan sebagai alat pemodelan dalam barisan arahan. Format bagi fail input and fail output adalah berdasarkan spesifikasi yang tertentu supaya boleh beroperasi dalam persekitaran JTst. Beberapa andaian telah dilakukan dalam projek ini. Enam eksperimen (dua fail input yang berbeza untuk setiap algoritma, satu dengan tiada keadaan tidak kisah dan satu dengan keadaan tidak kisah) telah dilaksanakan untuk menguji program tersebut. Untuk algoritma Gabungan Lelahan, keputusan telah diuji, disahkan serta ditaksirkan berdasarkan output jangkaan. Tiada nilai jangkaan untuk dua algoritma yang lain. Walaubagaimanapun, justifikasi yang bersesuaian telah dibuat. Dengan ini, beberapa pelajaran dan kerja masa depan telah dikesan serta dihuaraikan. _________________________________________________________________________________________ The combinatorial algorithms which consisting Exhaustive Combination algorithm, Binary Selection algorithm and T Way Combination algorithm as described in twayGenerator (Kamal Zuhairi Zamli, 2007) have been studied and reviewed. The actual implementation of the algorithms which is in C++ programming language are investigated thoroughly and converted into JAVA codes. The program is implemented as a prototype command line tool. The format of the input file and output file of the program are based on specification in order to operate within JTst environment. Assumptions have been made for the program. Six experiments (two different input files for each algorithm, one without don’t care condition and one with don’t care condition) have been conducted to verify the program. For Exhaustive Combination algorithm, the results are tested, verified and evaluated by comparing with the expected outputs. No expecting values for the residue two algorithms. However, justifications have been made accordingly. In doing so, some lessons learned and avenues for future work are also identified and cited out.

Contributor(s): Ong Hui Yeh - Author Primary Item Type: Final Year Project Identifiers: Accession Number : 875004507 Language: English Subject Keywords: combinatorial; algorithms; prototype First presented to the public: 4/1/2009 Original Publication Date: 10/29/2018 Previously Published By: Universiti Sains Malaysia Place Of Publication: School of Electrical & Electronic Engineering Citation: Extents: Number of Pages - 119 License Grantor / Date Granted:   / ( View License ) Date Deposited 2018-10-29 15:55:39.177 Date Last Updated 2019-01-07 11:24:32.9118 Submitter: Nor Hayati Ismail

All Versions

• Help | 
• About | 
• Privacy Policy