Data structures play a central role in modern computer science. They enable an efficient storage of data for an easy access. They enable us to represent the inherent relationship of the data in the real world. It enables an efficient processing of data. They help in data protection and management.
Hence it is very important for students to learn about these data structures in order to learn the programming concepts. But through theoretical knowledge, one cannot get a complete idea of these concepts. So in order to help them, we have developed a system that visualizes various programming concepts using java applets. Those applets visualize all the inherent mechanism of all those concepts.
Although there exists many forms of visualizations of data structures , we have chosen java applets because of various benefits they offer.
The features of all the java applets developed are:
- STACK: The operations like push, pop, top of the stack, is empty, is full are performed on the stack.
- QUEUE: The operations like insertion, deletion, rear of the queue, front of the queue, is empty, is full are performed on the queue.
- CIRCULAR QUEUE: The operations like insertion, deletion, rear of the queue, front of the queue, is empty, is full are performed on the circular queue.
- SINGLY LINKED LIST: The operations like insertion, deletion and search operations are performed on the singly linked list.
- DOUBLY LINKED LIST: The operations like insertion, deletion and search operations are performed on the doubly linked list.
- BUBBLE SORT: Various numbers are sorted in ascending order according to the bubble sort technique.
- INSERTION SORT: Various numbers are sorted in ascending order according to the insertion sort technique.
- SELECTION SORT: Various numbers are sorted in ascending order according to the selection sort technique.
- LINEAR SEARCH: A list of elements are created and the required value is searched in the list based on the linear search strategy.
- BINARY SEARCH: A list of elements are created and the required value is searched in the list based on the binary search strategy.
- BINARY SEARCH TREE: Operations insertion, deletion are performed on the binary search tree. Also the search operation is performed on the tree.
- TREE TRAVERSAL: A tree is created and the operations infix, prefix, postfix are performed on the tree.
- GRAPH TRAVERSAL: A graph is created and the operations BFS,DFS are performed on the graph.
- DIJKSTRA’S ALGORITHM: A graph is created and the shortest path from start node to each node in the graph is determined.
Download -Data Structures Project in Java
Tags:
javaprojects