cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Muhammad Agreindra Helmiawan
Contact Email
research@unsap.ac.id
Phone
+62261-202911
Journal Mail Official
infomans@unsap.ac.id
Editorial Address
Jalan Angkrek Situ No. 19, Kelurahan Situ, Kecamatan Sumedang Utara, Kabupaten Sumedang, Jawa Barat, Indonesia 45323
Location
Kab. sumedang,
Jawa barat
INDONESIA
Infomans: Jurnal Ilmu-ilmu Informatika dan Manajemen
Published by Universitas Sebelas April
ISSN : 19783310     EISSN : 26153467     DOI : 10.33481/infomans
Core Subject : Science,
Computer Science & IT
Infomans Journal is a scientific journal published by LPPM and Fakultas Teknologi Informasi FTI UNSAP. This journal contains scientific papers from Academics, Researchers, and Practitioners about research on informatics. Infomans Journal is published twice a year in May and November. The paper is an original script and has a research base on Informatics. The scope of the paper includes several studies but is not limited to the following study. Artificial Intelligence Computer Graphics and Animation Image Processing Cryptography Computer Network Security Modeling and Simulation Information Retrieval Information Filtering Multimedia Computer Architecture Design Computer Vision and Robotics Parallel and Distributed Computing Operating System Information System Mobile Computing Natural Language Processing Data Mining Machine Learning Expert System Geographical Information System
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 49 Documents
 1   2   3   4   5 
Analisis Perbandingan Algoritma Linear Search dan Binary Search dalam Efisiensi Pencarian Data Firmansyah, Hilman; Julian, Eggi; Ruhiat, Atep
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

The rapid development of information technology has led to a significant increase in data volume, thus requiring information systems to perform data search processes quickly and efficiently. Search algorithms are a crucial component in determining system performance. This study aims to analyze and compare the efficiency of Linear Search and Binary Search algorithms in the data search process. The method used is a literature study with a descriptive and comparative approach to several relevant national journals. The results of the analysis show that Linear Search has the advantage in terms of flexibility because it does not require sorted data, but has a time complexity of O(n) making it less efficient for large datasets. In contrast, Binary Search has a time complexity of O(log n) and has proven to be more efficient on large, sorted datasets. Therefore, the selection of a search algorithm must be adjusted to the characteristics and conditions of the data so that the system can work optimally.
Analisis Komparatif Strategi Algoritma Pencarian Dalam Penyelesaian Masalah Kecerdasan Buatan Budiansyah; Ratna Komala, Iyat; Nurhayati, Leni
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

Search algorithms are a fundamental component in computer science, specifically in the domain of Artificial Intelligence (AI) for solving state space search problems. This study aims to conduct a comparative analysis between Uninformed Search strategies (BFS, DFS) and Informed Search strategies (A*, Hill Climbing, Simulated Annealing). The research method used is a Systematic Literature Review (SLR) by synthesizing data from primary and secondary sources. The results indicate a significant trade-off; Uninformed Search such as BFS guarantees optimality but has high space complexity while DFS is memory efficient but not complete. Conversely, Informed Search significantly increases efficiency, requiring only about 4.45% of computation compared to blind search. The A* algorithm is identified as the most effective strategy for pathfinding by balancing actual cost and heuristic estimation, whereas Simulated Annealing overcomes the local optima problem found in Hill Climbing. The selection of the right algorithm depends on the specific constraints of the problem faced.
Implementasi Customer Relationship Management (CRM) Pada Pendidikan Kursus Membaca Usia Dini Nugraha, Rahmat; Guntara, Agun; Alibasah, Kiki
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

The development of non-formal education institutions, particularly early childhood reading courses, requires effective management of relationships between institutions and customers, namely parents of students. Customer Relationship Management (CRM) is a strategic approach focused on managing long-term relationships with customers through the use of information technology. This study aims to analyze and examine the implementation of CRM in early childhood reading course institutions to improve service quality, customer satisfaction, and parent loyalty. The research method used is qualitative with a literature review and conceptual study approach based on various relevant scientific sources. The results indicate that CRM implementation in early childhood reading education can be carried out through three main stages: operational CRM, analytical CRM, and collaborative CRM. Integrated CRM implementation helps course institutions manage student data, enhance communication with parents, and support data-driven decision making. This study concludes that CRM plays an important role in improving competitiveness and sustainability of early childhood reading course institutions.
Perbandingan Kinerja Algoritma Linear Search dan Binary Search dalam Pencarian Data Indriyani Surachman, Revaliana; Supriadi, Fidi; Saeppani, Asep; Mahardika, Fathoni
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

Data searching is a fundamental aspect of computer science that affects application performance. This study aims to analyze and compare the efficiency of two basic searching algorithms, namely Linear Search and Binary Search. The research method was conducted by testing both algorithms using datasets with a varying number of elements to measure execution time and algorithm complexity. The results showed that Linear Search is more efficient for small or unsorted data, while Binary Search shows much superior performance on large sorted datasets with a time complexity of O(log n). The conclusion of this study provides guidance in choosing the right searching algorithm based on data characteristics and system requirements.
Analisis Perbandingan Performa Algoritma Sequential Search, Binary Search, dan SQL Search pada Aplikasi Kamus Digital Bahasa Indonesia Fadhilah, Naufal; Firdaus, Isad; Raihan Rasyiq, Rakan
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

