To swap the first and last elements in the array Program plan: In the file “ SwapFirstLast.java ”, import necessary package and create a class “ SwapFirstLast”, Define the method “swapFirstAndLast()” to swap the first and last elements in an array. Define the method. Create an array. Create an object for “SwapFirstLast”. Create a test array containing random numbers. Call the method “swapFirstAndLast()” to perform swap.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,

Define the method “swapFirstAndLast()” to swap the first and last elements in an array.

Define the method.

Create an array.

Create an object for “SwapFirstLast”.

Create a test array containing random numbers.

Call the method “swapFirstAndLast()” to perform swap.

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,

Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.

Define the method “main()”.

Create an array.

Create an object for “RotateRight”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “shiftRight()”.

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,

Define the method “replaceEven()” to replace all even elements with “0”.

Define the method “main()”.

Create an array.

Create an object for “ReplaceEven”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceEven()”.

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,

Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.

Define the method “main()”.

Create an array.

Create an object for “ReplaceWithLargestNeighbor”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceWithLargestNeighbor().

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,

Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.

Define the method “main()”.

Create an array of odd size.

Create an object for “RemoveMiddle”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of odd size.

Create an array of even size.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of even size.

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,

Define the method “moveEvenToFront()” to move all even elements to the front.

Define the method “main()”.

Create an array of odd size.

Create an object for “MoveEvenToFront”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “moveEvenToFront()”.

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,

Define the method “getSecondLargest()” to return the second-largest element in the array.

Define the method “main()”.

Create an array of odd size.

Create an object for “GetSecondLargest”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “getSecondLargest()” and print the output.

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

In the file “InOrder.java”, import necessary package and create a class “InOrder”,

Define the method “inOrder()” to return true if the array is recently sorted in increasing order.

Define the method “main()”.

Initialize the array with sorted and unsorted order.

Call the method “inOrder()” to check if the array is sorted or not.

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,

Define the method “adjacentDupes()” to return true if the array has two adjacent duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “AdjacentDupes”.

Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,

Define the method “containsDuplicates()” to return true if the array has duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “ContainsDuplicates”.

Call the method “containsDuplicates()” to check if the array has duplicate elements.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

MGMT SS STATS, an umbrella body that facilitates and serves various Social SecurityOrganizations/Departments within the Caribbean territories, stoodpoised to meet the needs of its stakeholders by launching an onlinedatabase at www.SSDCI.gov. The database will provide membersand the public access to the complete set of services that can (also)be initiated face-to-face, and it will provide managed, private, secure access to a repository ofpublic and/or personal information. Ideally, the database will have basic details of pensionplans recorded in the registry, member plan statistics, and cash inflows and outflows frompension funds.For example, insured persons accumulate contributions. Records for these persons will includeinformation on the insured persons able to acquire various benefits once work is interrupteddue to sickness, death, retirement, and maternity or employment injury. They will also includeinformation on pensions such as invalidity, disability, and survivors that stem from…

(c) Consider the following set of processes: Process ID Arrival Time Priority Burst Time A 2 3 100 B 6 C 10 1 (highest) 2 40 80 D 16 4 (lowest) 20

(3c) In the following resource allocation graph, is the state a deadlocked one? If so which ones are deadlocked? (3 points) Resource allocation graph. R₁ = Resource, P = process. R1 R3 R3 7

Answer 2

Question

Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,

Define the method “swapFirstAndLast()” to swap the first and last elements in an array.

Define the method.

Create an array.

Create an object for “SwapFirstLast”.

Create a test array containing random numbers.

Call the method “swapFirstAndLast()” to perform swap.

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,

Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.

Define the method “main()”.

Create an array.

Create an object for “RotateRight”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “shiftRight()”.

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,

Define the method “replaceEven()” to replace all even elements with “0”.

Define the method “main()”.

Create an array.

Create an object for “ReplaceEven”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceEven()”.

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,

Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.

Define the method “main()”.

Create an array.

Create an object for “ReplaceWithLargestNeighbor”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceWithLargestNeighbor().

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,

Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.

Define the method “main()”.

Create an array of odd size.

Create an object for “RemoveMiddle”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of odd size.

Create an array of even size.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of even size.

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,

Define the method “moveEvenToFront()” to move all even elements to the front.

Define the method “main()”.

Create an array of odd size.

Create an object for “MoveEvenToFront”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “moveEvenToFront()”.

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,

