write a program that executes it.  Use floating-point types for all values. Algorithm Weekly Exercise read x read y compute p = x * y compute s = x + y total = s2  + p * (s - x) * (p + y) print total end Weekly Exercise

Problem Statement       The barcode used by the U.S. Postal System to route mail is defined as follows:  Each decimal digit in the ZIP code is encoded using a sequence of three half-height and two full-height bars.  The barcode starts and ends with a full-height bar (the guard rail) and includes a checksum digit (after the five-digit ZIP code or ZIP + 4), computed by summing up the original digits modulo 10.   Define the following functions:   Draw a half-height or full-height bar on stddraw. Given a digit, draw its sequence of bars. Compute the checksum digit.   Also define global code that read in a five- (or nine-) digit ZIP code as the command-line argument and draws the corresponding postal barcode.

C Programming Language Assignment #4Introduction to C Programming – COP 3223Objectives1. To learn how to use loops for repeated execution2. To reinforce knowledge of If-Else statements for conditional executionIntroduction: Programmers for a Better TomorrowProgrammers for a Better Tomorrow is an organization dedicated to helping charities, medical societies, and scholarship organizations manage various tasks so that they can focus on making the world a better place! They have asked you and your classmates to help them develop some new programs to benefit their organizations.Problem: Scholarship Endowment Fund Part 2 (fund2.c)One division of Programmers for a Better Tomorrow is their Scholarship Endowment Fund. They provide yearly scholarships to students who need a hand in amounts of 1000, 500, and 250 dollars.The money for these scholarships comes from interest made on previous donations and investments. You will create a program to track the amount in the Fund as various donations…

1.Please use recursive function principle and use Visual Studio or Xcode to create a function called: f (int n), which will be calculated based on following formula: f (n) = [1+f (n-1)] *2 f (0) = 0 2. Please design another function called fibonacci function: fibonacci (int n), which will be calculated based on following formula: fibonacci ( int n) = fibonacci (n-1) + fibonacci (n-2) fibonacci (0) = 0 fibonacci (1)=1 3. Please copy and paste your source code here. You don't need to compile and execute your source code. The format will be like: #include <iostream> #include <cmath> using namespace std; int f ( int n) { } int fibonacci ( int n) { }