Professional Documents
Culture Documents
Software Engineering
S# Name Roll #
1 Hamnah Asif 2021F-BSE-116
2 Uzbah Naseem 2021F-BSE-292
3 Hamna Khalid 2021F-BSE-293
Section E
Submitted To:
Sir Masood Hussain
1
Contributors:
Project searching, data gathering: Uzbah Naseem, Hamnah Asif, Hamna Khalid
Programming, code modification: Uzbah Naseem , Hamna khalid and Hamnah Asif
Technical Writing and maintaining proposal, report: Hamna Khalid and Uzbah Naseem
Submitted on: 20/December/2022
Project Objective:
This development of a tool designed to provide instructional information of the use of various
programming data structures. The basic concept is to produce a piece of software that allows
users to visualize the behavior of stacks, queues, lists, sets and trees. The final solution allows
users to select a particular data structure, then perform typical operations on that structure using a
graphical user interface. As operations are performed, a graphical representation of the values
should be shown in a manner consistent with how the data structure works. For example, if the
user selects a Stack type data structure then the application would provide buttons to support
Push, Pop, and Peek operations. As the user selects the various operations a graphical
representation of the stack shows the values being added and removed.
The solution is developed using the Java programming language and the AWT/Swing libraries
for the Graphical User Interface. The underlying storage of data is based on the classes provided
by the Java SDK. No other 3rd party libraries outside those available within the standard Java
Development Kit (JDK) is used.
The instructional tool takes the form of a typical desktop GUI type application.
1. Stack
2. Tree
3. Set
4. List
5. Queue
Project Description:
2
STACK
Stack is a linear data structure that follows a particular order in which the operations are performed. The
order may be LIFO(Last In First Out) or FILO(First In Last Out).
Queue
A Queue is defined as a linear data structure that is open at both ends and the operations are performed in
First In First Out (FIFO) order.
LIST
in Java provides the facility to maintain the ordered collection. It contains the index-based methods to
insert, update, delete and search the elements. It can have the duplicate elements also. We can also store
the null elements in the list.
3
SET
The set is an interface available in the java.util package. The set interface extends the Collection
interface. An unordered collection or list in which duplicates are not allowed is referred to as a collection
interface.
BINARY TREE:
Binary tree is a tree type non-linear data structure that are mainly used for sorting and searching because
they store data in hierarchical form. In this section, we will learn the implementation of binary tree data
structure in Java. Also, provides a short description of binary tree data structure.
4
Project Tool and IDE:
We will use Java Programming Language and NetBeans as IDE.
Project Reference:
It is a collective idea to create Data Structure GUI All the project data and its
concepts are gathered by the group members and some websites
References: