Article Per Year (5 Year)
p-Index From 2019 - 2024
0.444
P-Index
This Author published in this journals
All Journal Jurnal Informatika Upgris Sistemasi: Jurnal Sistem Informasi Jurnal Informatika
Suardinata Suardinata
STMIK Indonesia Padang
Computer Science & IT Electrical & Electronics Engineering

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

Found 3 Documents
Search

 1 
Aplikasi Penyaluran Bibit Perkebunan Berbasis Web Pada Dinas Perkebunan Kabupaten Pasaman Barat Nelfira Nelfira; Suardinata Suardinata; Nunuk Parwati
Jurnal Informatika Vol 6, No 2 (2019): September 2019
Publisher : LPPM Universitas Bina Sarana Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (791.102 KB) | DOI: 10.31294/ji.v6i2.6314

Abstract

Dinas Perkebunan kabupaten Pasaman Barat mempunyai program kegiatan penyaluran bibit perkebunan kepada kelompok tani. Petani mendapatkan informasi penyaluran bibit dari sosialisasi yang dilakukan oleh Dinas Perkebunan tersebut. Sistem yang berjalan saat ini menyulitkan petani mengetahui keberadaan bibit karena kurangnya informasi tentang penyaluran bibit, proses pengolahan data penyaluran bibit di Dinas Perkebunan Kabupaten Pasaman Barat sering mengalami kesalahan dan hasil laporan penyaluran bibit mengalami keterlambatan karena proses pencarian data yang lama. Untuk itu perlu dirancang aplikasi penyaluran bibit perkebunan berbasis web dengan  menggunakan bahasa pemograman PHP dan MySQL sebagai basis data. Perancangan aplikasi menggunakan metode SDLC model waterfall dengan alat bantu perancangan UML. Hasil akhir dari penelitian ini adalah terciptanya Aplikasi Penyaluran Bibit Perkebunan Berbasis Web pada Dinas Perkebunan Kabupaten Pasaman Barat. Dengan aplikasi ini petani bisa mengetahui informasi keberadaan bibit dan proses pengolahan data penyaluran bibit perkebunan menjadi lebih cepat, tepat, akurat, dan relevan.
Sistem Informasi Perpustakaan Online di Man Kota Solok Ilham Tri Maulana; Suardinata Suardinata; F Ramadani
Jurnal Informatika Upgris Vol 4, No 2: Desember (2018)
Publisher : Universitas PGRI Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26877/jiu.v4i2.2679

Abstract

Research conducted at the MAN library of Solok city, found the problems of recording and making report book data and borrowing / returning books still using handwritten not stored into the database, as well as students difficulty in finding and knowing the required stock of books, so the required library information system online that can assist in recording, preparing reports and finding and knowing the required stock of books stored in the database. In this research is designed online library information system with PHP programming language and MySQL Database in question to help library MAN city of Solok in data processing book. The method used in this research is SDLC waterfall type and design tool with UML. The results of this study is an application that can provide convenience in recording, reporting and knowing availability of existing stock of books. Officers can make report book data or borrowing / returning more quickly and accurately. Availability of complete book data, making it easier for students to get book information.
Determining Travel Time and Fastest Route Using Dijkstra Algorithm and Google Map Suardinata Suardinata; Rusdisal Rusmi; Muhammad Amrin Lubis
Sistemasi: Jurnal Sistem Informasi Vol 11, No 2 (2022): Sistemasi: Jurnal Sistem Informasi
Publisher : Program Studi Sistem Informasi Fakultas Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1028.494 KB) | DOI: 10.32520/stmsi.v11i2.1836

Abstract

Dijkstra's algorithm is commonly used to determine the shortest route connecting a point as a starting node to another which acts as the end node. In this study, the UNP student dormitory acted as the starting node, while the library which is frequently visited by students was sampled from the campus as the end node. Due to the fact that students generally live around campus and move on foot, an alternative route is needed to determine the fastest travel time. Therefore, this study aims to determine the route with the fastest travel time from the start to the end of nodes using the Dijkstra algorithm, in comparison with the route displayed by Google Map. Data were obtained from Google Map, which showed the availability of many routes with the possibility of students taking the fastest travel time. The result showed that the fastest route using the Dijkstra algorithm and Google Map were 14 and 3 alternatives at 15 and 21 minutes intervals. Based on these data, it is concluded that the travel time through the fastest route obtained using the Dijkstra algorithm was 6 minutes faster than data found in the Google Map.
Co-Authors F Ramadani Ilham Tri Maulana Muhammad Amrin Lubis Nelfira Nelfira Nunuk Parwati Rusdisal Rusmi