What is the algorithm to compute the sum of even numbers between 7 and 50?

What is the algorithm to compute the sum of even numbers between 7 and 50?
by

1 Answer

Answer :

(7 to 50).filter(_ % 2 == 0).sum
by

Related questions

Write an algorithm and draw the flowchart to find sum of series of numbers.

Description : Write an algorithm and draw the flowchart to find sum of series of numbers. 

Last Answer : Algorithim to find sum of series of numbers: 1. Initialize data segment 2. Initialize byte counter and memory pointer to read number from array. 3. Initialize sum variable to 0 4. sum=sum+number from array ... Decrement byte counter 9. If byte counter=0 then step 10 else step 4 10. Stop

Which are needed to compute the logical inference algorithm? a) Logical equivalence b) Validity c) Satisfiability d) All of the mentioned

Description : Which are needed to compute the logical inference algorithm? a) Logical equivalence b) Validity c) Satisfiability d) All of the mentioned

Last Answer : d) All of the mentioned

.Which one is used for compute the logical inference algorithm? a. Validity b.Satisfiability c. Logical equivalence d.All of these

Description : .Which one is used for compute the logical inference algorithm? a. Validity b.Satisfiability c. Logical equivalence d.All of these

Last Answer : d.All of these

Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Description : Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Last Answer : [(0, 0), (1, 1), (2, 1), (3, 2)] 

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Description : Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d

Last Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Write algorithm and draw flow-chart to print even numbers from 1 to 100.

Description : Write algorithm and draw flow-chart to print even numbers from 1 to 100.

Last Answer : Here's one possible algorithm to print even numbers from 1 to 100: Start with a variable i equal to 1. Check if i is less than or equal to 100. If i is less than or equal to 100 ... and increments `i` by 1. The loop continues until `i` is greater than 100, and the program ends.

If delaysare recorded as 10 bit numbers in a 50 router network, and delay vectorsare exchanged twicea second,how muchbandwidth per fill duplex line is occupied by the distributedrouting algorithm? A. 500 bps B. 1500 bps C. 5 bps D. 1000 bps

Description : If delaysare recorded as 10 bit numbers in a 50 router network, and delay vectorsare exchanged twicea second,how muchbandwidth per fill duplex line is occupied by the distributedrouting algorithm? A. 500 bps B. 1500 bps C. 5 bps D. 1000 bps

Last Answer : 1000 bps

(i) Write command to compute sum of every column of the data frame. -Technology

Description : (i) Write command to compute sum of every column of the data frame. -Technology

Last Answer : (i) df1.sum()(ii) df1[‘Rainfall’].mean()(iii) df1.loc[:11, ‘maxtemp’:’Rainfall’].mean( )

Write a program to compute the sum of all elements stored in an array using pointers.

Description : Write a program to compute the sum of all elements stored in an array using pointers.

Last Answer : #include #include void main() { int a[5],sum=0,i,*ptr; clrscr(); printf("\n Enter array elements:"); for(i=0;i

Consider a full-adder with the following input values: (a) x=1, y=0 and Ci(carry input) = 0 (b) x=0, y=1 and Ci = 1 Compute the values of S(sum) and C0 (carry output) for the above input values. (A) S=1 , C0= 0 and S=0 , C0= 1 (B) S=0 , C0= 0 and S=1 , C0= 1 (C) S=1 , C0= 1 and S=0 , C0= 0 (D) S=0 , C0= 1 and S=1 , C0= 0

Description : Consider a full-adder with the following input values: (a) x=1, y=0 and Ci(carry input) = 0 (b) x=0, y=1 and Ci = 1 Compute the values of S(sum) and C0 (carry output) for the above input values. (A) S=1 , C0= 0 and ... C0= 1 (C) S=1 , C0= 1 and S=0 , C0= 0 (D) S=0 , C0= 1 and S=1 , C0= 0

Last Answer : (A) S=1 , C0= 0 and S=0 , C0= 1

Compute the lowest common multiple (LCM) of numbers in Python -Web-Development

Description : Compute the lowest common multiple (LCM) of numbers in Python -Web-Development

Last Answer : answer:

Compute the greatest common divisor (GCD) of numbers in Python -Web-Development

Description : Compute the greatest common divisor (GCD) of numbers in Python -Web-Development

Last Answer : answer:

What Numbers that are easy to compute with mentally are called?

Description : What Numbers that are easy to compute with mentally are called?

Last Answer : benchmark numbers

Show that If m > 1, then the sum of the mth powers of underline (n)even numbers is greater than n (n + 1)^m -Maths 9th

Description : Show that If m > 1, then the sum of the mth powers of underline (n)even numbers is greater than n (n + 1)^m -Maths 9th

Last Answer : answer:

The sum of the first n even natural numbers is ___________

Description : The sum of the first n even natural numbers is ___________

Last Answer : The sum of the first n even natural numbers is ___________

How do you write If the sum of any two numbers is odd then the prodduct of those two numbers is even in logic statement?

Description : How do you write If the sum of any two numbers is odd then the prodduct of those two numbers is even in logic statement?

Last Answer : {(X, Y belong to N) and (X + Y = 1 mod(2))} => X*Y = 0mod(2).

Two dice are thrown together. Find the probability that the sum of the numbers obtained is even a. 1/4 b. 1/6 c. 1/3 d. 1/2

Description : Two dice are thrown together. Find the probability that the sum of the numbers obtained is even a. 1/4 b. 1/6 c. 1/3 d. 1/2

Last Answer : d. 1/2

There are two sets of five numbers each – set P and set Q. P is a set of consecutive even numbers and Q is a set of consecutive numbers. The sum of the numbers of P is 230. The second least number in Q is 33 less than twice the least number in P. Find the sum of the numbers in Q. 1 : 260 2 : 250 3 : 240 4 : 270 5 : None of these

Description : There are two sets of five numbers each - set P and set Q. P is a set of consecutive even numbers and Q is a set of consecutive numbers. The sum of the numbers of P is 230. The second least number in Q is 33 less ... the sum of the numbers in Q. 1 : 260 2 : 250 3 : 240 4 : 270 5 : None of these

Last Answer : 1 : 260

How do you Write a pseudo code algorithm that reads in three values and writes out the result of subtracting the second value from the sum of the first and third values?

Description : How do you Write a pseudo code algorithm that reads in three values and writes out the result of subtracting the second value from the sum of the first and third values?

Last Answer : Pseudocode means you don't use any actual computer language, so you can be quite informal. Just get the general idea. In this case, for instance:Input number to aInput number to bInput ... a + c - bShow resultYour teacher may have specific requirements for pseudocode; try to incorporate those.

When the celebrated German mathematician Karl Friedrich Gauss (1777-1855) was nine he was asked to add all the integers from 1 through 100. He quickly added 1 to 100, 2 to 99, and so on for 50 pairs of numbers each adding to 101. 50 X 101=5,050.Now find the sum of all the digits in integers from 1 through 1,000,000,000.That's all the digits in all the numbers, not all the numbers themselves. -Riddles

Description : When the celebrated German mathematician Karl Friedrich Gauss (1777-1855) was nine he was asked to add all the integers from 1 through 100. He quickly added 1 to 100, 2 to 99, and so on for 50 pairs ... 1,000,000,000.That's all the digits in all the numbers, not all the numbers themselves. -Riddles

Last Answer : The numbers can be grouped by pairs: 999,999,999 and 0; 999,999,998 and 1' 999,999,997 and 2; and so on.... There are half a billion pairs, and the sum of the digits in each pair is 81. The digits in the unpaired number, 1,000,000,000, add to 1. Then: (500,000,000 X 81) + 1= 40,500,000,001.

What two numbers have a sum of 50 and their difference is 10?

Description : What two numbers have a sum of 50 and their difference is 10?

Last Answer : The numbers are 30 and 20.

The sum of the squares between three numbers is 5000. The ratio between the first and the second number is 3:4 and that of second and third number is 4:5. Find the difference between first and the third number. A) 20 B) 30 C) 40 D) 50 E) None of these

Description : The sum of the squares between three numbers is 5000. The ratio between the first and the second number is 3:4 and that of second and third number is 4:5. Find the difference between first and the third number. A) 20 B) 30 C) 40 D) 50 E) None of these

Last Answer : Answer: A a^2 + b^2 + c^2 = 5000 a:b:c = 3:4:5 50x^2 = 5000. X = 10. 5x – 3x = 2*10 = 20

PROBLEM GThe moist unit weights of the soil are 105.73 pcf and 112.67 pcf, and the respective degree of saturation are 50.0% and 75.0%, compute the values of thevoid ratio, porosity, and specific gravity of the given soil?

Description : PROBLEM GThe moist unit weights of the soil are 105.73 pcf and 112.67 pcf, and the respective degree of saturation are 50.0% and 75.0%, compute the values of thevoid ratio, porosity, and specific gravity of the given soil?

Last Answer : Pressuron theory (2013) by Olivier Minazzoli and Aurélien Hees

How do you write an algorithm to find the average of five different input numbers?

Description : How do you write an algorithm to find the average of five different input numbers?

Last Answer : What is the answer ?

Which is an algorithm or techniques used to multiply two numbers. a. Addition algorithm b. Subtraction algorithm c. Multiplication algorithm d. __ Allof these

Description : Which is an algorithm or techniques used to multiply two numbers. a. Addition algorithm b. Subtraction algorithm c. Multiplication algorithm d. __ Allof these

Last Answer : c. Multiplication algorithm

Which algorithm are used depending on the size of the numbers: a. Simple algorithm b. Specific algorithm c. Both d. None of these

Description : Which algorithm are used depending on the size of the numbers: a. Simple algorithm b. Specific algorithm c. Both d. None of these

Last Answer : b. Specific algorithm

Which algorithm is used as a general variant of a theorems, in the domain of integral numbers: a. Multiplication algorithm c. Addition algorithm d. Simple algorithm

Description : Which algorithm is used as a general variant of a theorems, in the domain of integral numbers: a. Multiplication algorithm c. Addition algorithm d. Simple algorithm

Last Answer : c. Addition algorithm

Write an algorithm to subtract two 16 bit numbers (With borrow) in 8086 microprocessor.

Description : Write an algorithm to subtract two 16 bit numbers (With borrow) in 8086 microprocessor.

Last Answer : Algorithm for 16 bit numbers subtraction with borrow: 1. Load 0000H into CX register (for borrow) 2. Load the first number into AX(accumulator) 3. Load the second number into BX register 4. Subtract ... . Move data from AX(accumulator) to memory 8. Move data from CX register to memory 9. Stop

the sum of two numbers is 13 and their difference is 7 what are the two numbers?

Description : the sum of two numbers is 13 and their difference is 7 what are the two numbers?

Last Answer : The answer to your question is 10 and three.10 + 3 = 13 (Sum)10 - 3 = 7 (Difference)I hope this helps.

Rahul got next chance. What is the probability that he got the sum of the two numbers appearing on the top face of the dice is equal to 7? a. 5/9 b. 5/36 c. 1/6 d. 0

Description : Rahul got next chance. What is the probability that he got the sum of the two numbers appearing on the top face of the dice is equal to 7? a. 5/9 b. 5/36 c. 1/6 d. 0

Last Answer : c. 1/6

The sum of 5 natural numbers A, B, C, D, E is 126. It is known that A:B = 7:8, B:C = 2:3, C:D = 4:5, D:E = 5:7.What is the difference between A and E? a) 14 b) 22 c) 24 d) 28 e) 32

Description : The sum of 5 natural numbers A, B, C, D, E is 126. It is known that A:B = 7:8, B:C = 2:3, C:D = 4:5, D:E = 5:7.What is the difference between A and E? a) 14 b) 22 c) 24 d) 28 e) 32

Last Answer : A:B = 7:8 B:C = 2:3 = 8:12 SO, A:B:C = 7:8:12 C:D = 4:5 = 12:15 A:B:C:D = 7:8:12:15 D:E = 5:7 = 15:21 SO, A:B:C:D:E = 7:8:12:15:21 given x(7+8+12+15+21) = 126 or 63x = 126 or x =2 E – A = 21X – 7X = 14X = 28 Answer: d)

What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Description : What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Last Answer : The area of a circle is: pi times radius squared

What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Description : What is The area of a circle depending on the radius. Use the equation A(r) r2 to compute A(7). Round your answer to the nearest hundredth.?

Last Answer : The area of a circle is: pi times radius squared

A cable of core radius 1.25cm and impregnated paper insulation of thickness 2.13cm and relative permittivity 3.5. Compute the capacitance of the cable/km(in nF) a) 195.7 b) 179.5 c) 157.9 d) 197.5

Description : A cable of core radius 1.25cm and impregnated paper insulation of thickness 2.13cm and relative permittivity 3.5. Compute the capacitance of the cable/km(in nF) a) 195.7 b) 179.5 c) 157.9 d) 197.5

Last Answer : a) 195.7

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Write an algorithm to determine the given number is odd or even.

Description : Write an algorithm to determine the given number is odd or even.

Last Answer : Step 1- Start Step 2- Read / input the number. Step 3- if n%2==0 then number is even. Step 4- else number is odd. Step 5- display the output. Step 6- Stop

ripple DES a. Cannot be broken in reasonable time using presently available computers. b. Can be broken only if the algorithm is known using even slow computer. c. Can be broken with presently available high performance computers. d. It is impossible to break ever.

Description : ripple DES a. Cannot be broken in reasonable time using presently available computers. b. Can be broken only if the algorithm is known using even slow computer. c. Can be broken with presently available high performance computers. d. It is impossible to break ever. 

Last Answer : a. Cannot be broken in reasonable time using presently available computers.  

DES using 56 bit keys a. Cannot be broken in reasonable time using presently available computers b. Can be broken only if the algorithm is known using even slow computers. c. Can be broken with presently available high performance computers. d. It is impossible to break ever.

Description : DES using 56 bit keys a. Cannot be broken in reasonable time using presently available computers b. Can be broken only if the algorithm is known using even slow computers. c. Can be broken with presently available high performance computers. d. It is impossible to break ever.

Last Answer : c. Can be broken with presently available high performance computers. 

Which algorithm includes repeated addition of two predetermined values A and S to a product P and then performs a rightward arithmetic shift on P. 49 50. 51. 52. 53. 54. 55. a. Booth’s algorithm b. Usual algorithm c. Multiplication algorithm d. None of these

Description : Which algorithm includes repeated addition of two predetermined values A and S to a product P and then performs a rightward arithmetic shift on P. a. Booth’s algorithm b. Usual algorithm c. Multiplication algorithm d. None of these

Last Answer : a. Booth’s algorithm

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Description : A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes ... (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Last Answer : C

Which of the following is/are not true? (a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c) The set of even integers is countable. (d) The set of real numbers between 0 and 1/2 is countable. (A) (a) and (c) (B) (b) and (d) (C) (b) only (D) (d) only

Description : Which of the following is/are not true? (a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c) The set of even integers is countable. (d) The set of real numbers between 0 ... . (A) (a) and (c) (B) (b) and (d) (C) (b) only (D) (d) only

Last Answer : (D) (d) only

Assume that a big part of the world would from now on begin with reading page 7 as opposed to page 1 from the Google Search results. How would that influence Google's algorithm/- search engine?

Description : Assume that a big part of the world would from now on begin with reading page 7 as opposed to page 1 from the Google Search results. How would that influence Google's algorithm/- search engine?

Last Answer : They would change the engine so that the best results started on page seven, while the first six pages are just filled with enough junk for the best results to be bumped to page seven. The algorithm wouldn’t change, just how they display the results.

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission. a. 8 MSS b. 14 MSS c. 7 MSS d. 12 MSS

Description : Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is ... the end of the tenth transmission. a. 8 MSS b. 14 MSS c. 7 MSS d. 12 MSS

Last Answer : c. 7 MSS

In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Description : In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Last Answer : 17

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Description : Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Last Answer : Answer: Marks to all Explanation: p=3, q=13, d=7, e=3, M=5, C=? C = Me mod n n = p*q  = 3*13 = 39 C = 53 mod 39 = 8 Answer is 8.

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Description : Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Last Answer : (A) 11

Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.

Description : Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.

Last Answer : LRU: The Least Recently Used (LRU) page replacement policy replaces the page that has not been used for the longest period of time. LRU replacement associates with each page the time of that page's last use. ... in question so assume frame size as 3 or 4) LRU: Assume frame size=3