The following source code was made in Matlab so I would like you to write it in C language and have it run f=10; t=0:1/(f*32):1; A=1; y=A*sin(2*pi*f*t); plot(t,y)

Write a simple Common Lisp function that converts temperature in Celsius to Fahrenheit and show how to correctly output it! Use temp-change as function name and c as the parameter!

Plz solve the question using c programming without using the library # include stdlib.h. or string.h .. Only use # include stdio.h and # include math.h And printf, scanf, fout, fin.

Write a C program that takes a positive integer N from the user as input. If the user inputs a number that is 0 or negative the program should continue to ask the user for a valid input. It then calculaten the sum of integers from 1 to N using recursion. Then, print the sum of integers from 1 to N to screen

Write a C++ program using classes and recursion functions to convert a number in a given base (the user enters the base - from 2 to 9) to a decimal number. The algorithm states that each successive digit in the number is multiplied by the base raised to the power corresponding to its position in the number. The low-order digit is in position 0. We sum together all of these products to get the decimal value. For example, in binary – base 2, if we have the binary number 111001, we convert it to decimal as follows: 1x 25+1x 24+1x23+0x22+0x 21+1x 2o=57 For a base 5 number, 14230: 1x54+4x53+2x52+3x51+0 x 50=1190 Validate your input. You should check for invalid digits and provide an informative error message to the user. This program requires you to use a recursive function for the conversion to decimal. Failure to do that will result in no points awarded.

Need some help with this c++ problem In order to compute a power of two, you can take the next-lower power and double it. For example, if you want to compute 211 and you know that 210 = 1024, then 211 =わ 2 ×ばつかける 1024 =わ 2048. Based on this observation, write a recursive function int pow2(int n) where n is the exponent. If the exponent is negative, return -1. int pow2(int n) { ..... }

please answer with proper explanation and step by step solution. i need code in c++ Using the sample BUBBLESORT program given in class do the following: Print out the original unsorted data Print out the data sorted (ascending) Print out the data sorted (descending) Print out the Maximum and Minimum and the range Print out the median Print out the mode Print out any data having a frequency greater than 3 Print out the standard deviation Sample output: Unsorted List: 9 8 1 6 12 3 5 4 3 6 1 3 6 6 Sorted List: 1 1 3 3 3 4 5 6 6 6 6 8 9 12 (ascending) Sorted List: 12 9 8 6 6 6 6 5 4 3 3 3 1 1 Maximum: 12 Minimum: 1 Range: 11 Median: 5.5 Mode: 6 Frequency: 6 occurs 4 times 3 occurs 3 times Do NOT use files...I should be able to enter UP TO 15 values and have the program work. BE sure that your program covers ALL cases of the median and mode as discussed in class!!!!

Write a program in C that, given two points on a two-dimensional graph, outputs a message (string) if the line that connects them is horizontal or vertical, or if the slope is positive or negative.What would you modify or adjust in your code if we move from a 2D cartesian system to a 3D dimensional cartesian system?You need to take into consideration if the system is 3D and therefore you need to ask the user to insert X, Y , and Z.

Find the big-oh runtime for the c++ function given

1. You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. 2. Trace your function and call. Remember that you must keep track of memory for each function call and provide output. How would I trace a function? and keep track of its memory for each function call?

Suppose that you have the following recursive function written in C++. I've intentionally written the function so that it doesn't use descriptive names for anything, though that's obviously not a good design practice, but I aim not to bias your understanding of the techniques you'll be using by assuming anything about what the function's goal is; to stay "on task" here, you should resist the temptation to try to figure that out first. void kaboom( const std::vector& v, std::vector& w, unsigned int i) { if (i < w.size()) { int q = 0; for (int j : v) { q += j; } w.at(i) - kaboom(v, w, i + 1); } = q; } 1. Using the techniques from our discussion of the Asymptotic Analysis of Recursion, write a recurrence that describes the time required to run the following call to kaboom for two vector v and w whose sizes are the same. Use the variable s in your recurrence to denote that size. kaboom(v, w, 0) 2. Using the repeated substitution technique, reduce the recurrence to a closed form, then give...