Implementasi Queue Berbasis Linked List Pada Aplikasi Web Manajemen Antrian Print Mahasiswa
Home Research Details
Sirlia Sahid, Farzad Sahnadi Pasaribu, Mika Monika Fransiska Simanullang, Muhammad Raihansyah Lubis

Implementasi Queue Berbasis Linked List Pada Aplikasi Web Manajemen Antrian Print Mahasiswa

0.0 (0 ratings)

Introduction

Implementasi queue berbasis linked list pada aplikasi web manajemen antrian print mahasiswa. Kelola antrian print mahasiswa secara efisien dengan aplikasi web interaktif berbasis linked list. Sistem FIFO mengurangi waktu tunggu dan kebingungan layanan fotokopi.

0
64 views

Abstract

Queue irregularities are a common problem with photocopying services, particularly with student assignment printing. Because there is no clear system for managing the order in which documents are printed, students often have to wait long periods. This can lead to dissatisfaction and confusion. The purpose of this research is to create an interactive web application capable of managing routine print queues using a linked list-based queue structure. A queue system based on the FIFO (First In First Out) principle was created. This allows each student to enter their identity, the files to be printed, and any special notes about their printing needs. The system then displays a real-time queue list, allowing the photocopy operator to download the files in the correct order.


Review

This paper addresses a common and often frustrating problem: inefficiencies in student assignment printing queues. By proposing an interactive web application that leverages a linked list-based queue structure, the research aims to bring order to a chaotic process. The core contribution is a system built on the FIFO (First In First Out) principle, allowing students to submit their printing requests with necessary details, which are then organized for the photocopy operator. This approach promises a systematic solution to reduce waiting times and improve overall satisfaction by providing a transparent and managed queuing mechanism. The technical foundation of the proposed system, a linked list-based queue, is well-suited for dynamic queue management, offering efficient insertion and deletion operations at the ends, which is ideal for a FIFO system. The abstract highlights practical features like real-time queue display, student identity input, file submission, and special notes, which are critical for a functional and user-friendly application in this context. The ability for operators to download files in the correct order directly addresses the primary issue of disorganized printing. This structured approach to managing print requests via a web interface provides a modern and accessible solution to a traditional problem. While the proposed system offers a promising solution, the abstract primarily focuses on the design and intended functionality. A more comprehensive review would benefit from details on the actual implementation, results from testing (e.g., performance under load, user acceptance), and a discussion of potential challenges. Future research could explore the system's scalability, security considerations for file uploads, and potential integration with existing university systems or payment gateways. Nonetheless, the paper presents a highly relevant and practical application of fundamental data structures to solve a real-world operational problem, making a valuable contribution to improving student services.


Full Text

You need to be logged in to view the full text and Download file of this article - Implementasi Queue Berbasis Linked List Pada Aplikasi Web Manajemen Antrian Print Mahasiswa from Jurnal Ilmu Komputer dan Informatika | E-ISSN : 3063-9026 .

Login to View Full Text And Download

Comments


You need to be logged in to post a comment.