This Is Window Based Application Which Represents The Functionalities/ Behaviors Of Different Data Structure And Algorithms

Technologies Used

Programing Language – Java

Graphical User Interface – Java Swing

Concept Used:

Core Java - Data Types, Methods, Inner Classes, etc

Data Structures – Array, Stack, Queue, Circular Queue, Singly LinkedList, Doubly LinkedList, etc.

Algorithms - Bubble Sort, Selection Sort, Insertion Sort, Linear Search, Binary Search.

What is Array in Data Structure?

An array is a data structure for storing more than one data item that has a similar data type. The items of an array are allocated at adjacent memory locations. These memory locations are called elements of that array. The total number of elements in an array is called length.

Why do we need arrays?

Here are some reasons for using arrays in data structure:

• Arrays are best for storing multiple values in a single variable

• Arrays are better at processing many values easily and quickly.

• Sorting and searching the values is easier in arrays.

Home Page of Application

When the user clicks the "Data Structure" button on the main page, that loads the subsequent page. The subsequent page will display information related to data structures, such as a list of common data structures as showm below image. The user can then navigate back to the main page by clicking the "Back" button on their main page, button that be provided on the subsequent page.

In This page there is many buttons that is "Array" ,"Stack" ,"Queue" ,"Circular Queue" ,"Single LinkedList" ,"Doubly LinkedList" When the user clicks any of these button on this page, that loads the particular subsequent page. The subsequent page will display as showm below image. The user can then navigate back to the previous page by clicking the "Back" button on their main page, button that be provided on the subsequent page.

slide-->

"Array DataStructure"

"Stack DataStructure"

"Queue DataStructure"

"CircularQueue DataStructure"

"Single LinkedList"

"Doubly LinkedList"

When the user clicks the "Algorithms" button on the main page, that loads the subsequent page. The subsequent page will display information related to Algorithms, such as a list of common Algorithms shown as above image. The user can then navigate back to the main page by clicking the "Back" button on their main page, button that be provided on the subsequent page.

In This page there is many buttons that is "Linear Search" ,"Binary Search" ,"Bubble Sort" ,"Selection Sort" ,"Insertion sort" , When the user clicks any of these button on this page, that loads the particular subsequent page. The subsequent page will display as showm below image. The user can then navigate back to the previous page by clicking the "Back" button on their main page, button that be provided on the subsequent page.

slide-->

"Linear Search"

"Binary Search"

"Bubble Sort"

"Selection sort"

"Insertion sort"