java
I am trying to run my code but it is not letting me i dont know what i should do or fix. Thank you so
much for your help. This is the problem and my code will be on the bottom.
Problem #1 and Only
Dynamic Array of Integers Class
Create a class named DynamicArray that will have convenient functionality similar to JavaScripts
Array object and Javas ArrayList class. The class allows to store array of integers that can grow
and shrink as needed, search for values, remove elements, etc.
You are not allowed to use ArrayList object as well as any methods from java.util.Arrays
class.
Please see the list of required features and methods below.
private int array[] You MUST store the data internally in a regular partially-filled array of integers.
Please DO NOT USE ArrayList. The size of the allocated array is its capacity and will be
discussed below.
private int size. This variable stores the number of occupied elements in the array. Set to 0 in the
constructor.
Constructor with parameter. The parameter defines the capacity (length) of initial array. Allocates
array of given capacity (length), sets size field to 0. In case the parameter given to constructor is 0
or negative, IllegalArgumentException is being thrown.
No-argument constructor. Allocates array of length 3, assigns it to the array field, sets size field to
0.
Copy constructor. The constructor takes an object of type DynamicArray as a parameter and
copies it into the object it creates. The constructor throws IllegalArgumentException if the object
that was passed to copy from is null.
int getSize() returns the number of occupied elements in the array.
int getCapacity() returns the actual size (length) of the partially-filled array
int [] getArray() accessor returns the entire partially-filled array. Make sure you DO NOT return the
private array field, make a copy of it.
int [] toArray() accessor returns an occupied part of the partially-filled array. Make sure you DO
NOT return the private array field. Instead, allocate memory for the new array, copy the occupied
portion of the field into that new object, and return the new array.
public void push(int num) adds a new element to the end of the array and increments the size
field. If the array is full, you need to increase the capacity of the array:
Create a new array with the size equal to double the capacity of the original one.
Copy all the elements from the array field to the new array.
Add the new element to the end of the new array.
Use new array as an array field.
Make sure your method works well when new elements are added to an empty DynamicArray.
public int pop() throws RuntimeException removes the last element of the array and returns it.
Decrements the size field. If the array is empty a RuntimeException with the message Array is
empty must be thrown. At this point check the capacity of the array. If the capacity is 4 times larger
than the number of occupied elements (size), it is time to shrink the array:
Create a new array with the size equal to half of the capacity of the original one.
Copy all the elements from the array field to the new array.
Use new array as an array field.
int get(int index) throws IndexOutOfBoundsException returns element of the array with the
requested index. If the index provided is too large or negative, the IndexOutOfBoundsException is
thrown with the message Illegal index.
int indexOf(int key) returns the index of the first occurrence of the given number. Returns -1 when
the number is not found.
void add(int index, int num) throws IndexOutOfBoundsException adds a new element (passed as
parameter num) to the location of the array specified by index parameter. If the index is larger than
size of the array or less than 0, IndexOutOfBoundsException is thrown. When adding the element
into the middle of the array, youll have to shift all the elements to the right to make room for the
new one. If the array is full and there is no room for a new element, the array must be doubled in
size. Please follow the steps listed in the push() method description to double the capacity of the
array.
int remove ( int index) throws IndexOutOfBoundsException removes and returns the value of an
element at the specified position in this array. When the element is removed from the middle of the
array, all the elements must be shifted to close the gap created by removed element. If the index
value passed into the method is more or equal to the size or less than 0 the
IndexOutOfBoundsException must be thrown. At this point check the capacity of the array. If the
capacity is 4 times larger than the number of occupied elements (size), it is time to shrink the
array.
boolean isEmpty() returns true if the size of the array is 0.
String toString() returns an array as a string of comma-separated values. Sample: [1, 2, 3, 4]
boolean equals(DynamicArray obj) compares two objects (this one and the one passed as
parameter) element-by-element and determines if they are exactly the same. The capacity of the
two objects is not being compared and can be different.
MY CODE;
public class DynamicArray
{
private int Array[];
private int size;
// Constructor with parameter
public DynamicArray(int capacity)
{
if (capacity <= 0)
{
throw new IllegalArgumentException("Invalid capacity: " + capacity);
}
array = new int[capacity];
size = 0;
}
// No-argument constructor
public DynamicArray()
{
this(3);
}
// Copy constructor
public DynamicArray(DynamicArray other)
{
if (other == null)
{
throw new IllegalArgumentException("Cannot copy from null object");
}
array = new int[other.array.length];
System.arraycopy(other.array, 0, array, 0, other.size);
size = other.size;
}
public int getSize()
{
return size;
}
public int getCapacity()
{
return array.length;
}
public int[] getArray()
{
return Arrays.copyOf(Array, Array.length);
}
public int[] toArray()
{
return Arrays.copyOf(array, size);
}
public void push(int num)
{
if (size == array.length)
{
int[] newArray = new int[array.length * 2];
System.arraycopy(array, 0, newArray, 0, array.length);
array = newArray;
}
array[size++] = num;
}
public int pop()
{
if (size == 0)
{
throw new RuntimeException("Array is empty");
}
int num = array[--size];
if (array.length > 4 * size)
{
int[] newArray = new int[array.length / 2];
System.arraycopy(array, 0, newArray, 0, size);
array = newArray;
}
return num;
}
public int get(int index)
{
if (index < 0 || index >= size)
{
throw new IndexOutOfBoundsException("Illegal index");
}
return array[index];
}
public int indexOf(int key)
{
for (int i = 0; i < size; i++)
{
if (array[i] == key)
{
return i;
}
}
return -1;
}
public void add(int index, int num)
{
if (index < 0 || index > size)
{
throw new IndexOutOfBoundsException("Illegal index");
}
if (size == array.length)
{
int[] newArray = new int[array.length * 2];
System.arraycopy(array, 0, newArray, 0, index);
newArray[index] = num;
System.arraycopy(array, index, newArray, index + 1, size - index);
array = newArray;
}
else
{
System.arraycopy(array, index, array, index + 1, size - index);
array[index] = num;
}
size++;
}
public int remove(int index)
{
if (index < 0 || index >= size)
{
throw new IndexOutOfBoundsException("Illegal index");
}
int num = array[index];
System.arraycopy(array, index + 1, array, index, size - index - 1);
size--;
if (array.length > 4 * size)
{
int[] newArray = new int[array.length / 2];
System.arraycopy(array, 0, newArray, 0, size);
array = newArray;
}
return num;
}
public boolean isEmpty()
{
return size == 0;
}
/**
* Returns a string representation of the array in the format of comma-separated values enclosed in
square brackets.
*
* @return a string representation of the array.
*/
public String toString()
{
if (size == 0)
{
return "[]";
}
StringBuilder sb = new StringBuilder("[");
for (int i = 0; i < size - 1; i++)
{
sb.append(arr[i]).append(", ");
}
sb.append(arr[size - 1]).append("]");
return sb.toString();
}
/**
* Compares this DynamicArray object with the specified object for equality.
*
* @param obj the object to compare to.
* @return true if the specified object is equal to this DynamicArray object, false otherwise.
*/
public boolean equals(DynamicArray obj)
{
if (obj == null || getClass() != obj.getClass() || size != obj.size)
{
return false;
}
for (int i = 0; i < size; i++)
{
if (arr[i] != obj.arr[i])
{
return false;
}
}
return true;
}
}

