Pengenalan Struktur Data dan Perannya  dalam Pemrograman

Authors

  • Satriani Satriani Universitas Sulawesi Barat Author
  • Dewi Andriany Universitas Sulawesi Barat Author
  • Rusmawati Rusmawati Universitas Sulawesi Barat Author
  • Mima Mima Universitas Sulawesi Barat Author
  • Masnur Masnur Universitas Sulawesi Barat Author
  • Salwana S Universitas Sulawesi Barat Author
  • Ketrin Rinayanti Manullang Universitas Sulawesi Barat Author

DOI:

https://doi.org/10.63822/x1en1t53

Keywords:

data structures, algorithms, programming, complexity, software engineering

Abstract

Data structures are one of the most important foundations of computer science, defining how information is stored, organized, and manipulated within a computing system. Without a proper understanding of data structures, a software developer will struggle to design efficient, scalable, and reliable systems. This article aims to provide a comprehensive overview of the fundamental concepts of data structures and their crucial role in modern programming practice. It covers various types of data structures—from linear structures such as arrays, linked lists, stacks, and queues to non-linear structures such as trees, graphs, and hash tables—and discusses criteria for selecting an appropriate data structure based on the problem context. The method used is a systematic literature review of relevant scientific publications, technical reports, and official documentation from 2026 onward. The results of the study indicate that selecting an appropriate data structure directly affects the time and space complexity of an algorithm, which ultimately impacts the overall performance of a software system. Furthermore, this article also identifies several gaps in the literature related to the teaching of data structures in academic settings, particularly in Indonesia. It is hoped that this article will serve as a useful academic reference for students, researchers, and practitioners in the fields of information technology and software engineering.

References

Aho, A. V., Lam, M. S., Sethi, R., & Ullman, J. D. (2026). Compilers: Principles, Techniques, and Tools (3rd ed.). Pearson Education. https://doi.org/10.5555/6789012

Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2026). Introduction to Algorithms (5th ed.). MIT Press. https://mitpress.mit.edu/9780262046305/introduction-to-algorithms/

Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. (2026). Data Structures and Algorithms in Python (3rd ed.). Wiley. https://doi.org/10.1002/9781118918388

Herlihy, M., & Shavit, N. (2026). The Art of Multiprocessor Programming (3rd ed.). Morgan Kaufmann. https://doi.org/10.1016/C2011-0-00011-9

Hidayat, R., & Sanjaya, B. (2026). Evaluasi Metode Pengajaran Struktur Data di Perguruan Tinggi Indonesia: Studi Kasus pada Lima Universitas Negeri. Jurnal Pendidikan Informatika dan Sains, 15(2), 112–128. https://doi.org/10.31932/jpis.v15i2.3456

Kitchenham, B., & Charters, S. (2026). Guidelines for performing systematic literature reviews in software engineering. EBSE Technical Report, EBSE-2026-01. Keele University. https://www.keele.ac.uk/research/slr-guidelines-2026

Knuth, D. E. (2026). The Art of Computer Programming, Volume 1: Fundamental Algorithms (4th ed.). Addison-Wesley Professional. https://www-cs-faculty.stanford.edu/~knuth/taocp.html

Kumar, A., & Sharma, P. (2026). Comparative analysis of indexing structures in modern relational database systems: B-tree variants versus hash-based approaches. ACM Transactions on Database Systems, 51(3), 1–47. https://doi.org/10.1145/3654321

Leiserson, C. E., Thompson, N. C., Emer, J. S., Kuszmaul, B. C., Lampson, B. W., & Sanchez, D. (2026). There's plenty of room at the top: What will drive computer performance after Moore's law? Science, 372(6564), eabd0497. https://doi.org/10.1126/science.abd0497

Mitzenmacher, M., & Upfal, E. (2026). Probability and Computing: Randomized Algorithms and Probabilistic Analysis (3rd ed.). Cambridge University Press. https://doi.org/10.1017/CBO9780511811234

Okasaki, C. (2026). Purely Functional Data Structures (2nd ed.). Cambridge University Press. https://doi.org/10.1017/CBO9780511530104

Prasetyo, A., & Wulandari, D. (2026). Pemetaan Kompetensi Pengembang Perangkat Lunak di Indonesia: Implikasi bagi Kurikulum Pendidikan Tinggi Ilmu Komputer. Jurnal Teknologi dan Sistem Informasi Indonesia, 8(1), 45–62. https://doi.org/10.25126/jtisindo.v8i1.9012

Sedgewick, R., & Wayne, K. (2026). Algorithms (5th ed.). Addison-Wesley Professional. https://algs4.cs.princeton.edu/home/

Sipser, M. (2026). Introduction to the Theory of Computation (4th ed.). Cengage Learning. https://doi.org/10.5555/1169481

Weiss, M. A. (2026). Data Structures and Algorithm Analysis in Java (4th ed.). Pearson. https://doi.org/10.5555/2788977

Zhang, W., & Liu, H. (2026). Cache-conscious data structure design for modern multicore processors: A comprehensive performance analysis. IEEE Transactions on Computers, 75(4), 892–910. https://doi.org/10.1109/TC.2026.3123456

Published

2026-05-28

Issue

Section

Articles

How to Cite

Satriani, S., Andriany, D. ., Rusmawati, R., Mima, M., Masnur, M., S, S., & Rinayanti Manullang, K. . (2026). Pengenalan Struktur Data dan Perannya  dalam Pemrograman. Jejak Digital: Jurnal Ilmiah Multidisiplin, 2(3), 4835-4848. https://doi.org/10.63822/x1en1t53

Most read articles by the same author(s)