URGENT PLEASE ANSER QUCKLY Describe an algorithm (in pseudo code) that finds the sum of the integers that are greater than 50 and less than 50 in a list (the list may contain integers in the desired interval and others that are not in the interval) Your input is a list of integers a 1 ,a 2 , ,,,,a n If your list does not contain any integers in the specified interval then you should return an error message If the input list is 4,12, 80, your must return 4 12 and if the list is 65, 60, 82, you must return 'not found' b (5 points) How may operations (arithmetic or logical comparison) are performed in your algorithm

The Answer is in the image, click to view ...

Question: URGENT PLEASE ANSER QUCKLY: Describe an algorithm (in pseudo-code) that finds the sum of the integers that are greater than -50 and less than 50

URGENT PLEASE ANSER QUCKLY:

Describe an algorithm (in pseudo-code) that finds the sum of the integers that are greater than -50 and less than 50 in a list (the list may contain integers in the desired interval and others that are not in the interval) . Your input is a list of integers a₁,a₂, ,,,,a_n . If your list does not contain any integers in the specified interval then you should return an error message.

If the input list is 4,12, 80, your must return 4+12 and if the list is --65, 60, 82, you must return 'not found'.

b. (5 points) How may operations (arithmetic or logical comparison) are performed in your algorithm?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

a. (15 points) Describe an algorithm (in pseudo-code) that finds the sum of the integers that are greater than -50 and less than 50 in a list (the list may contain integers in the desired interval...

a. (15 points) Describe an algorithm (in pseudo-code) that finds the sum of the integers that are greater than-50 and less than 50 in a list (the list may contain integers in the desired interval and...

a. (15 points) Describe an algorithm (in pseudo-code) that finds the sum of the integers that are greater than -10 and less than 20 in a list (the list may contain integers in the desired interval...

Describe an algorithm (in pseudo-code) that finds the sum of the integers that are greater than -10 and less than 20 in a list (the list may contain integers in the desired interval and others that...

A seismic probe bores itself into the seabed, going as deep as it can before running out of fuel. This takes about five minutes. It rotates its spiral drill head at rate R(t) that follows a...

(i) Write down the linear program relaxation for the vertex cover problem and solve the linear program. [6 marks] (ii) Based on the solution of the linear program in (b)(i), derive an integer...

can someone solve this Modern workstations typically have memory systems that incorporate two or three levels of caching. Explain why they are designed like this. [4 marks] In order to investigate...

A certain program has to maintain an array, count, of N counters which are all initialised to zero. The value of counter i can be incremented by one by the call: increment(i), and this is the only...

A discrete sequence {xn} can be converted into a continuous representation x(t) = ts X n= (t n ts) xn, where ts is the sampling period. (a) State two characteristic properties of Dirac's function. [2...

Consider a two-stage compression refrigeration system operating between the pressure limits of 1.2 MPa and 0.08 MPa. The working fluid is R-12. The refrigerant leaves the condenser as saturated...

In Ex. 145 use carburized and case-hardened gears of grade 1. Carburizing and case-hardening can produce a 550 Brinell case. The core hardnesses are 200 Brinell. Estimate the power capacity of the...

What is the standard deviation for the 8 kittens' ages: 1 , 2 , 2 , 3 , 3 , 4 , 4 , 5 ? Group of answer choices 2 1 . 5 1 . 5 1