Search

The complicated case of scheduling courses at the Mathematics and Natural Sciences Faculty of Mathematics Study Program, Universitas Jenderal Soedirman, is a topic that is quite interesting to discuss and find a solution to using a mathematical method. In fact, manual course scheduling without a method is prone to scheduling errors such as class schedule clashes, clashes in the use of lecture rooms and so on, so a more efficient method of scheduling courses is needed. Scheduling lectures with the backtracking algorithm is a systematic and efficient method of scheduling lectures with influencing factors such as the number of courses, number of sessions, number of rooms, and lecture time. Algorithm backtracking is an algorithm based on Depth First Search to find solutions to problems more efficiently. The back tracking algorithm performs a systematic search for solutions to all possible solutions at each node based on recursive Depth First Search. Depth First Search is a search method that is carried out at one node in each level from the far left. If a solution has not been found, then the search continues on the right hand node. And so on until a solution is found or if you find a dead end it will backtrack to the previous position. If a solution is found, the search will stop even if there are nodes that have not been traced. The implementation of the backtracking algorithm pays close attention to the factors that become obstacles in scheduling courses. The course schedule function with the backtracking algorithm can meet every influencing factor such as the number of courses, rooms, classes, and lecture time so that scheduling lectures with this method is very helpful because the method used is more efficient and can avoid errors in scheduling.

Hill Cipher is a symmetric cryptographic algorithm that can be used to encrypt and decrypt. Hill Cipher has several advantages including the key used to encrypt and decrypt is a square matrix of size n x n which has a multiplicative inverse because the inverse is the key used to decrypt. This study discusses the design of encryption and decryption program using with Java. The resulting program is capable of encrypting and decrypting with key 2 x 2, 3 x 3 , and 4 x 4.

Quine McCluskey method is one method that can be used to simplify the Boolean function. The Quine McCluskey method has several advantages including having simpler, more systematic steps than other methods and it is easier to simplify the Boolean function with a large number of variables. This study discusses the design of a Boolean function simplification program for the Quine McCluskey method using Visual Basic 6.0. The resulting program can simplify the Boolean function with many variables less than equal to 26 variables and able to simplify the Boolean function in the form of Sum of Product (SOP), Product of Sum (POS), and don't care.

Travelling Salesman Problem (TSP) is a problem to find the shortest path a salesman visitS all the cities exactly once, and return to the starting city. In this reseacrh, the methods for TSP used are the nearest insertion method, the cheapest insertion method, and the farthest insertion method. With help the function of Software R to creat a minimum TSP Program from three insertion methods.The TSP results for same number of point using three insertion methods do not always have the same weight and route but depending on the data used.

Lucas triangle is an array of coeficients of a polynomial forming a pattern which is similar to Pascal triangle. This research studies Lucas triangle and its properties. The research results show that every row in Lucas triangle is begun by the number 1 and is ended by the number 2, the sum of the first n terms of number of 1th column is equal to the number at th row, 2nd column. Besides, the number at nth row and th column of Lucas triangle is for , the sum of the first n terms of number of jth column is equal to the number at th row, column for . The number of Lucas triangle is the sum of two number terms in preceded row, that is the number at th row, and the number at th row, . Then, the sum of coefficients of each row of Lucas triangle is . Full Article

– Salah satu permasalahan mendasar proses pengembangan perangkat lunak adalah kebutuhan yang tidak tertangkap lengkap saat awal pengembangan, atau abstraksi kebutuhan pengguna yang kurang terpetakan secara sistematis, runut oleh pengembang. Ketidaksempurnaan pengungkapan kebutuhan pengguna tersebut dapat mengakibatkan produk perangkat lunak yang kurang lengkap bahkan bisa tidak sesuai dengan kebutuhan pengguna. Ketidaksesuaian baru dapat diamati oleh pengguna setelah pengembang menyelesaikan setiap rilis produk. Pada paper ini akan ditunjukkan bagaimana sebuah perangkat lunak SPMI dirancang, diterima oleh pengguna, diberikan masukan oleh pengguna atas masukan perbaikan pada kurun waktu tertentu. Metode yang digunakan dalam proses pengembangan perangkat lunak adalah metode DevOps yang memiliki kemampuan untuk mensinkronkan kebutuhan pengguna dengan pengembangan aplikasi yang berkelanjutan, cepat selama pengembangan dan pengoperasian berlangsung. Metode DevOps tidak hanya mengelola bagian pengembangan tetapi juga mengelola bagian pengoperasian. Hasil perancangan menunjukkan bahwa DevOps menjadi pendekatan tepat agar perangkat lunak pengembangan SPMI dikembangkan dari kecil menjadi besar, step by step tetapi tanpa kehilangan penelusuran antara rilis produk. Dan yang lebih mendasar, DevOps mampu memperkecil gap antara pengembang dengan pengguna aplikasi SPMI-PT. Melalui metode DevOps, pengembangan dan pengoperasian memiliki keterhubungan sebagai timbal balik antara pengembangan dengan pengoperasian maupun sebaliknya.Abstract – One of the fundamental problems of the software development process is the requirement that is not completely captured at the beginning of development, or the abstraction of user requirements that are less systematically mapped out, by the developer. Imperfections in disclosing the requirements of these users can result in incomplete software products that may not even match the user's needs. New nonconformities can be observed by users after the Developer completes each product release. In this paper, we will show how an SPMI software is designed, accepted by the user, given input by the user for input improvement in a certain period time. The method used in the software development process is the DevOps method which can synchronize user requirements with rapid, rapid application development during development and operation. The DevOps method not only manages the development part but also manages the operation part. The design results show that DevOps is the right approach so that SPMI development software is developed from small to large, step by step but without losing traces between product releases. And more fundamentally, DevOps can reduce the gap between developers and SPMI-PT application users. Through the DevOps method, development and operation have a relationship as a trade-off between development and operations and vice versa.Keywords – Software engineering, Devops, Continuous improvement

This paper discusses the application of two types of stopping criterion on the strawberry algorithm, which are stopping criteria based on iterative error and Cauchy criterion. Furthermore, the strawberry algorithm program is simulated on the optimization problem with the objective function is quadratic function. The simulation results on optimization problem with the objective function is quadratic function show that strawberry algorithm with stopping criterion based on Cauchy criterion has the best performance, when compared with stopping criterion based on iterative error and without stopping criterion

This paper discusses fuzzy labeling graph and its properties. The properties discussed are fuzzy labeling subgraph, union graph, and fuzzy magic graph. The results showed that the strength of connectedness for pair of vertices in a graph with fuzzy labeling is always greater than or equal to the strength of connectedness for pair of vertices in its subgraph. In addition, union of two graph with fuzzy labeling will form a graph with fuzzy labeling. Meanwhile, on magic labeling there is always a fuzzy bridge on fuzzy magic graph.

Matriks Laplacian dari suatu graf G adalah matriks diagonal dikurangi dengan matriks ketetanggaan. Paper ini membahas karakteristik nilai eigen dari matriks Laplacian dan hubungan nilai eigen matriks Laplacian dengan nilai eigen matriks ketetanggaan dari graf reguler.