Define the method “getSecondLargest()” to return the second-largest element in the array.

Define the method “main()”.

Create an array of odd size.

Create an object for “GetSecondLargest”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “getSecondLargest()” and print the output.

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

In the file “InOrder.java”, import necessary package and create a class “InOrder”,

Define the method “inOrder()” to return true if the array is recently sorted in increasing order.

Define the method “main()”.

Initialize the array with sorted and unsorted order.

Call the method “inOrder()” to check if the array is sorted or not.

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,

Define the method “adjacentDupes()” to return true if the array has two adjacent duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “AdjacentDupes”.

Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,

Define the method “containsDuplicates()” to return true if the array has duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “ContainsDuplicates”.

Call the method “containsDuplicates()” to check if the array has duplicate elements.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Question

Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,

Define the method “swapFirstAndLast()” to swap the first and last elements in an array.

Define the method.

Create an array.

Create an object for “SwapFirstLast”.

Create a test array containing random numbers.

Call the method “swapFirstAndLast()” to perform swap.

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,

Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.

Define the method “main()”.

Create an array.

Create an object for “RotateRight”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “shiftRight()”.

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,

Define the method “replaceEven()” to replace all even elements with “0”.

Define the method “main()”.

Create an array.

Create an object for “ReplaceEven”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceEven()”.

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,

Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.

Define the method “main()”.

Create an array.

Create an object for “ReplaceWithLargestNeighbor”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceWithLargestNeighbor().

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,

Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.

Define the method “main()”.

Create an array of odd size.

Create an object for “RemoveMiddle”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of odd size.

Create an array of even size.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of even size.

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,

Define the method “moveEvenToFront()” to move all even elements to the front.

Define the method “main()”.

Create an array of odd size.

Create an object for “MoveEvenToFront”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “moveEvenToFront()”.

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,

Define the method “getSecondLargest()” to return the second-largest element in the array.

Define the method “main()”.

Create an array of odd size.

Create an object for “GetSecondLargest”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “getSecondLargest()” and print the output.

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

In the file “InOrder.java”, import necessary package and create a class “InOrder”,

Define the method “inOrder()” to return true if the array is recently sorted in increasing order.

Define the method “main()”.

Initialize the array with sorted and unsorted order.

Call the method “inOrder()” to check if the array is sorted or not.

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,

Define the method “adjacentDupes()” to return true if the array has two adjacent duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “AdjacentDupes”.

Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,

Define the method “containsDuplicates()” to return true if the array has duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “ContainsDuplicates”.

Call the method “containsDuplicates()” to check if the array has duplicate elements.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Question

Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,

Define the method “swapFirstAndLast()” to swap the first and last elements in an array.

Define the method.

Create an array.

Create an object for “SwapFirstLast”.

Create a test array containing random numbers.

Call the method “swapFirstAndLast()” to perform swap.

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,

Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.

Define the method “main()”.

Create an array.

Create an object for “RotateRight”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “shiftRight()”.

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,

Define the method “replaceEven()” to replace all even elements with “0”.

Define the method “main()”.

Create an array.

Create an object for “ReplaceEven”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceEven()”.

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,

Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.

Define the method “main()”.

Create an array.

Create an object for “ReplaceWithLargestNeighbor”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceWithLargestNeighbor().

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,

Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.

Define the method “main()”.

Create an array of odd size.

Create an object for “RemoveMiddle”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of odd size.

Create an array of even size.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of even size.

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,

Define the method “moveEvenToFront()” to move all even elements to the front.

Define the method “main()”.

Create an array of odd size.

Create an object for “MoveEvenToFront”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “moveEvenToFront()”.

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,

Define the method “getSecondLargest()” to return the second-largest element in the array.

Define the method “main()”.

Create an array of odd size.

Create an object for “GetSecondLargest”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “getSecondLargest()” and print the output.

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

In the file “InOrder.java”, import necessary package and create a class “InOrder”,

Define the method “inOrder()” to return true if the array is recently sorted in increasing order.

Define the method “main()”.

Initialize the array with sorted and unsorted order.

Call the method “inOrder()” to check if the array is sorted or not.

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,

Define the method “adjacentDupes()” to return true if the array has two adjacent duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “AdjacentDupes”.

Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,

Define the method “containsDuplicates()” to return true if the array has duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “ContainsDuplicates”.

Call the method “containsDuplicates()” to check if the array has duplicate elements.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,

