International Journal of Data Structure Studies
Computer/IT ISSN 3049-2440 2 issues a year Hybrid open accessWhat does hybrid open access mean? This journal has two kinds of articles. Open access articles are free for anyone to read; the author pays an article processing charge for that. All other articles are for subscribers. Authors can also publish at no cost under the subscription-based option.
Submit a manuscript SubscribeRequest for my libraryEarlier years Calculate APC Search this journal Editorial board (6)
About the journal
Journal metrics
Counted from this archive, not supplied by anyone.
- 38Articles published
- 8Published in 2026
- 87Authors
- 0Open access
Journal information
- Title
- International Journal of Data Structure Studies
- Issues per year
- 2 issues
- ISSN
- 3049-2440
- Publisher
- STM Journals
- Starting year
- 2023
- Subject
- Computer/IT
- Publication format
- Hybrid open access
- Language
- English
- Copyright policy
- CC BY-NC-ND 4.0
- Type
- Peer-reviewed journal (refereed)
- Article processing charge
- ₹10,000 in India · $400 outside India
- Subscription-based publication
- No cost. Author copy, DOI and certificate are chargeable.
Indexed in
Editorial board
-
Editor-in-Chief
Computer Applications, Marwadi University, India
Latest articles
-
A Comprehensive Review of Durable State Persistence Techniques for Resilient API Calls in Kubernetes-Based Microservices
Abstract: Kubernetes lets teams scale microservices and replace pods almost without notice. The same design that makes clusters reliable creates an intractable problem for API calls that require multiple steps on multiple individual services. A pod can stop suddenly. Any progress retained only in the memory vanishes. The client is forced to start the whole thing over. Data that is left behind can end up inconsistent. Durable state persistence is a …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article
-
Interactive Visualization and Analysis of Sorting
Abstract: This paper describes a complete review of pedagogical barriers to teaching algorithms, including development of an interactive visualization and analysis tool in Java to represent three commonly used sorting algorithms: Quick Sort, Merge Sort, and Heap Sort. Sorting algorithms are a critical part of many types of data processing, but for some students they can be challenging to visualize or conceptualize as a series of steps because traditional methods of …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article
-
Traversal Speed Comparison of BFS and DFS in Balanced and Skewed Binary Trees
Abstract: In this paper, we provide an analysis of how well both breadth-first search (BFS) and depth-first search (DFS) algorithms perform while wandering through two kinds of binary trees: balanced and skewed. The research was motivated by the practical application of storing files and directories in a certain type of parent-child relationship through the use of hierarchical file systems (e.g., windows explorer). The result of measuring how fast and versatilely these …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 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
-
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
-
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
-
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
-
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