Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal Jurnal Kridatama Sains dan Teknologi Decode: Jurnal Pendidikan Teknologi Informasi
Fallo, Diana
Unknown Affiliation
Agriculture, Biological Sciences & Forestry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Education Languange, Linguistic, Communication & Media Social Sciences Other

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
Analisis Pengembangan Aplikasi Sistem Informasi Iuran Komite Berbasis Web Based Jurusan TKJT SMKN 1 Kupang Fallo, Diana; Yonly Benufinit; Audrey Jesica Toelle
Decode: Jurnal Pendidikan Teknologi Informasi Vol. 4 No. 2: JULI 2024
Publisher : Program Studi Pendidikan Teknologi Infromasi UMK

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51454/decode.v4i2.358

Abstract

Penelitian ini menggunakan penelitian R&D dengan teknik analisis data kuantitatif dan metode SDLC. Tujuan dari penelitian ini adalah memberikan informasi kepada orangtua terkait dengan pembayaran uang komitedi SMK Negeri 1 Kupang. Berdasarkan hasil Sistem Informasi Pembayaran Iuran Komite, dapat disimpulkan bahwa Sistem Informasi yang dibuat berbasis web based layak untuk diterapkan pada Kompetensi Keahlian Teknik Jaringan Komputer dan Telekounikasi di SMK Negeri 1 Kupang, hal ini dapat dilihat dari hasil angket kelayakan produk ahli media I, dan ahli media II dengan nilai rata-rata 94% , hasil validasi angket kelayakan produk dari Wali kelas (X, XI, XII) dengan nilai rata-rata 93% , hasil validasi angket kelayakan produk dari Guru-guru Mata Pelajaran Kejuruan dengan nilai rata-rata 93%, hasil validasi angket kelayakan produk dari Orang tua/wali dengan nilai rata-rata 99%, hasil validasi angket kelayakan produk dari Waka Humas dengan nilai rata-rata 100%, hasil validasi angket kelayakan produk dari Bendahara dengan nilai rata-rata 100%, dan hasil validasi angket kelayakan produk dari Ketua Jurusan dengan nilai rata-rata 90%.
Implementasi Algoritma Dijkstra dan Greedy dalam Penyelesaian Masalah Rute Terpendek Angul, Angelina; Fallo, Diana; Tanggo, Karolina Viviliana; Belo, Ivonia Nazario Alves; Hoar, Fenesia
Jurnal Kridatama Sains dan Teknologi Vol 7 No 01 (2025): Jurnal Kridatama Sains dan Teknologi
Publisher : Universitas Ma'arif Nahdlatul Ulama Kebumen

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53863/kst.v7i01.1654

Abstract

The shortest route problem is a classic topic in graph theory that has many applications in everyday life, such as in navigation systems, logistics distribution, and network management. Two algorithms that are often used are the Algorithm and the Greedy Algorithm. The Algorithm can find the shortest path with maximum results, but it has a fairly high time complexity, making it less effective for situations that require speed. On the other hand, the Greedy Algorithm can provide solutions quickly, but does not always produce the ideal shortest path. This study uses a systematic literature review (SLR) approach to scientific publications in 2020-2025, which aims to analyze and compare the performance of the two algorithms in depth. The results of the analysis show that the Algorithm is more appropriate for situations that prioritize optimal solutions, while the Greedy Algorithm is better at decisions that require speed. This study not only provides theoretical analysis, but also discusses its practical applications in the transportation, logistics, and network sectors, and aims to provide insight into the development of more efficient and effective systems in the future
Optimalisasi Rute Menggunakan Algoritma Dijkstra dan Greedy: Sebuah Pendekatan Komparatif Jelita, Felisa; Fallo, Diana; Miru, Yoseph Gayus
Jurnal Kridatama Sains dan Teknologi Vol 7 No 01 (2025): Jurnal Kridatama Sains dan Teknologi
Publisher : Universitas Ma'arif Nahdlatul Ulama Kebumen

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53863/kst.v7i01.1659

Abstract

This study aims to analyze and compare the effectiveness of three algorithms that are often used in finding the shortest path, namely the Dijkstra Algorithm, the Greedy Algorithm, and the A* Algorithm. The problem of finding the shortest path is one of the basic challenges in the field of computer science, especially in applications such as navigation systems, logistics, and digital mapping. This study was conducted by conducting a literature study of more than 20 trusted scientific references published between 2015 and 2024. The results of the analysis show that the Dijkstra algorithm provides a high level of accuracy and guarantees optimal results, although it requires more time and memory. The Greedy algorithm excels in time efficiency and simplicity, but does not guarantee an optimal solution. The A* algorithm combines the strengths of Dijkstra and Greedy through a heuristic approach that promises efficiency and accuracy at the same time. This study concludes that the selection of algorithms should be adjusted to the context of their application and that the A* algorithm can be an effective compromise solution. These findings are expected to provide theoretical and practical contributions in the development of intelligent and adaptive route optimization systems.Keywords: Dijkstra algorithm, Greedy algorithm, shortest path, route optimization, algorithm comparison
Co-Authors Angul, Angelina Audrey Jesica Toelle Belo, Ivonia Nazario Alves Hoar, Fenesia Jelita, Felisa Miru, Yoseph Gayus Tanggo, Karolina Viviliana Yonly Benufinit