Claim Missing Document
Check
Articles

Found 2 Documents
Search

Pengujian Black Box pada Aplikasi Penjualan Berbasis Web Menggunakan Metode Equivalence Partitioning Teti Desyani; Endar Nirmala; Andi Lisdiarto; Hairul Ridwan; Raden Wirawan Kukuh Pambudi; Vyka Septiani
Jurnal Informatika Universitas Pamulang Vol 7, No 1 (2022): JURNAL INFORMATIKA UNIVERSITAS PAMULANG
Publisher : Teknik Informatika Universitas Pamulang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32493/informatika.v7i1.16194

Abstract

In a program or software certainly has some shortcomings in terms of comfort and accuracy to the needs of users (users), such as errors in user appearance, as well as effectiveness in the use of programs. Therefore, a way is needed to be able to fix the deficiency, by testing the program before it is used to the user. And the test is one way to determine whether a software has met the needs of users and specifications or still does not meet. If there is no checking process first, it can cause data error. With these problems, of course, it will hinder the use of the application. Therefore, the validation process is very considered. An application can be said to be of quality if it has gone through the testing stage. In the above, we conducted a blackbox test using the Equivalence Partitioning method, which can be interpreted as solving or dividing a program in the form of a domain that is entered into a data class in order to get a test case. Using this method, we earned quite varied points to test web application sales. The test in question includes things such as the design of the test scenario, the determination of the data to be tested, the test trial, the range of values, the determination of program functionality, conformity with existing databases, the results of documented research, to the conclusions obtained. The conclusion of testing using this method is that this application can run properly by meeting the criteria that meet the user's needs.
Sistem Penunjang Keputusan Dalam Menentukan Jarak Terdekat Menggunakan Metode Ant Colony Optimization Raden Wirawan Kukuh Pambudi; Surtikanti
BINER : Jurnal Ilmu Komputer, Teknik dan Multimedia Vol. 1 No. 5 (2023): BINER : Jurnal Ilmu Komputer, Teknik dan Multimedia
Publisher : CV. Shofanah Media Berkah

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This research was motivated by the lack of alternative options for community decision making in choosing and determining the nearest tourist attractions that can be addressed. This deficiency shows that the lack of applications that can provide solutions related to the selection of nearby tourist attractions, in general people have to manually search through the Maps application for the location of the nearest tourist attractions in their area. Therefore, the purpose of this study is to create a decision support system in determining the closest distance to tourist attractions using the Ant Colony Optimization method which aims to make it easier to determine the distance and the nearest path more effectively. So that the end result of this system can give people alternative options to get the closest route with the shortest distance more precisely. With the following results: 1. Jurang Mangu Station – Ocean Park BSD – Ricastro Waterzone – Ganespa Education Park – Trans Snow World Bintaro – Jurang Mangu Station with the shortest distance of 31.5 KM; 2. Pondok Ranji Station – Ocean Park BSD – Ricastro Waterzone – Ganespa Education Park – Trans Snow World Bintaro – Pondok Ranji Station with the shortest distance of 36 KM; 3. Rawa Buntu Station – Ricastro Waterzone – Ganespa Education Park – Trans Snow World Bintaro – Ocean Park BSD – Rawa Buntu Station with the shortest distance of 32.9 KM; 4. Serpong Station - Ricastro Waterzone - Ganespa Education Park - Trans Snow World Bintaro - Ocean Park BSD - Serpong Station with the shortest distance of 37.3 KM; 5. Sudimara Station - Ocean Park BSD - Ricastro Waterzone - Ganespa Education Park - Trans Snow World Bintaro - Sudimara Station with the shortest distance of 31.5 KM.