Create a function that takes two integers, num and n, and returns an integer which is divisible by n and is the closest to num. If there are two numbers equidistant from num and divisible by n, select the larger one. Examples roundNumber (33, 25) <-> 25 roundNumber (46, 7) → 49 roundNumber (133, 14) 140 Notes n will always be a positive number.

Q: y using C++

A: Define header files &lt;iostream&gt; , &lt;math.h&gt; , &lt;iomanip&gt; and &lt;chrono&gt; for io,…

Q: O None of these

A: multiplicative inverse of 010 in gf(8)

Q: WRITE CODE IN C LANGUANGE On their way down the river, Jojo and Lili saw two frogs each in position…

A: I have implemented the above requirements in C as per the specification. Comments are mentioned for…

Q: Problem 5. Write a dynamic programming based version of the factorial function and prove its time…

A: The logic or algorithm for the Dynamic Programming based version of a program to find the factorial…

Q: Let D = {w w contains an even number of a's and an odd number of b's and does not contain the…

A: SOLUTION -If we want to create a DFA for the language D and provide a regular expression that…

Q: efine F(p, q) as the dot product of t +M–1 and Aq, Aq+1,. .., Aq+M-

A: Below is the detailed and simplified python code for the given problem statement:

Q: Problem 4 Write down the CFG that generates each of the following languages: (2) {w|w=a'b'ck, k= i+…

A: The CFG that generates each of the given language

Q: The problem is from Introduction to Programming and Data Structures with C++, 4th edition (Algebra:…

A: # include &lt;iostream &gt;  # include &lt; cmath &gt; using namespace std; int main ( ) { int…

Q: work and write the cosine function's taylor expansion (N=10) in C++ and compare the with your…

A: Algorithm :- 1. Start 2. Create factorial function fact(int n) 3. return (n==0) || (n==1) ? 1 : n*…