JavaThe program is supposed to:a) allocate storage for an array of integers of a size specified by the userb) fill the array partially with increasing values (number of values chosen by the user)c) check that the item at a user specified index position can be removed, maintaining order of other elementsd) check that a new item can be added at a user specified index position, also maintaining order of otherelements.the code is here: ☆الله.•9:0EE/-T/-Elore.udayton.edu/access/content/attachment//103cf16-24b4-417Sample Output (successful insert/delete)Output - ICA01_Key (run) XDDDCPS 151 ICA 1 byEnter the maximum size: 15Enter the starting size: 8Original List100 101 102 103 104 105 106 107Position to delete from: 3List after deletion100 101 102 104 105 106 107Value to insert: 999At what position? 1List after insertion100 999 101 102 104 105 106 107NYFinal List100 999 101 102 104 105 106 107GoodbyeBUILD SUCCESSFUL (total time: 43 seconds)ENG @Đ5 ↓POutput - ICA01_Start (run) XDDD•9:.0EE/•T/• EYou need to complete the validity checks for index position specified by the user.be removed, but a new item could be added right after the existing items in thmaySample output from startup coderun:CPS 151 ICA 1 byEnter the maximum size: 15Enter the starting size: 8Original List100 101 102 103 104 105 106 107ENGPosition to delete from: 5Invalid delete position, no changes madeValue to insert: 999At what position? 3Invalid insert position, no changes madeFinal List100 101 102 103 104 105 106 107GoodbyeBUILD SUCCESSFUL (total time: 27 seconds)^ED+M10

Answered: The program is supposed to: a) allocate…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Java

The program is supposed to:
a) allocate storage for an array of integers of a size specified by the user
b) fill the array partially with increasing values (number of values chosen by the user)
c) check that the item at a user specified index position can be removed, maintaining order of other elements
d) check that a new item can be added at a user specified index position, also maintaining order of other
elements.

the code is here:

☆
الله
.
•9:0
EE/-T/-E
lore.udayton.edu/access/content/attachment//103cf16-24b4-417
Sample Output (successful insert/delete)
Output - ICA01_Key (run) X
D
D
D
CPS 151 ICA 1 by
Enter the maximum size: 15
Enter the starting size: 8
Original List
100 101 102 103 104 105 106 107
Position to delete from: 3
List after deletion
100 101 102 104 105 106 107
Value to insert: 999
At what position? 1
List after insertion
100 999 101 102 104 105 106 107
NY
Final List
100 999 101 102 104 105 106 107
Goodbye
BUILD SUCCESSFUL (total time: 43 seconds)
ENG @
Đ
5

↓
P
Output - ICA01_Start (run) X
D
DD
•9:.0
EE/•T/• E
You need to complete the validity checks for index position specified by the user.
be removed, but a new item could be added right after the existing items in th
may
Sample output from startup code
run:
CPS 151 ICA 1 by
Enter the maximum size: 15
Enter the starting size: 8
Original List
100 101 102 103 104 105 106 107
ENG
Position to delete from: 5
Invalid delete position, no changes made
Value to insert: 999
At what position? 3
Invalid insert position, no changes made
Final List
100 101 102 103 104 105 106 107
Goodbye
BUILD SUCCESSFUL (total time: 27 seconds)
^
ED
+
M
10

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions