ANALISIS PERBANDINGAN TEST CASE PRIORITIZATION MENGGUNAKAN ALGORITMA GREEDY DAN ALGORITMA HILL CLIMBING PADA REGRESSION TESTING

Ainun, Dipika Syaiban (2024) ANALISIS PERBANDINGAN TEST CASE PRIORITIZATION MENGGUNAKAN ALGORITMA GREEDY DAN ALGORITMA HILL CLIMBING PADA REGRESSION TESTING. Undergraduate thesis, UPN Veteran Jawa Timur.

	Text 20081010226-cover.pdf Download (4MB)
	Text 20081010226-bab1.pdf Download (1MB)
	Text 20081010226-bab2.pdf Restricted to Repository staff only until 19 September 2026. Download (5MB)
	Text 20081010226-bab3.pdf Restricted to Repository staff only until 19 September 2026. Download (7MB)
	Text 20081010226-bab4.pdf Restricted to Repository staff only until 19 September 2026. Download (7MB)
	Text 20081010226-bab5.pdf Download (919kB)
	Text 20081010226-daftarpustaka.pdf Download (824kB)
	Text 20081010226-lampiran.pdf Restricted to Repository staff only Download (3MB)

Abstract

Software Testing is one of the important steps in ensuring that a software remains superior and can run and be used by the wider community, software testing can be done using Regression Testing to ensure that the software is not damaged or there are new bugs after changes occur. Regression Testing is used to save time and testing costs by implementing Test Case Prioritization which functions so that software testers can select the most important test cases to be tested based on the use of the Greedy algorithm and the Hill Climbing algorithm combined with other parameters such as Severity Rating, and the Average Percentage Fault Detection (APFD) matrix. The focus of this research is to find the priority order of test cases based on the results of Regression Testing on the demoblaze.com website based on the comparison of the Greedy algorithm and the Hill Climbing algorithm combined with the Severity Rating parameter based on the highest APFD value. The results of the research show that the use of the Hill Climbing algorithm is more effective in determining the priority of test cases by obtaining an APFD value of 0.91, while the Greedy algorithm gets an APFD value of 0.87.

Item Type:

Thesis (Undergraduate)

Contributors:

Contribution	Contributors	NIDN/NIDK	Email
Thesis advisor	Swari, Made Hanindia Prami	NIDN0805028901	madehanindia.fik@upnjatim.ac.id
Thesis advisor	Akbar, Fawwaz Ali	NIDN0017039201	fawwaz.ali@upnjatim.ac.id

Subjects:

Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
T Technology > T Technology (General)

Divisions:

Faculty of Computer Science > Departemen of Informatics

Depositing User:

Dipika Syaiban Ainun

Date Deposited:

20 Sep 2024 03:44

Last Modified:

20 Sep 2024 03:44

URI:

https://repository.upnjatim.ac.id/id/eprint/29624