Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal JITTER (Jurnal Ilmiah Teknologi Informasi Terapan) JURNAL ILMIAH INFOKOM
Johnson Sihombing
Politeknik Piksi Ganesha
Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Mechanical Engineering

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

Found 2 Documents
Search
Journal : JURNAL ILMIAH INFOKOM

 1 
RUNNING TIME ALGORITHM SEARCHING DATA IN ONE DIMENSION ARRAY USING JAVA NETBEANS jOHNSON SIHOMBING
INFOKOM (Informatika & Komputer) Vol 6 No 1 (2018): JURNAL INFOKOM JUNI 2018
Publisher : POLITEKNIK PIKSI GANESHA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (605.568 KB)

Abstract

Data search algorithms are often used in any programming consisting of: sequentialsearching, binary searching and interpolation searching.Search data can be done in an array, either one-dimensional array, two dimensional andeven n-dimensional. For the research, the author only do the implementation of searchalgorithm on a one dimensional array that each data element is numeric type.The search process is performed on consecutive and non-sequential data in the array.Unassisted data can be found in sequential searches. The opposite is true for binarysearch and interpolation search.The purpose of implementing the algorithm is to show the difference of the result of therunning time of the three search algorithms above, which can be visualized in graphicalform.The results are obtained after the authors perform the implementation of searchalgorithm by using a desktop-based Java software with editor or compiler Netbeans 8.1.
PENERAPAN STACK DAN QUEUE PADA ARRAY DAN LINKED LIST DALAM JAVA Johnson Sihombing
INFOKOM (Informatika & Komputer) Vol 7 No 2 (2019): JURNAL INFOKOM DESEMBER 2019
Publisher : POLITEKNIK PIKSI GANESHA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (772.34 KB)

Abstract

In data structure programming, stack and queue are two types of non-primitive data structures of abstract data type that are used to store data elements both in arrays and in linked lists that are actually based on several events in real life. Stack uses the LIFO (last in first out) method to access and add data elements while the queue uses the FIFO (First in first out) method to access and add data elements. The study uses integer data types to be included in arrays and linked lists and tested against it by creating application programs using the Java programming language, which is a programming language with an object oriented concept. By using the JDK (Java Develompent Kit) version, the Java class to operate the linked list, queue and stack is available. To access data from these classes can be converted into an array or iterator (one-way list). Java already provides a LinkedList that is used as a queue, a Stack that is used as a stack, and ArrayDeque as a deque (a combination of queue and stack).
Co-Authors Pasaribu, Johni S