Consider an algorithm that contains a loop that can be expressed with the following pseudocode: for( i = 1 through n ){ Task T } If Task T requires t time units, how many time units (in terms of t) does the entire loop require? options: a) i b) n c) n * t d) n^2 e) n^2 * t

A company keeps a table containing the salary and boss of each employee. Here is an example: Name Salary Boss Fred 27000 James John 36000 Cindy Mary 39000 Tom Adam 23000 Mary Write an algorithm to count the number of employees who earn more than their boss.

The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17                # we want the square root of 17 for exampleg = 4                 # our guess is 4 initiallyerror = 0.0000000001  # we want to stop when we are this closewhile abs(n - (g**2)) > error:  g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point   Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!

With the Binary Search algorithm, the algorithm can be developed by the loop-based form as well as a recursive form. Which of the following is not true? O If the item is not found, the loop version returns when the range bounds reach, but the recursive version finishes when the recursive depth is more than half the initial search range. The search range starts with the whole array, and only the recursive version can work on a subrange passed through arguments. O Both forms of the program divide the search range repeatedly in half. O If the item is found, the loop version returns from the entire method, whereas the recursive version returns from one level of recursion.

1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n > 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?

The following code is used to derive Fibonacci algorithm with this sequence: (0, 1, 1, 2, 3, 5, 8, 13, 21, …) where each number is “add” of two previous ones. int fib(int n){ if (n==0) return 0; else if (n == 1) return 1; else return fib(n−1) + fib(n−2); } Explain why the following RISC-V assembly code works, you need to explain all the details using the comments as hints?   # IMPORTANT! Stack pointer must remain a multiple of 16!!!!   addi x10,x10,8                # fib(8), you can change it fib: beq x10, x0, done             # If n==0, return 0 addi x5, x0, 1 beq x10, x5, done             # If n==1, return 1 addi x2, x2, -16              # Allocate 2 words of stack space sd x1, 0(x2)                  # Save the return address sd x10, 8(x2)                 # Save the current n addi x10, x10, -1             # x10 = n-1 jal x1, fib # fib(n-1) ld x5, 8(x2) # Load old n from the stack sd x10, 8(x2) # Push fib(n-1) onto the stack addi x10, x5, -2 # x10 = n-2 jal x1, fib # Call fib(n-2)…

help in pytyhon