Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Proceeding of the Electrical Engineering Computer Science and Informatics Logic : Jurnal Rancang Bangun dan Teknologi
M. Aris Ganiardi
Politeknik Negeri Sriwijaya
Computer Science & IT Education Electrical & Electronics Engineering

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

Found 2 Documents
Search

 1 
Computer Anxiety and Computer Attitude towards Computer Self Efficacy (CSE) Polsri Telecommunication Engineering Student on Writing the Final Report Irma Salamah; M. Aris Ganiardi; RD Kusumanto
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 2: EECSI 2015
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1021.294 KB) | DOI: 10.11591/eecsi.v2.786

Abstract

Various attitudes emerged and shown byindividuals for the presence of computer. Although manybenefits are felt by the computer, but there are some peoplewho feel anxious with the computer (computer anxiety).Computer attitude showed no reaction or behave the computerby pleasure or displeasure against the computer. Thephenomenon that arises is computer anxiety and computerattitude can affect a person's expertise in the use or operate thecomputer. This study aims to examine how the effect ofcomputer anxiety and computer attitude towards computer selfefficacy on the 6th semester student telecommunicationsengineering POLSRI. Samples taken in this study were allstudents of telecommunication engineering 6th semesterPOLSRI totaling 89 people. The results showed computeranxiety and computer attitude not affect the computer selfefficacy6th semester student of telecommunicationsengineering POLSRI. This is due because the 6th semesterstudent of telecommunications engineering POLSRI havepositive feelings to learn the computer either by themselves orthrough a learning courses.They also realize that the computerprovides many benefits. With the computer, the informationcan be obtained more quickly and efficiently. Computer is anecessity, can enhance human life, and was instrumental ineducation and employment.
Mobile Application Searching of the Shortest Route on Delivery Order of CV. Alfa Fresh With Brute Force Algorithm Indri Ariyanti; M. Aris Ganiardi; Ulsa Oktari
Logic : Jurnal Rancang Bangun dan Teknologi Vol 19 No 3 (2019): November
Publisher : Pusat Penelitian dan Pengabdian kepada Masyarakat (P3M) Politeknik Negeri Bali

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (3029.838 KB) | DOI: 10.31940/logic.v19i3.1437

Abstract

Traveling Salesman Problem is a problem solving used in finding the shortest route to visit all nodes at once and then return to the initial node. Troubleshooting of the Traveling Salesman Problem using the Brute Force algorithm. The object of this research is the courier at CV. Alfa Fresh. The Brute Force algorithm provides a solution for Traveling Salesman Problems to select and determine the shortest routes to deliver orders from the office to the destination. The Brute Force algorithm is an algorithm that is used to match patterns with all routes to be traversed to find the shortest route pattern. The Brute Force algorithm works by enumerating all possible candidates. With this application can facilitate the courier in determining the closest route from the position of the courier.
Co-Authors Indri Ariyanti Irma Salamah RD Kusumanto Ulsa Oktari