International Journal of Data Structure Studies
Volume 4, Issue 1 (2026)
Table of contents
-
Machine Learning Based Sentiment Analysis of Student Feedback in Higher Education
Abstract: Educational institutions routinely collect feedback from students to understand their perceptions of academic programs, infrastructure, and campus facilities, to improve the overall quality of the college environment. In current practice, feedback is often gathered using numerical or grade-based rating systems, which tend to oversimplify student opinions and may overlook important details related to their level of satisfaction. In contrast, open-ended textual feedback allows students to clearly express their views, concerns, …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 01–10 Read article
-
Data Structure Driven Probabilistic Deadlock Resolution in Multiprocessor Systems
Abstract: Deadlock resolution in multiprocessor systems is fundamentally a graph-theoretic and probabilistic decision problem. Existing victim selection heuristics, such as youngest, oldest, and lowest priority, apply static rules that overlook the dynamic runtime state of processes, leading to unnecessary computational loss. This paper reframes the inference-guided preemption (IGP) algorithm as a data-structure-centric solution, highlighting how resource allocation graphs, wait-for graphs, adjacency lists, min-heaps, and hash-based evidence stores interact to enable efficient …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 11–20 Read article
-
An Auxiliary Array Indexing Approach for Efficient Binary Search in Linked Lists
Abstract: The paper covers an algorithm for searching a linked list structure using binary search. Binary search is a classic example of an algorithm that follows the divide-and-conquer approach. Binary search may be used to find elements in an array. Trying to apply the conventional binary search to a linked list simply does not work out very well; it still has an O(n) time complexity, the same as linear search. This …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 21–28 Read article
-
Learning Data Structures: Key to Good Programming
Abstract: Data structures are the most crucial feature of good programming and are needed to solve hard computational problems. This model makes use of two different recurrent neural network architectures, specifically long short-term memory (LSTM), and gated recurrent unit (GRU) networks. It explains how selecting and using the correct data structures may speed up computations, optimize memory, and scale code. How data structures and algorithms relate and how to think about …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 29–39 Read article
-
Improving Dataset Integrity Through Automated Data Cleaning Techniques
Abstract: High-quality data is a fundamental requirement in data science for producing trustworthy analytical insights and effective machine learning models. Problems, including incomplete records, inconsistent entries, duplicate observations, and anomalous values, can severely reduce the accuracy and robustness of predictive systems. As modern datasets continue to expand in both volume and structural complexity, relying on manual data cleaning methods become time-consuming and error-prone, highlighting the growing importance of automated data preprocessing …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 40–45 Read article