More Related Content

PDF
Given the following errors and class in Java- How are these errors fix.pdf
PPTX
array lecture engineeringinformatin_technology.pptx
PDF
Given the following class in Java- public class ThreeTenDynArray-T- {.pdf
PPT
java detailed aadvanced jaavaaaaa2-3.ppt
DOCX
Arraysnklkjjkknlnlknnjlnjljljkjnjkjn.docx
PPTX
Arrays and Strings engineering education
PDF
Everything needs to be according to the instructions- thank you! SUPPO.pdf
PPTX
javaArrays.pptx
Given the following errors and class in Java- How are these errors fix.pdf
array lecture engineeringinformatin_technology.pptx
Given the following class in Java- public class ThreeTenDynArray-T- {.pdf
java detailed aadvanced jaavaaaaa2-3.ppt
Arraysnklkjjkknlnlknnjlnjljljkjnjkjn.docx
Arrays and Strings engineering education
Everything needs to be according to the instructions- thank you! SUPPO.pdf
javaArrays.pptx

Similar to java I am trying to run my code but it is not letting me .pdf (20)

PPT
Java căn bản - Chapter10
PDF
Java R20 - UNIT-3.pdf Java R20 - UNIT-3.pdf
PDF
Programming in Java: Arrays
PPT
Eo gaddis java_chapter_07_5e
PPTX
6 arrays injava
PPT
17-Arrays en java presentación documento
PPT
Array
PPTX
Tips On The AP FR 21 How to handle AP Review
PPTX
Java arrays
PPT
ch07-arrays.ppt
PPTX
Collection and framework
PDF
Learn Java Part 8
PDF
I really need help with my C++ assignment. The following is the info.pdf
PDF
PPTX
Building Java Programas
PPT
Cso gaddis java_chapter8
PDF
An Introduction to Programming in Java: Arrays
PDF
Description of Static and dynamic arrays
PPTX
Arrays in Java with example and types of array.pptx
DOC
Data structure lecture 2
Java căn bản - Chapter10
Java R20 - UNIT-3.pdf Java R20 - UNIT-3.pdf
Programming in Java: Arrays
Eo gaddis java_chapter_07_5e
6 arrays injava
17-Arrays en java presentación documento
Array
Tips On The AP FR 21 How to handle AP Review
Java arrays
ch07-arrays.ppt
Collection and framework
Learn Java Part 8
I really need help with my C++ assignment. The following is the info.pdf
Building Java Programas
Cso gaddis java_chapter8
An Introduction to Programming in Java: Arrays
Description of Static and dynamic arrays
Arrays in Java with example and types of array.pptx
Data structure lecture 2

More from adinathassociates (20)

PDF
It is somewhat curious that this documentation does not wind.pdf
PDF
izgi ynteminin ve nceden alanm plakann sonularna gre k.pdf
PDF
Jamie needs a new roof on her house The cash cost is 4100.pdf
PDF
It is necessary for Marketers to know how the customers feel.pdf
PDF
James tiene la enfermedad celaca Cul de los siguientes a.pdf
PDF
It is difficult to quantify a value for certain biological a.pdf
PDF
It was leaked that Bergdorf Goodman treated Kayla a Hispanic.pdf
PDF
It is possible to create dynamic GUI applications based on c.pdf
PDF
Joe makes annual income of 5000 for five years Joe withdr.pdf
PDF
Joan Robinson ktisat okumann amac iktisat sorularna bir d.pdf
PDF
Jobyde ie alma ilerleme terfi ve tevik etme grevleri gen.pdf
PDF
It is not option 3 please help What would be the outcome of.pdf
PDF
Joanna and Chip Gaines and Michael Dubin got together recent.pdf
PDF
JKL Co issues zero coupon bonds on the market at a price of.pdf
PDF
Jill is offered a choice between receiving 50 with certaint.pdf
PDF
Jennys Froyo INC Balance Sheet For Year Ended December 31.pdf
PDF
Jim y Sue se iban a casar y estaban muy enamorados Antes de.pdf
PDF
Jhania Bive the muk hroutwes ite p+4i if peras bt in +45 te.pdf
PDF
JAVA Please help me on this method The requirement of the m.pdf
PDF
Jennifer invested the profit of his business in an investmen.pdf
It is somewhat curious that this documentation does not wind.pdf
izgi ynteminin ve nceden alanm plakann sonularna gre k.pdf
Jamie needs a new roof on her house The cash cost is 4100.pdf
It is necessary for Marketers to know how the customers feel.pdf
James tiene la enfermedad celaca Cul de los siguientes a.pdf
It is difficult to quantify a value for certain biological a.pdf
It was leaked that Bergdorf Goodman treated Kayla a Hispanic.pdf
It is possible to create dynamic GUI applications based on c.pdf
Joe makes annual income of 5000 for five years Joe withdr.pdf
Joan Robinson ktisat okumann amac iktisat sorularna bir d.pdf
Jobyde ie alma ilerleme terfi ve tevik etme grevleri gen.pdf
It is not option 3 please help What would be the outcome of.pdf
Joanna and Chip Gaines and Michael Dubin got together recent.pdf
JKL Co issues zero coupon bonds on the market at a price of.pdf
Jill is offered a choice between receiving 50 with certaint.pdf
Jennys Froyo INC Balance Sheet For Year Ended December 31.pdf
Jim y Sue se iban a casar y estaban muy enamorados Antes de.pdf
Jhania Bive the muk hroutwes ite p+4i if peras bt in +45 te.pdf
JAVA Please help me on this method The requirement of the m.pdf
Jennifer invested the profit of his business in an investmen.pdf

Recently uploaded (20)

PPTX
Virtual and Augmented Reality in Current Scenario
PDF
What if we spent less time fighting change, and more time building what’s rig...
PPTX
Share_Module_2_Power_conflict_and_negotiation.pptx
PDF
MBA _Common_ 2nd year Syllabus _2021-22_.pdf
PDF
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf
PDF
Environmental Education MCQ BD2EE - Share Source.pdf
PDF
Chinmaya Tiranga quiz Grand Finale.pdf
PDF
medical_surgical_nursing_10th_edition_ignatavicius_TEST_BANK_pdf.pdf
PDF
International_Financial_Reporting_Standa.pdf
PDF
OBE - B.A.(HON'S) IN INTERIOR ARCHITECTURE -Ar.MOHIUDDIN.pdf
PDF
Trump Administration's workforce development strategy
PPTX
20th Century Theater, Methods, History.pptx
PDF
احياء السادس العلمي - الفصل الثالث (التكاثر) منهج متميزين/كلية بغداد/موهوبين
PDF
FOISHS ANNUAL IMPLEMENTATION PLAN 2025.pdf
PDF
ChatGPT for Dummies - Pam Baker Ccesa007.pdf
PDF
BP 704 T. NOVEL DRUG DELIVERY SYSTEMS (UNIT 2).pdf
PPTX
B.Sc. DS Unit 2 Software Engineering.pptx
PDF
Complications of Minimal Access-Surgery.pdf
DOC
Soft-furnishing-By-Architect-A.F.M.Mohiuddin-Akhand.doc
PDF
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf
Virtual and Augmented Reality in Current Scenario
What if we spent less time fighting change, and more time building what’s rig...
Share_Module_2_Power_conflict_and_negotiation.pptx
MBA _Common_ 2nd year Syllabus _2021-22_.pdf
Vision Prelims GS PYQ Analysis 2011-2022 www.upscpdf.com.pdf
Environmental Education MCQ BD2EE - Share Source.pdf
Chinmaya Tiranga quiz Grand Finale.pdf
medical_surgical_nursing_10th_edition_ignatavicius_TEST_BANK_pdf.pdf
International_Financial_Reporting_Standa.pdf
OBE - B.A.(HON'S) IN INTERIOR ARCHITECTURE -Ar.MOHIUDDIN.pdf
Trump Administration's workforce development strategy
20th Century Theater, Methods, History.pptx
احياء السادس العلمي - الفصل الثالث (التكاثر) منهج متميزين/كلية بغداد/موهوبين
FOISHS ANNUAL IMPLEMENTATION PLAN 2025.pdf
ChatGPT for Dummies - Pam Baker Ccesa007.pdf
BP 704 T. NOVEL DRUG DELIVERY SYSTEMS (UNIT 2).pdf
B.Sc. DS Unit 2 Software Engineering.pptx
Complications of Minimal Access-Surgery.pdf
Soft-furnishing-By-Architect-A.F.M.Mohiuddin-Akhand.doc
1.3 FINAL REVISED K-10 PE and Health CG 2023 Grades 4-10 (1).pdf

java I am trying to run my code but it is not letting me .pdf

  • 1. java I am trying to run my code but it is not letting me i dont know what i should do or fix. Thank you so much for your help. This is the problem and my code will be on the bottom. Problem #1 and Only Dynamic Array of Integers Class Create a class named DynamicArray that will have convenient functionality similar to JavaScripts Array object and Javas ArrayList class. The class allows to store array of integers that can grow and shrink as needed, search for values, remove elements, etc. You are not allowed to use ArrayList object as well as any methods from java.util.Arrays class. Please see the list of required features and methods below. private int array[] You MUST store the data internally in a regular partially-filled array of integers. Please DO NOT USE ArrayList. The size of the allocated array is its capacity and will be discussed below. private int size. This variable stores the number of occupied elements in the array. Set to 0 in the constructor. Constructor with parameter. The parameter defines the capacity (length) of initial array. Allocates array of given capacity (length), sets size field to 0. In case the parameter given to constructor is 0 or negative, IllegalArgumentException is being thrown. No-argument constructor. Allocates array of length 3, assigns it to the array field, sets size field to 0. Copy constructor. The constructor takes an object of type DynamicArray as a parameter and copies it into the object it creates. The constructor throws IllegalArgumentException if the object that was passed to copy from is null. int getSize() returns the number of occupied elements in the array. int getCapacity() returns the actual size (length) of the partially-filled array int [] getArray() accessor returns the entire partially-filled array. Make sure you DO NOT return the private array field, make a copy of it. int [] toArray() accessor returns an occupied part of the partially-filled array. Make sure you DO NOT return the private array field. Instead, allocate memory for the new array, copy the occupied portion of the field into that new object, and return the new array. public void push(int num) adds a new element to the end of the array and increments the size field. If the array is full, you need to increase the capacity of the array: Create a new array with the size equal to double the capacity of the original one. Copy all the elements from the array field to the new array. Add the new element to the end of the new array. Use new array as an array field. Make sure your method works well when new elements are added to an empty DynamicArray. public int pop() throws RuntimeException removes the last element of the array and returns it. Decrements the size field. If the array is empty a RuntimeException with the message Array is empty must be thrown. At this point check the capacity of the array. If the capacity is 4 times larger than the number of occupied elements (size), it is time to shrink the array:
  • 2. Create a new array with the size equal to half of the capacity of the original one. Copy all the elements from the array field to the new array. Use new array as an array field. int get(int index) throws IndexOutOfBoundsException returns element of the array with the requested index. If the index provided is too large or negative, the IndexOutOfBoundsException is thrown with the message Illegal index. int indexOf(int key) returns the index of the first occurrence of the given number. Returns -1 when the number is not found. void add(int index, int num) throws IndexOutOfBoundsException adds a new element (passed as parameter num) to the location of the array specified by index parameter. If the index is larger than size of the array or less than 0, IndexOutOfBoundsException is thrown. When adding the element into the middle of the array, youll have to shift all the elements to the right to make room for the new one. If the array is full and there is no room for a new element, the array must be doubled in size. Please follow the steps listed in the push() method description to double the capacity of the array. int remove ( int index) throws IndexOutOfBoundsException removes and returns the value of an element at the specified position in this array. When the element is removed from the middle of the array, all the elements must be shifted to close the gap created by removed element. If the index value passed into the method is more or equal to the size or less than 0 the IndexOutOfBoundsException must be thrown. At this point check the capacity of the array. If the capacity is 4 times larger than the number of occupied elements (size), it is time to shrink the array. boolean isEmpty() returns true if the size of the array is 0. String toString() returns an array as a string of comma-separated values. Sample: [1, 2, 3, 4] boolean equals(DynamicArray obj) compares two objects (this one and the one passed as parameter) element-by-element and determines if they are exactly the same. The capacity of the two objects is not being compared and can be different. MY CODE; public class DynamicArray { private int Array[]; private int size; // Constructor with parameter public DynamicArray(int capacity) { if (capacity <= 0) { throw new IllegalArgumentException("Invalid capacity: " + capacity); } array = new int[capacity]; size = 0; }
  • 3. // No-argument constructor public DynamicArray() { this(3); } // Copy constructor public DynamicArray(DynamicArray other) { if (other == null) { throw new IllegalArgumentException("Cannot copy from null object"); } array = new int[other.array.length]; System.arraycopy(other.array, 0, array, 0, other.size); size = other.size; } public int getSize() { return size; } public int getCapacity() { return array.length; } public int[] getArray() { return Arrays.copyOf(Array, Array.length); } public int[] toArray() { return Arrays.copyOf(array, size); } public void push(int num) { if (size == array.length) { int[] newArray = new int[array.length * 2]; System.arraycopy(array, 0, newArray, 0, array.length); array = newArray; } array[size++] = num; }
  • 4. public int pop() { if (size == 0) { throw new RuntimeException("Array is empty"); } int num = array[--size]; if (array.length > 4 * size) { int[] newArray = new int[array.length / 2]; System.arraycopy(array, 0, newArray, 0, size); array = newArray; } return num; } public int get(int index) { if (index < 0 || index >= size) { throw new IndexOutOfBoundsException("Illegal index"); } return array[index]; } public int indexOf(int key) { for (int i = 0; i < size; i++) { if (array[i] == key) { return i; } } return -1; } public void add(int index, int num) { if (index < 0 || index > size) { throw new IndexOutOfBoundsException("Illegal index"); } if (size == array.length) {
  • 5. int[] newArray = new int[array.length * 2]; System.arraycopy(array, 0, newArray, 0, index); newArray[index] = num; System.arraycopy(array, index, newArray, index + 1, size - index); array = newArray; } else { System.arraycopy(array, index, array, index + 1, size - index); array[index] = num; } size++; } public int remove(int index) { if (index < 0 || index >= size) { throw new IndexOutOfBoundsException("Illegal index"); } int num = array[index]; System.arraycopy(array, index + 1, array, index, size - index - 1); size--; if (array.length > 4 * size) { int[] newArray = new int[array.length / 2]; System.arraycopy(array, 0, newArray, 0, size); array = newArray; } return num; } public boolean isEmpty() { return size == 0; } /** * Returns a string representation of the array in the format of comma-separated values enclosed in square brackets. * * @return a string representation of the array. */ public String toString() {
  • 6. if (size == 0) { return "[]"; } StringBuilder sb = new StringBuilder("["); for (int i = 0; i < size - 1; i++) { sb.append(arr[i]).append(", "); } sb.append(arr[size - 1]).append("]"); return sb.toString(); } /** * Compares this DynamicArray object with the specified object for equality. * * @param obj the object to compare to. * @return true if the specified object is equal to this DynamicArray object, false otherwise. */ public boolean equals(DynamicArray obj) { if (obj == null || getClass() != obj.getClass() || size != obj.size) { return false; } for (int i = 0; i < size; i++) { if (arr[i] != obj.arr[i]) { return false; } } return true; } }