Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal ComTech: Computer, Mathematics and Engineering Applications
Subandijo Subandijo
Bina Nusantara University
Computer Science & IT Engineering Mathematics

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

Found 4 Documents
Search

 1 
Perbandingan Antara C++ dan Java dalam Pengelolaan Sumber Subandijo Subandijo
ComTech: Computer, Mathematics and Engineering Applications Vol. 3 No. 2 (2012): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v3i2.2316

Abstract

This article contains a descriptive comparison of four features between C++ and Java. The first feature discusses about memory management that focuses on exception safety. The second compares the C++ destructor to Java finalizer. Third feature discusses about Java finally block. The forth is about C++ and Java implementation in order to access a data structure.
Kombinator-Y untuk Melakukan Memoizing Fungsi Rekursif Subandijo Subandijo
ComTech: Computer, Mathematics and Engineering Applications Vol. 3 No. 1 (2012): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v3i1.2468

Abstract

This article discusses how to find a solution of a recursive function such as Fibonacci or factorial numbers without repetition. Therefore, a recursive function is considered a fixed-point of non-recursive function. To calculate the fixed-point, we can use Y Combinator, a non-recursive functions to perform memoizing recursive function. This method can significantly reduce the execution time of recursive functions.
Paradigma Bahasa Pemrograman Subandijo Subandijo
ComTech: Computer, Mathematics and Engineering Applications Vol. 2 No. 2 (2011): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v2i2.2818

Abstract

This article discusses several paradigms used in developing computer programs which is varied from the classical – goto programming, until the modern one – object oriented programming. In addition, the main features of each paradigm, the advantages and disadvantages of each paradigm and the comparation of procedural programming, the object oriented programming, and an additional feature like generic programming for the object oriented programming are also discussed in this article. 
Efisiensi Algoritma dan Notasi O-Besar Subandijo Subandijo
ComTech: Computer, Mathematics and Engineering Applications Vol. 2 No. 2 (2011): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v2i2.2835

Abstract

Efficiency or the running time of an algorithm is usually calculated with time complexity or space complexity as a function of various inputs. It is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. Brute-force algorithm is the easiest way to calculate the performance of the algorithm. However, it is not recommended since it does not sufficiently explain the efficiency of the algorithm. Asymptotic estimaties are used because different implementations of the same algorithm may differ in efficiency. The big-O notation is used to generate the estimation. 
Co-Authors