Chapter 5, Problem 1PM

https://docs.google.com/document/d/1lk0DgaWfVezagyjAEskyPoe9Ciw3J2XUH_HQfnWSmwU/edit?usp=sharing using the link for the case study answer the below question

Finally, your going to write several small javascript functions to practice with javascript core programming (basically just using javascript as a normal scripting language). For each section you can hardcode input values, and all output should go to console (we'll worry about the actual web page on Assignment 4). You can complete these all in one HTML file, or create one file for each part.

Write a C program to calculate the checksum for a given line of an IntelHex file. To get full points, you must be able to explain to the instructor the individual parts of the IntelHex line (see below), as well as any part of your code. Definition:The checksum is calculated as the two's complement of the sum of the individual bytes from the beginning of the line to the checksum. Example:If you enter this string: :10010000214601360121470136007EFE09D21901XX You should get a checksum of 40 instead of XX. Demonstrate the completion of the task by calculating checksums, for example, for the following strings: :100010000C9445000C9445000C9445000C944500xx:100020000C9445000C9445000C9445000C944500xx:100030000C9445000C9445000C9445000C944500xx:100040000C9445000C9445000C9445000C944500xx

Write a program to calculate the function sin(x) or cos(x) using a Taylor series expansion around the point 0. In other words, you will program the sine or cosine function yourself, without using any existing solution. You can enter the angles in degrees or radians. The program must work for any input, e.g. -4500° or +8649°. The function will have two arguments: float sinus(float radians, float epsilon); For your own implementation, use one of the following relations (you only need to program either sine or cosine, you don't need both): Tip 1:  Of course, you cannot calculate the sum of an infinite series indefinitely. You can see (if not, look in the program) that the terms keep getting smaller, so there will definitely be a situation where adding another term will not change the result in any way (see problem 1.3 – machine epsilon). However, you can end the calculation even earlier – when the result changes by less than epsilon (a pre-specified, sufficiently small number, e.g.…

Write a C program that finds and prints the machine epsilon for the float and double data types. Also print the values ​​of __FLT_EPSILON__ and __DBL_EPSILON__ defined in float.h. Reminder – the phrase data type tells how the compiler “understands” the ones and zeros you are working with. This identifies whether you are working with integers, letters, real numbers, and so on. Another definition:Machine epsilon is the "distance" between the number 1 and its immediate right neighbor. We work in binary (decimal is in parentheses): 1 + 0,1   = 1,1                    (1 + 1/2 = 1,5) 1 + 0,01  = 1,01                (1 + 1/4 = 1,25) 1 + 0,001 = 1,001            (1 + 1/8 = 1,125) then, due to the limited accuracy of the computer at a certain number of decimal places, a situation arises where 1 + 0.0…001 = 1 (instead of the correct 1.0…001). Then the previous number 0.0…01 is called the machine epsilon . It is obvious that its value may be different on different computers. However, the machine…

Write a program that performs a rotational bit shift to the right for a positive integer. The user enters a number, the number of bits to shift (and, if you want, the direction of the shift, but right is enough). Example:The number 9 (in binary form 1001) when rotated to the right by 1 bit becomes 1100. Tip : A bit rotation (also known as a cyclic shift) is an operation in which the bits in a binary number are shifted a certain number of places to the right or left, with bits that “fall out” at one end being returned to the opposite end. So, start with a bit shift operation. Write a few examples on paper before programming.Tip :  Use the unsigned int data type.You can get the number of bits of this data type as follows: int bit_count = sizeof (unsigned int ) * 8

I need help resolving the following case problem

Click Here for the Solution 27. Write a Program for Insertion Sort in Java. Time Complexity: O(N 2) Space Complexity: 0(1) Click Here for the Solution

Counting ten tennis ball going into a box From a conveyor belt  I want to write a assignment about this topic