Claim Missing Document
Check
Articles

Found 2 Documents
Search

Pendeteksian Bit Error Dalam Transmisi Data Dengan Menerapkan Cyclic Redudancy Check Sirait, Matias Julius Fika; Sinaga, Sony Bahagia
MEANS (Media Informasi Analisa dan Sistem) Volume 3 Nomor 2
Publisher : LPPM UNIKA Santo Thomas Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (361.342 KB) | DOI: 10.54367/means.v3i2.291

Abstract

The communication path that will physically connect the two technologies conceptually works together such as cables. A special feature of a channel that resembles a cable is where the bits will be forwarded in the same order along with the bits sent. Data link layers have specific functions, this function includes starting from providing interfaces for services that are good for the network layer. Communication flows often make mistakes, sometimes having limited data rates and experiencing propagation delays other than zero between when bits are sent when the bit is received. This limitation is an implication of the importance of the efficiency of data transfer. Delivery of information in the telecommunications world will often occur errors in the data to be sent. This error is caused by a disturbance at the physical level, which is a disruption of the transmission line media, such as interference with electromagnetic radiation, cross communication, lightning or noise disturbance. This interference causes the information received does not match the information sent. The Cyclical Redundancy Check method, or CRC, is a method for handling error detection, this method uses binary numbers. The CRC data detection model is sent perframe consisting of a long row of bits for each frame.
Optimal Course Scheduling Decision Support System Using CSP Method Based on Room and Lecturer Availability Naibaho, Eltrina; Sianturi, Ronda Delli; Sirait, Matias Julius Fika; Sianturi, Anggita H.
Bahasa Indonesia Vol 17 No 06 (2025): Instal : Jurnal Komputer
Publisher : Cattleya Darmaya Fortuna

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54209/jurnalinstall.v17i06.411

Abstract

Course scheduling is a complex and critical task for universities, as it must consider various constraints such as lecturer availability, classroom capacity, and time slot limitations. Improper scheduling can lead to inefficiencies, conflicts, and dissatisfaction among lecturers and students. This study aims to develop a Decision Support System (DSS) for optimal course scheduling at Universitas Budidarma using the Constraint Satisfaction Problem (CSP) method. CSP provides a structured approach to solve scheduling problems by defining variables, domains, and constraints, and finding solutions that satisfy all requirements. The system was designed to input course data, lecturer availability, and available classrooms, then generate a conflict-free schedule automatically. Testing results show that the CSP-based system successfully generated valid schedules that met all given constraints, reduced scheduling conflicts, and improved resource utilization. This research demonstrates that CSP is an effective method for handling complex academic scheduling tasks, supporting more efficient academic planning processes in higher education institutions.