Define the method “swapFirstAndLast()” to swap the first and last elements in an array.

Define the method.

Create an array.

Create an object for “SwapFirstLast”.

Create a test array containing random numbers.

Call the method “swapFirstAndLast()” to perform swap.

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,

Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.

Define the method “main()”.

Create an array.

Create an object for “RotateRight”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “shiftRight()”.

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,

Define the method “replaceEven()” to replace all even elements with “0”.

Define the method “main()”.

Create an array.

Create an object for “ReplaceEven”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceEven()”.

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,

Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.

Define the method “main()”.

Create an array.

Create an object for “ReplaceWithLargestNeighbor”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceWithLargestNeighbor().

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,

Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.

Define the method “main()”.

Create an array of odd size.

Create an object for “RemoveMiddle”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of odd size.

Create an array of even size.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of even size.

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,

Define the method “moveEvenToFront()” to move all even elements to the front.

Define the method “main()”.

Create an array of odd size.

Create an object for “MoveEvenToFront”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “moveEvenToFront()”.

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,

Define the method “getSecondLargest()” to return the second-largest element in the array.

Define the method “main()”.

Create an array of odd size.

Create an object for “GetSecondLargest”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “getSecondLargest()” and print the output.

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

In the file “InOrder.java”, import necessary package and create a class “InOrder”,

Define the method “inOrder()” to return true if the array is recently sorted in increasing order.

Define the method “main()”.

Initialize the array with sorted and unsorted order.

Call the method “inOrder()” to check if the array is sorted or not.

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,

Define the method “adjacentDupes()” to return true if the array has two adjacent duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “AdjacentDupes”.

Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,

Define the method “containsDuplicates()” to return true if the array has duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “ContainsDuplicates”.

Call the method “containsDuplicates()” to check if the array has duplicate elements.

Answer 6

Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,

Define the method “swapFirstAndLast()” to swap the first and last elements in an array.

Define the method.

Create an array.

Create an object for “SwapFirstLast”.

Create a test array containing random numbers.

Call the method “swapFirstAndLast()” to perform swap.

Answer 7

Chapter 7, Problem 10PE

a.

Program Plan Intro

To swap the first and last elements in the array

Program plan:

In the file “SwapFirstLast.java”, import necessary package and create a class “SwapFirstLast”,

Define the method “swapFirstAndLast()” to swap the first and last elements in an array.

Define the method.

Create an array.

Create an object for “SwapFirstLast”.

Create a test array containing random numbers.

Call the method “swapFirstAndLast()” to perform swap.

Answer 8

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,

Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.

Define the method “main()”.

Create an array.

Create an object for “RotateRight”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “shiftRight()”.

Answer 9

b.

Program Plan Intro

A test program for a method “shiftRight()”

Program plan:

In the file “RotateRight.java”, import necessary package and create a class “RotateRight”,

Define the method “shiftRight()” to shift all elements of the array to the right by one and move the last element into the first position.

Define the method “main()”.

Create an array.

Create an object for “RotateRight”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “shiftRight()”.

Answer 10

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,

Define the method “replaceEven()” to replace all even elements with “0”.

Define the method “main()”.

Create an array.

Create an object for “ReplaceEven”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceEven()”.

Answer 11

c.

Program Plan Intro

A test program for a method “replaceEven()”

Program plan:

In the file “ReplaceEven.java”, import necessary package and create a class “ReplaceEven”,

Define the method “replaceEven()” to replace all even elements with “0”.

Define the method “main()”.

Create an array.

Create an object for “ReplaceEven”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceEven()”.

Answer 12

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,

Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.

Define the method “main()”.

Create an array.

Create an object for “ReplaceWithLargestNeighbor”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceWithLargestNeighbor().

Answer 13

d.

Program Plan Intro

A test program for a method “replaceWithLargestNeighbor()”

Program plan:

In the file “ReplaceWithLargestNeighbor.java”, import necessary package and create a class “ReplaceWithLargestNeighbor”,

Define the method “replaceWithLargestNeighbor()” to replace all elements except first and last by the largest of its "2" neighbors.

Define the method “main()”.

Create an array.

Create an object for “ReplaceWithLargestNeighbor”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “replaceWithLargestNeighbor().

Answer 14

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,

Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.

Define the method “main()”.

Create an array of odd size.

Create an object for “RemoveMiddle”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of odd size.

Create an array of even size.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of even size.

