### Ask Your question

### Search & Filtering

what is the use of interfaces in java

Untitled

1

Integer V lies strictly between integers U and W if U < V < W or if U > V > W.

2

A non-empty zero indexed array A consisting of N integers is given.

3

A pair of indices (P, Q), where 0 ≤ P < Q < N is said to have adjacent values if no value in the array lies strictly between values A[P] and A[Q].

4

For example, in array A such that:

5

A[0] = 0

6

A[1] = 3

7

A[2] = 3

8

A[3] = 7

9

A[4] = 5

10

A[5] = 3

11

A[6] = 11

12

A[7] = 1

13

14

The following pairs of indices have adjacent values:

15

(0, 7), (1, 2), (1, 4), (1, 5),

16

(1, 7), (2, 4), (2, 5), (2, 7),

17

(3, 4), (3, 6), (4, 5), (5, 7).

18

19

For example, indices 4 and 5 have adjacent values because there is no value in array A that lies strictly between

20

A[4] = 5 and A[5] =3; the only such value could be the number 4, and it is not present in the array.

21

22

Now, Find the distances among all adjacent pairs in the array.

1

Integer V lies strictly between integers U and W if U < V < W or if U > V > W.

2

A non-empty zero indexed array A consisting of N integers is given.

3

A pair of indices (P, Q), where 0 ≤ P < Q < N is said to have adjacent values if no value in the array lies strictly between values A[P] and A[Q].

4

For example, in array A such that:

5

A[0] = 0

6

A[1] = 3

7

A[2] = 3

8

A[3] = 7

9

A[4] = 5

10

A[5] = 3

11

A[6] = 11

12

A[7] = 1

13

14

The following pairs of indices have adjacent values:

15

(0, 7), (1, 2), (1, 4), (1, 5),

16

(1, 7), (2, 4), (2, 5), (2, 7),

17

(3, 4), (3, 6), (4, 5), (5, 7).

18

19

For example, indices 4 and 5 have adjacent values because there is no value in array A that lies strictly between

20

A[4] = 5 and A[5] =3; the only such value could be the number 4, and it is not present in the array.

21

22

Now, Find the distances among all adjacent pairs in the array.

Write the pseudocode that will produce a slip similar to the one illustrated at the beginning of the question. Your solution should satisfy the following requirements:

• The solution must illustrate the use of good programming practices;

• The solution must make use of a loop;

• The loop must make use of a sentinel value;

• The solution must illustrate the use of good programming practices;

• The solution must make use of a loop;

• The loop must make use of a sentinel value;

Write the pseudocode that will produce a slip similar to the one illustrated at

the beginning of the question. Your solution should satisfy the following

requirements: The solution must illustrate the use of good programming practices; The solution must make use of a loop; The loop must make use of a sentinel value.

(22)

the beginning of the question. Your solution should satisfy the following

requirements: The solution must illustrate the use of good programming practices; The solution must make use of a loop; The loop must make use of a sentinel value.

(22)

I need help creating a websocket api and rest api in aws gateway is there anyway i can get assistance

Task 3 (35 marks)

Write an addition operation for the SILL. Your program should perform addition operation in the digit level (one digit in the node of a linked list) and store the result in another SILL. See below an example:

SILL1:

9 9 9

SILL2:

1 1

SILL3 = SILL1+SILL2

1 0 1 0

Write a driver program to test all the functionality that you have implemented. The driver program should have a simple menu to allow users to:

1. Accept the name of an input file. If the file exists, the program should read it. The program must inform users if it has read the file successfully or failed, in which case, it must inform users why it has failed to read the file. (task 1)

2. Display integers stored in SILL (task 2).

3. Display the results of the addition arithmetic operation in SILL (task 3).

4. Exit.

Write an addition operation for the SILL. Your program should perform addition operation in the digit level (one digit in the node of a linked list) and store the result in another SILL. See below an example:

SILL1:

9 9 9

SILL2:

1 1

SILL3 = SILL1+SILL2

1 0 1 0

Write a driver program to test all the functionality that you have implemented. The driver program should have a simple menu to allow users to:

1. Accept the name of an input file. If the file exists, the program should read it. The program must inform users if it has read the file successfully or failed, in which case, it must inform users why it has failed to read the file. (task 1)

2. Display integers stored in SILL (task 2).

3. Display the results of the addition arithmetic operation in SILL (task 3).

4. Exit.

Create a program that will implement the four sorting algorithms:

Bubble Sort

Insertion Sort

Selection Sort

Merge Sort

Additionally- the program must have the ability to run any of the four algorithms on an unsorted array.

Bubble Sort

Insertion Sort

Selection Sort

Merge Sort

Additionally- the program must have the ability to run any of the four algorithms on an unsorted array.

Franks come 7 to a package. Hot dog buns come 8 to a package. Write a simulation of buying packs of franks and hot dog buns until you have used up packs of both at the same time.

Declare appropriate constants for the amount per each type of package, variables for number of packages purchased, number of franks in a package left and buns in a package left. Run your simulation by starting with 1 pack of franks and 1 pack of buns. Use a loop to drive simulation. Each iteration represents the use of one frank and one bun. Design the control of your loop to end when you have run out of buns and franks at the same time. In your loop if you run out of one before the other simulate purchase of a new package and set the number left back to the number that come in a package.

Keep count of each package purchase so that you can display the number of packages of franks purchased and the number of packages of buns purchased after your loop completes.

Declare appropriate constants for the amount per each type of package, variables for number of packages purchased, number of franks in a package left and buns in a package left. Run your simulation by starting with 1 pack of franks and 1 pack of buns. Use a loop to drive simulation. Each iteration represents the use of one frank and one bun. Design the control of your loop to end when you have run out of buns and franks at the same time. In your loop if you run out of one before the other simulate purchase of a new package and set the number left back to the number that come in a package.

Keep count of each package purchase so that you can display the number of packages of franks purchased and the number of packages of buns purchased after your loop completes.

Write code for below problem using java. The input below is just an example and you should implement independent from the input.

You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below;

1. You will start from the top and move downwards to an adjacent number as in below.

2. You are only allowed to walk downwards and diagonally.

3. You can only walk over NON PRIME NUMBERS.

4. You have to reach at the end of the pyramid as much as possible.

5. You have to treat your input as pyramid.

According to above rules the maximum sum of the numbers from top to bottom in below example is 24.

*1

*8 4

2 *6 9

8 5 *9 3

As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9

1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum.

You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below;

1. You will start from the top and move downwards to an adjacent number as in below.

2. You are only allowed to walk downwards and diagonally.

3. You can only walk over NON PRIME NUMBERS.

4. You have to reach at the end of the pyramid as much as possible.

5. You have to treat your input as pyramid.

According to above rules the maximum sum of the numbers from top to bottom in below example is 24.

*1

*8 4

2 *6 9

8 5 *9 3

As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9

1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum.

Write a JavaScript program that prompts for an employee name, employee no, rate of pay and hours worked, and computes the total pay for the employee. If the hours worked is greater than 40 hours, compute by using 1.5 times regular rate for the extra hours. For example, if one works for 50 hours and the rate paid is RM10.00/hour, the total pay should be RM550.00.

Include screenshots that show the output of each code for working hours < 40 hours, = 40 hours, and > 40 hours. Sample window shown on Figure 1.

Include screenshots that show the output of each code for working hours < 40 hours, = 40 hours, and > 40 hours. Sample window shown on Figure 1.