Using the C Programming language, write two versions of a function that contains a loop. Each the function should accept two numbers and calculate the sum of all numbers between the first number and last number (inclusive of the first and last number). Once each function is written and tested for correct output, generate an assembly language version of the function. Write a version of the function using a for loop Write a version of the function using a do..while loop Is the assembly language version of each loop function the same or different? (hint: Number of registers used  Number of jumps (iterations), Total number of operations).

using chapter 1 to 5 from the book C how to program, eighth edition

C++ Programming Request an integer n from the console.Write a function that accepts n as input and outputs the multiplicationtable of n from 1 to n to the console.   Example Output: Enter an integer: 91 * 9 = 92 * 9 = 183 * 9 = 274 * 9 = 365 * 9 = 456 * 9 = 547 * 9 = 638 * 9 = 729 * 9 = 81

This is for C++ Design a Boolean function named isPrime(), which takes an integer as an argument and returns True if the argument is a prime number, or False otherwise.  Display all of the prime numbers from 1 through 100.  The program should have a loop that calls the isPrime() function.  11 Prime Numbers List  (15 points) Use CONSTANTS to set the maximum number in the table to 100 and the number of entries per row to 5.   Table of prime numbers from 1 to 100  1   2   3   5   711 13 17 19 2329 31 37 41 4347 53 59 61 6771 73 79 83 8997Press any key to continue . . . Experiment: What is the result if the maximum number is changed, for example, to 1000?

C programming Only

Programming language: Dr. Racket Write a function encode that consumes a string message. The function produces a string which is encrypted according the following procedure: Only the letters from the original message will be encrypted. Other characters such as spaces, punctuation, numeric digits, etc. are not included in the encrypted message at all. The encrypted message will only contain uppercase letters. Each letter will be replaced by the uppercase letter at the opposite end of the English alphabet.In other words, A or a will become Z, B or b will become Y, C or c will become X, ..., Z or z will become A. The encrypted message will have a single space separating each letter. You may assume that the letters in message are English letters only.   For example:  > (encode "Cat") "X Z G" > (encode "Is this correct?")  "R H G S R H X L I I V X G"