Java Programs for Data Structures
Uploaded by
hindunation69Java Programs for Data Structures
Uploaded by
hindunation69Java - Assignment 3
Program 1:Write a programin JAVA to create a 3D array (containing integer
alues) and display it on the console. Then input a number from the user and
v
check whether it is present.
import
java
.
u
til
.
S
canner
;
public
class
ThreeDArraySearch
{
public
static
void
main
(
S
tring
[]
args
) {
// Initialize a 3D array with integer values
int
[][][]
array
=
{
{
{
1
,
2
,
3},
{
4
,
5
,
6}
},
{
{
7
,
8
,
9},
{
10
,
11
,
12
}
}
};
// Display the 3D array
System
.
o
ut
.
println
(
"3D Array Elements:"
);
for
(
i
nt
i
=
0
;
i
<
array
.
length
;
i
++
) {
for
(
int
j
=
0
;
j
<
array
[
i
]
.
length
;
j
++
) {
for
(
i
nt
k
=
0;
k
<
array
[
i
]
[
j
].
length
;
k
++
) {
System
.
out
.
p
rint
(
array
[
i
]
[
j
]
[
k
]
+
" "
);
}
System
.
out
.
p
rintln
();
}
System
.
out
.
println
();
}
// Take input from the user
Scanner
scanner
=
new
Scanner
(
System
.
in
);
System
.
o
ut
.
print
(
"Enter a number to search: "
);
int
searchNumber
=
scanner
.
nextInt
();
scanner
.
close
();
// Search for the number in the 3D array
boolean
found
=
false
;
for
(
i
nt
i
=
0
;
i
<
array
.
length
;
i
++
) {
for
(
int
j
=
0
;
j
<
array
[
i
]
.
length
;
j
++
) {
for
(
i
nt
k
=
0;
k
<
array
[
i
]
[
j
].
length
;
k
++
) {
if
(array
[
i
][
j
]
[
k
]
==
searchNumber
) {
found
=
true
;
break
;
}
}
}
Java - Assignment 3
}
// Display result
if
(
f
ound
) {
System
.
out
.
println
(
s
earchNumber
+
" is present in the 3D array."
);
}
else
{
System
.
out
.
println
(
s
earchNumber
+
" is not found in the 3D array."
);
}
}
}
Flowchart:
Results:
Java - Assignment 3
rogram 2: Write a program in Java to implement a linked list containing 5 numbers
P
<11, 22, 6, 89, 99> and then perform the following: Then insert a number <50> in the
third position of the linked list and print the new linked list <11, 22, 50, 6, 89, 99>.
Delete the 2nd element of the linked list and print the remaining linked list <11, 50, 6,
89, 99>. Delete the 1st element of the linked list and print the remaining linked list <50,
6, 89, 99>. Delete the last element of the linked list and print the remaining linked list
<50,6,89>
class
Node
{
int
data
;
Node
next
;
Node
(
int
data
) {
this
.
d
ata
=
data
;
this
.
n
ext
=
null
;
}
}
public
class
LinkedListOperations
{
Node
head
;
// Method to add a node at the end
void
add
(
i
nt
data
) {
Node
newNode
=
new
Node
(
d
ata
);
if
(
h
ead
==
null
) {
head
=
newNode
;
return
;
}
Node
temp
=
head
;
while
(
temp
.
n
ext
!=
null
) {
temp
=
temp
.
next
;
Java - Assignment 3
}
temp
.
n
ext
=
newNode
;
}
// Method to insert at a specific position
void
insertAt
(
int
index
,
int
data
) {
Node
newNode
=
new
Node
(
d
ata
);
if
(
i
ndex
==
0
) {
newNode
.
n
ext
=
head
;
head
=
newNode
;
return
;
}
Node
temp
=
head
;
for
(
i
nt
i
=
0
;
temp
!=
null
&&
i
<
index
-
1
;
i++
) {
temp
=
temp
.
next
;
}
if
(
t
emp
==
null
)
return
;
newNode
.
next
=
temp
.
n
ext
;
temp
.
n
ext
=
newNode
;
}
// Method to delete node at a specific position
void
deleteAt
(
int
index
) {
if
(
h
ead
==
null
)
return
;
if
(
i
ndex
==
0
) {
head
=
head
.
next
;
return
;
}
Node
temp
=
head
;
for
(
i
nt
i
=
0
;
temp
!=
null
&&
i
<
index
-
1
;
i++
) {
temp
=
temp
.
next
;
}
if
(
t
emp
==
null
||
temp
.
n
ext
==
null
)
return
;
temp
.
n
ext
=
temp
.
n
ext
.
next
;
}
// Method to display the linked list
void
display
() {
Node
temp
=
head
;
while
(
temp
!=
null
) {
System
.
out
.
print
(
temp
.
d
ata
+
" -> "
);
temp
=
temp
.
next
;
}
System
.
o
ut
.
println
(
"null"
);
}
public
static
void
main
(
S
tring
[]
args
) {
LinkedListOperations
list
=
new
LinkedListOperations
();
// Step 1: Create linked list with initial values
Java - Assignment 3
list
.
a
dd
(
1
1
);
list
.
a
dd
(
2
2
);
list
.
a
dd
(
6
);
list
.
a
dd
(
8
9
);
list
.
a
dd
(
9
9
);
System
.
o
ut
.
print
(
"Original Linked List: "
);
list
.
d
isplay
();
// Step 2: Insert 50 at the third position (index 2)
list
.
i
nsertAt
(
2
,
50
);
System
.
o
ut
.
print
(
"After inserting 50 at position 3: "
);
list
.
d
isplay
();
// Step 3: Delete the 2nd element (index 1)
list
.
d
eleteAt
(
1
);
System
.
o
ut
.
print
(
"After deleting 2nd element: "
);
list
.
d
isplay
();
// Step 4: Delete the 1st element (index 0)
list
.
d
eleteAt
(
0
);
System
.
o
ut
.
print
(
"After deleting 1st element: "
);
list
.
d
isplay
();
// Step 5: Delete the last element
list
.
d
eleteAt
(
3
);
System
.
o
ut
.
print
(
"After deleting last element: "
);
list
.
d
isplay
();
}
}
Flowchart:
Java - Assignment 3
Results:
Java - Assignment 3
rogram 3: Write a program in Java to find duplicate characters in an user defined
P
input sting
import
java
.
u
til
.
H
ashMap
;
import
java
.
u
til
.
M
ap
;
import
java
.
u
til
.
S
canner
;
public
class
FindDuplicateCharacters
{
public
static
void
main
(
S
tring
[]
args
) {
// Taking input from the user
Scanner
scanner
=
new
Scanner
(
System
.
in
);
System
.
o
ut
.
print
(
"Enter a string: "
);
String
input
=
scanner
.
n
extLine
();
scanner
.
close
();
// Create a map to store character frequencies
Map
<
C
haracter
,
Integer
>
charCount
=
new
HashMap
<>();
// Loop through each character of the string
for
(
i
nt
i
=
0
;
i
<
input
.
length
();
i
++
) {
char
c
=
input
.
charAt
(
i
);
charCount
.
p
ut
(
c
,
charCount
.
g
etOrDefault
(
c
,
0)
+
1
);
}
// Print duplicate characters
System
.
o
ut
.
println
(
"Duplicate characters in the string are:"
);
boolean
found
=
false
;
for
(
M
ap
.
E
ntry
<
Character
,
Integer
>
entry
:
charCount
.
entrySet
())
{
if
(
e
ntry
.
getValue
()
>
1
) {
System
.
out
.
p
rintln
(
entry
.
getKey
()
+
" appears "
+
entry
.
getValue
()
+
" times"
);
Java - Assignment 3
found
=
true
;
}
}
if
(
!
found
) {
System
.
out
.
println
(
"
No duplicate characters found."
);
}
}
}
Flowchart:
Java - Assignment 3
Results:
Java - Assignment 3
Problem 4:Write a program in Java to check palindrome string using data types
queue and stack
import
java
.
u
til
.
L
inkedList
;
import
java
.
u
til
.
Q
ueue
;
import
java
.
u
til
.
S
tack
;
import
java
.
u
til
.
S
canner
;
public
class
PalindromeUsingQueueStack
{
public
static
void
main
(
S
tring
[]
args
) {
// Taking input from the user
Scanner
scanner
=
new
Scanner
(
System
.
in
);
System
.
o
ut
.
print
(
"Enter a string: "
);
String
input
=
scanner
.
n
extLine
();
scanner
.
close
();
// Remove spaces and convert to lowercase to handle cases like "A man a
plan"
input
=
input
.
replaceAll
(
"
\
\
s"
,
""
).
toLowerCase
();
// Using Stack for checking palindrome
Stack
<
Character
>
stack
=
new
Stack
<>();
Queue
<
Character
>
queue
=
new
LinkedList
<>();
// Push characters to stack and enqueue to queue
for
(
i
nt
i
=
0
;
i
<
input
.
length
();
i
++
) {
Java - Assignment 3
char
c
=
input
.
charAt
(
i
);
stack
.
push
(
c
);
queue
.
add
(
c
);
}
// Check if the string is a palindrome by comparing stack and queue
boolean
isPalindrome
=
true
;
while
(
!
s
tack
.
isEmpty
()) {
if
(
s
tack
.
pop
()
!=
queue
.
poll
()) {
isPalindrome
=
false
;
break
;
}
}
// Print result
if
(
i
sPalindrome
) {
System
.
out
.
println
(
"
The string is a palindrome."
);
}
else
{
System
.
out
.
println
(
"
The string is not a palindrome."
);
}
}
}
Results:
Program 5: Write a program in Java to check two strings are anagram or not
import
java
.
u
til
.
A
rrays
;
import
java
.
u
til
.
S
canner
;
Java - Assignment 3
public
class
AnagramCheck
{
public
static
void
main
(
S
tring
[]
args
) {
// Taking input from the user
Scanner
scanner
=
new
Scanner
(
System
.
in
);
System
.
o
ut
.
print
(
"Enter the first string: "
);
String
str1
=
scanner
.
nextLine
();
System
.
o
ut
.
print
(
"Enter the second string: "
);
String
str2
=
scanner
.
nextLine
();
scanner
.
close
();
// Remove spaces and convert to lowercase for comparison
str1
=
str1
.
r
eplaceAll
(
"
\
\
s"
,
""
).
toLowerCase
();
str2
=
str2
.
r
eplaceAll
(
"
\
\
s"
,
""
).
toLowerCase
();
// Check if lengths are different
if
(
s
tr1
.
l
ength
()
!=
str2
.
l
ength
()) {
System
.
out
.
println
(
"
The strings are not anagrams."
);
return
;
}
// Convert strings to character arrays
char
[]
arr1
=
str1
.
t
oCharArray
();
char
[]
arr2
=
str2
.
t
oCharArray
();
// Sort the arrays
Arrays
.
s
ort
(
a
rr1
);
Arrays
.
s
ort
(
a
rr2
);
// Compare sorted arrays
if
(
A
rrays
.
equals
(
arr1
,
arr2
)) {
Java - Assignment 3
System
.
out
.
println
(
"
The strings are anagrams."
);
}
else
{
System
.
out
.
println
(
"
The strings are not anagrams."
);
}
}
}
Results:
rogram 6: You are asked to write a discount system for a beauty salon, which
P
provides services and sells beauty products. It offers 3 types of memberships:
Premium, Gold and Silver. Premium, gold and silver members receive a discount of
20%, 15%, and 10%, respectively, for all services provided. Customers without
membership receive no discount. All members receive a flat 10% discount on
products purchased (this might change in future). Your system shall consist of three
classes: Customer, Discount and Visit, as shown in the class diagram. It shall
compute the total bill if a customer purchases $x of products and $y of services, for a
visit. Also write a test program to exercise all the classes.
import
java
.
u
til
.
D
ate
;
class
Customer
{
private
String
name
;
private
boolean
member
=
false
;
Java - Assignment 3
private
String
memberType
;
public
Customer
(
S
tring
name
) {
this
.
n
ame
=
name
;
}
public
String
getName
() {
return
name
;
}
public
boolean
isMember
() {
return
member
;
}
public
void
setMember
(
b
oolean
member
) {
this
.
m
ember
=
member
;
}
public
String
getMemberType
() {
return
memberType
;
}
public
void
setMemberType
(
String
type
) {
this
.
m
emberType
=
type
;
}
@
Override
public
String
toString
() {
return
"Customer[name="
+
name
+
", member="
+
member
+
", memberType="
+
memberType
+
"]"
;
}
Java - Assignment 3
}
class
DiscountRate
{
private
static
final
double
serviceDiscountPremium
=
0.2
;
private
static
final
double
serviceDiscountGold
=
0.15
;
private
static
final
double
serviceDiscountSilver
=
0.1
;
private
static
final
double
productDiscount
=
0.1
;
public
static
double
getServiceDiscountRate
(
String
type
) {
switch
(
t
ype
) {
case
"Premium"
:
return
serviceDiscountPremium
;
case
"Gold"
:
return
serviceDiscountGold
;
case
"Silver"
:
return
serviceDiscountSilver
;
default:
return
0.0
;
}
}
public
static
double
getProductDiscountRate
() {
return
productDiscount
;
}
}
class
Visit
{
private
Customer
customer
;
private
Date
date
;
private
double
serviceExpense
;
private
double
productExpense
;
public
Visit
(
Customer
customer
,
Date
date
) {
this
.
c
ustomer
=
customer
;
this
.
d
ate
=
date
;
Java - Assignment 3
}
public
String
getName
() {
return
customer
.
getName
();
}
public
double
getServiceExpense
() {
return
serviceExpense
;
}
public
void
setServiceExpense
(
d
ouble
ex
) {
this
.
s
erviceExpense
=
ex
;
}
public
double
getProductExpense
() {
return
productExpense
;
}
public
void
setProductExpense
(
d
ouble
ex
) {
this
.
p
roductExpense
=
ex
;
}
public
double
getTotalExpense
() {
double
serviceDiscount
=
customer
.
i
sMember
()
?
DiscountRate
.
getServiceDiscountRate
(
c
ustomer
.
getMemberType
())
:
0
;
double
productDiscount
=
customer
.
i
sMember
()
?
DiscountRate
.
getProductDiscountRate
()
:
0
;
return
(
s
erviceExpense
*
(
1
-
serviceDiscount
))
+
(
productExpense
*
(
1
-
productDiscount
));
}
Java - Assignment 3
@
Override
public
String
toString
() {
return
"Visit[customer="
+
customer
+
", date="
+
date
+
",
serviceExpense="
+
serviceExpense
+
", productExpense="
+
productExpense
+
"]"
;
}
}
public
class
TestSalon
{
public
static
void
main
(
S
tring
[]
args
) {
Customer
customer
=
new
Customer
(
"
Alice"
);
customer
.
setMember
(
t
rue
);
customer
.
setMemberType
(
"
Gold"
);
Visit
visit
=
new
Visit
(
customer
,
new
Date
());
visit
.
setServiceExpense
(
100
);
visit
.
setProductExpense
(
50
);
System
.
o
ut
.
println
(
visit
);
System
.
o
ut
.
println
(
"Total expense: "
+
visit
.
getTotalExpense
());
}
}
Results:
Java - Assignment 3
You might also like
- Java Collection Examples and OperationsNo ratings yetJava Collection Examples and Operations14 pages
- Java Collection Programs by Aditya BankarNo ratings yetJava Collection Programs by Aditya Bankar16 pages
- Java Programs for Data Structures and CollectionsNo ratings yetJava Programs for Data Structures and Collections68 pages
- Java Collections and Data Structures GuideNo ratings yetJava Collections and Data Structures Guide9 pages
- Java Data Structures: Stack, List, Set, Map50% (4)Java Data Structures: Stack, List, Set, Map59 pages
- Java Data Structures: Queue, Stack, HashingNo ratings yetJava Data Structures: Queue, Stack, Hashing5 pages
- JAVA With OOPS Weekly Test 01 Discussion NotesNo ratings yetJAVA With OOPS Weekly Test 01 Discussion Notes24 pages
- JAVA With OOPS Weekly Test 01 Discussion NotesNo ratings yetJAVA With OOPS Weekly Test 01 Discussion Notes24 pages
- Java ArrayList and LinkedList ImplementationNo ratings yetJava ArrayList and LinkedList Implementation6 pages
- Java Array, String, and Linked List OperationsNo ratings yetJava Array, String, and Linked List Operations24 pages
- Operation Research and Linear ProgrammingNo ratings yetOperation Research and Linear Programming12 pages
- 225 - 800 Cycles UMS4 Programming GuideNo ratings yet225 - 800 Cycles UMS4 Programming Guide105 pages
- Review of Andy Clark's Surfing UncertaintyNo ratings yetReview of Andy Clark's Surfing Uncertainty6 pages
- Pairwise Sequ Datab: Appos® ©mimfoimrdaifcltesNo ratings yetPairwise Sequ Datab: Appos® ©mimfoimrdaifcltes25 pages
- Driverless Car - MINDSTORMS EV3 Lesson Plan - LEGO® EducationNo ratings yetDriverless Car - MINDSTORMS EV3 Lesson Plan - LEGO® Education11 pages
- Message Passing and IPC in Operating SystemsNo ratings yetMessage Passing and IPC in Operating Systems13 pages
- ECE 462/562: Computer Architecture CourseNo ratings yetECE 462/562: Computer Architecture Course39 pages
- Class XI Computer Science Revision WorksheetNo ratings yetClass XI Computer Science Revision Worksheet5 pages
- Understanding Types of Artificial IntelligenceNo ratings yetUnderstanding Types of Artificial Intelligence2 pages
- Multi-Objective Optimization of Turning Process During Machining of Almg1Sicu Using Non-Dominated Sorted Genetic AlgorithmNo ratings yetMulti-Objective Optimization of Turning Process During Machining of Almg1Sicu Using Non-Dominated Sorted Genetic Algorithm6 pages
- Chhattisgarh Swami Vivekanand Technical University, BhilahiNo ratings yetChhattisgarh Swami Vivekanand Technical University, Bhilahi1 page