Answer 15

e.

Program Plan Intro

A test program for a method “removeMiddle()”

Program plan:

In the file “RemoveMiddle.java”, import necessary package and create a class “RemoveMiddle”,

Define the method “removeMiddle()” to remove the middle element if the length of the array is odd, or the middle two elements if the array length is even.

Define the method “main()”.

Create an array of odd size.

Create an object for “RemoveMiddle”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of odd size.

Create an array of even size.

Create a test array containing random numbers.

Call the method “removeMiddle()” with an array of even size.

Answer 16

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,

Define the method “moveEvenToFront()” to move all even elements to the front.

Define the method “main()”.

Create an array of odd size.

Create an object for “MoveEvenToFront”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “moveEvenToFront()”.

Answer 17

f.

Program Plan Intro

A test program for a method “moveEvenToFront()”

Program plan:

In the file “MoveEvenToFront.java”, import necessary package and create a class “MoveEvenToFront”,

Define the method “moveEvenToFront()” to move all even elements to the front.

Define the method “main()”.

Create an array of odd size.

Create an object for “MoveEvenToFront”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “moveEvenToFront()”.

Answer 18

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,

Define the method “getSecondLargest()” to return the second-largest element in the array.

Define the method “main()”.

Create an array of odd size.

Create an object for “GetSecondLargest”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “getSecondLargest()” and print the output.

Answer 19

g.

Program Plan Intro

A test program for a method “getSecondLargest()”

Program plan:

In the file “GetSecondLargest.java”, import necessary package and create a class “GetSecondLargest”,

Define the method “getSecondLargest()” to return the second-largest element in the array.

Define the method “main()”.

Create an array of odd size.

Create an object for “GetSecondLargest”.

Create an object for “Random”.

Create a test array containing random numbers.

Call the method “getSecondLargest()” and print the output.

Answer 20

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

In the file “InOrder.java”, import necessary package and create a class “InOrder”,

Define the method “inOrder()” to return true if the array is recently sorted in increasing order.

Define the method “main()”.

Initialize the array with sorted and unsorted order.

Call the method “inOrder()” to check if the array is sorted or not.

Answer 21

h.

Program Plan Intro

A test program for a method “inOrder()”

Program plan:

In the file “InOrder.java”, import necessary package and create a class “InOrder”,

Define the method “inOrder()” to return true if the array is recently sorted in increasing order.

Define the method “main()”.

Initialize the array with sorted and unsorted order.

Call the method “inOrder()” to check if the array is sorted or not.

Answer 22

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,

Define the method “adjacentDupes()” to return true if the array has two adjacent duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “AdjacentDupes”.

Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

Answer 23

i.

Program Plan Intro

A test program for a method “adjacentDupes()”

Program plan:

In the file “AdjacentDupes.java”, import necessary package and create a class “AdjacentDupes”,

Define the method “adjacentDupes()” to return true if the array has two adjacent duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “AdjacentDupes”.

Call the method “adjacentDupes()” to check if the array has two adjacent duplicate elements.

Answer 24

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,

Define the method “containsDuplicates()” to return true if the array has duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “ContainsDuplicates”.

Call the method “containsDuplicates()” to check if the array has duplicate elements.

Answer 25

j.

Program Plan Intro

A test program for a method “containsDuplicates()”

Program plan:

In the file “ContainsDuplicates.java”, import necessary package and create a class “ContainsDuplicates”,

Define the method “containsDuplicates()” to return true if the array has duplicate elements.

Define the method “main()”.

Create an array of adjacent and non-adjacent duplicate values.

Create an object for “ContainsDuplicates”.

Call the method “containsDuplicates()” to check if the array has duplicate elements.

Answer 26

Expert Solution & Answer

Answer 27

Expert Solution & Answer

Answer 28

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 29

Ch. 7.1 - Declare an array of integers containing the first...Ch. 7.1 - Assume the array primes has been initialized as...Ch. 7.1 - Assume the array primes has been initialized as...Ch. 7.1 - Prob. 4SC Ch. 7.1 - Prob. 5SC Ch. 7.1 - Declare an array containing two strings, "Yes",...Ch. 7.1 - Can you produce the output on page 308 without...Ch. 7.1 - Prob. 8SC Ch. 7.2 - Prob. 9SC Ch. 7.2 - Prob. 10SC

Want to see the full answer?

Chapter 7 Solutions