Scientific language is often difficult for the general public to understand, while the process of searching for meanings in conventional dictionaries is time-consuming. This issue triggers the need for digital dictionary applications equipped with fast and efficient search algorithms. This study aims to conduct a comparative performance analysis between Sequential Search, Binary Search, and SQL Search methods in an Indonesian digital dictionary application. The research method used is performance analysis by measuring two main parameters: search time speed and memory usage. Testing was conducted with word search scenarios at the beginning, middle, and end positions of the data. The results show that the Binary Search algorithm is the fastest method with an average time of 0.0405 seconds, followed by SQL Search, while Sequential Search is the slowest with an average time of 17.3785 seconds. In terms of resource efficiency, Sequential Search has the lowest memory usage due to its structural simplicity, but Binary Search remains superior in efficiency for processing large data. The conclusion of this study is that Binary Search is most effectively applied to applications with large sorted datasets, while SQL Search provides better flexibility because its data management is handled directly by the database system.Bibar
Algoritma Linear Search dan Binary Search Berdasarkan Ukuran dan Kondisi Keterurutan Data Abdul Rahman, Gilang; Indra Junaedi, Dani; Santika, Deris
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

This study compares the performance of Linear Search and Binary Search in data retrieval under varying dataset sizes and ordering conditions. Rather than relying solely on theoretical complexity, Binary Search is evaluated end-to-end by including the required sorting step prior to searching. A quantitative experiment is conducted in Python 3.13.9 using shuffled unique integer arrays with sizes ranging from to . Four target scenarios are tested: target located at the beginning, middle, end, and target not found. The primary metrics are execution time and summary statistics (median and mean) computed from repeated runs for each scenario. The results indicate that for a single search on initially unsorted data, the Sorting+Binary approach tends to yield a higher total time than Linear Search because sorting dominates the overall cost, while the binary search component itself remains comparatively small. The contribution of this work is an end-to-end evaluation that accounts for sorting overhead and provides practical guidelines for selecting the appropriate search algorithm across dataset sizes and query scenarios. These findings highlight that algorithm selection should account for data characteristics and preprocessing overhead; Binary Search is most beneficial when data is already sorted or when sorting costs can be amortized across repeated queries.
Analisis Algoritma Pencarian Pada Sistem Informasi Berdasarkan Kajian Literatur Ash-Shiddiq, Hasby; Nursofyan, Frayoga
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

The rapid development of information technology has increased data volume and complexity in various information systems, making efficient search mechanisms essential. Search algorithms play a crucial role in determining data access speed and overall system performance. This study aims to analyze the characteristics, efficiency, and application contexts of various search algorithms in information systems. The research employs a literature review method by analyzing 15 relevant national journal articles. The results indicate that search algorithms can be classified into linear search algorithms, non-linear search algorithms based on sorted data, graph-based search algorithms, and text pattern-based search algorithms. Each algorithm has specific strengths and limitations influenced by data structure, dataset size, and system requirements. Therefore, selecting an appropriate search algorithm must consider the system context to achieve optimal efficiency and performance.
Analisis Kesiapan Teknologi Informasi dan Implementasi Aplikasi Antropometri Nutrisi Anak untuk Optimalisasi Program Makan Bergizi Gratis Samiatul Milah, Ana; Rahmayani, Rani; Sofiyan, Yanyan
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

The Free Nutritious Meal (MBG) program requires a high-precision monitoring system to ensure its effectiveness in improving children's nutritional status. This study aims to analyze information technology readiness through the development and implementation of the Children's Nutritional Anthropometry (ANA) application. The methodology employs an action research approach involving IT training for 100 health volunteers, digital nutritional counseling, and physical examinations of 500 children. The primary focus of this article is to evaluate how digital infrastructure readiness and technology literacy at the village level influence the accuracy of nutritional monitoring data. The results indicate that the integration of the ANA application significantly accelerates nutritional status reporting and facilitates the distribution of targeted nutritional interventions. Furthermore, the enhancement of IT readiness among health volunteers reduces human error in data entry, ensuring that the MBG program is supported by a robust and reliable decision support system.
Implementasi Algoritma Random Forest dalam Pengukuran Kesiapan Transformasi Digital Desa Kaduwulung Menuju Desa Cerdas Berbasis SNI ISO 37122:2019 Firmansyah, Esa; Agreindra Helmiawan, Muhammad; Herdiana, Dody; Yuniarto, Dwi
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

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

Abstract

The readiness of healthcare workers and village officials in adopting digital technology is a decisive factor for the success of transforming into a smart village. This study aims to measure the digital transformation readiness level of Kaduwulung Village using the SNI ISO 37122:2019 standard through village data mapping and the implementation of the Random Forest algorithm for digital maturity classification. The research methodology employs a quantitative approach using the Design Thinking model combined with the Technology Acceptance Model (TAM) evaluation. The design results demonstrate that the integration of automated scoring features can assist in faster decision-making for public services. Based on the testing, the system obtained a System Usability Scale (SUS) score of 74 and a User Experience Questionnaire (UEQ) score of 1.98, proving that technology adoption readiness is significantly influenced by ease of navigation and system infrastructure support.

Page 5 of 5 | Total Record : 49

 1   2   3   4   5 

Filter by Year

2022 2025


Reset
Filter By Issues
All Issue Vol. 19 No. 2 (2025): Infoman's Vol. 19 No. 1 (2025): Infoman's Vol. 18 No. 2 (2024): Infoman's Vol. 18 No. 1 (2024): Infoman's Vol. 17 No. 2 (2023): Infoman's Vol. 16 No. 1 (2022): Infoman's