The following program has run time (number of operations) proportional to: n = int(input("Please enter n"))

Determine the growth function and order of the following codefragment:for (int count=0; count < n; count++){ for (int count2=0; count2 < n; count2=count2+2) { System.out.println(count + ", " + count2); }}

Can you check if I have done the question correctly please, if not can you fix the code for me please.

Exericse-2 please code in python as pseudocde and Exercise-3- Please show work in a book

Construct a DFA A so that L(A) = L(N) where N is the following NFA:

One remarkably simple formula for calculating the value of p is the so-called Madhava-Leibniz series: p4 = 1-13+15-17+19-.... Consider the recursive function below to calculate the first n terms of this formula: double computePI(int n) { if (n <= 1) { return 1.0;} int oddnum = 2 * n - 1; if ((n % 2) == 0 { } return -1.0 oddnum + computePI(n − 1); } else { } return 1.0 / oddnum + computePI (n - 1); Which statements about the run-time performance of this function are true? 1.Each time this function is called it will invoke at least two more recursive calls II.The number of recursive calls this function will make is approximately equal to the value of the parameter variable n III.Not counting overhead, this function will be about as efficient as an iterative implementation of the same formula

30The following code is supposed to return n!, for positive n.  int factorial(int n){  if (n == 0)    return 1;  else    return (n + factorial(n - 1));} An analysis of the code using our "Three Question" approach reveals that:  Group of answer choices it fails the base-case question. it fails the smaller-caller question. it fails the general-case question. it passes on all three questions and is a valid algorithm. None of these is correct.

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.

Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.

Course: Algorithm Project: We will use the defintion of of n-Queens Problem from the chapter Backtracking.  In this project you need to describe Problem and Algorithm and Indicate input and output clearly.  Analyze and prove the time complexity of your algorithm. Implement the algorithm using backtracking(including writing testing case).illustrate key functions with comments indicating: What it does, what each parameter is used for, how it handles errors etc. Indicate the testing scenarios and testing the results in a clear way. Make sure source is commented appropriately and structured well.