Write pseudo code of the algorithm to solve the following problem with minimum number of floor checking complexity (other logic which yields more floor will not be considered as the answer): “A firm wants to determine the highest floor of its n-story headquarters from which a gadget can fall without breaking. The firm has two identical gadgets to experiment with. If one of them gets broken, it cannot be repaired, and the experiment will have to be completed with the remaining gadget. Design an algorithm in the best efficiency class you can to solve this problem.” A prototype of the algorithm is given as: int checkHeight(Building[1..n], W1, W2) //Building with 1 to n floors and two weights w1, w2, and it will return the highest //floor number from which the weight can fall safely. Whenever, you throw a weight, //it will either break or do not break with a function ThrowWeight(FloorNo, W) //It will return 1 if the weight does not break and 0 if it breaks.

Python code plzz Don't copy i will rate..

When the robot makes a turn, it would be useful to have an operation to perform on d to represent this turn. This is because after making a turn, the new value of d will depend on the old value of d. Complete the table for the new values of d if the robot is turning left or right.Then determine an expression in terms of d that will give the new position if the robot turns left and another expression if the robot turns right. Type these expressions in the last row of the table. Attached is the table I completed. All rows are correct except the last one. I'm not sure what my error is.

The square root of any number N>0 can be opproximated by repeated calculation using the formula N = squared_value NG = 0.5 (FG + N/FG) where NG stands for next guess and FG stands for first guess. The value of NG and FG are compared. If the two values are comparably close, then NG is the final answer. If the two values are off, NG becomes FG and the formula is used again to compute FG. After so many iterations, NG and FG will merge. a. Write a function that calculates the square root of a number using this method. The initial guess wilI be the starting value of FG (FG = 1). The function will compute a value for NG using the formula given and returns that value. (Change the name of the functions to something more meaningful) double fun_1 (double FG, double N); b. Write a function that prompts the user for any number N > 0, and returns that value back. The prototype is like follows: double fun_2 ( void ); Now inside the main function, check the difference between NG and FG to see whether…

Q1 The periodic function sin⁡(2x) has multiple roots between x values of -5π and 5π. If xL = -15 and xU = 15, which of the following statements is true using a bracketed method? Select one: a. All roots will be returned b. The middle root will be returned c. The chosen bracket is invalid for bracketed methods d. A single root will be returned e. The algorithm will be stuck in an infinite loop     Q2 Consider x and y to represent data points (xi,yi), where i = 1, 2, 3, … n. What is the length of pafter running the following command? p = polyval(x,y) Select one: a. n b. n - 1 c. n + 1 d. Empty variable e. 1   Q3 Consider a system of linear equations in the form of AX = B, where X is the unknown vector. Which of the following can be used to solve for X? Select one: a. X = A\B b. X = B./A c. X = inv(B)*A d. X = inv(A)./B e. X = B\A

can you solve this please ?

please code in python A classic example of this process is known as the "Drunkard’s Walk":  a drunken student leaves a pub in Dinkytown and attempts to walk back home.  The individual is so inebriated however, that when they arrive at each street intersection a random direction is chosen (including a u-turn!).  The question arises: "what are the chances that the student will leave Dinkytown before morning?"   Write a Python program using Turtle graphics that will visualize the Drunkard's Walk.  Your program needs to do the following: Starting in the middle of the turtle window, obtain a random integer in the range [1,4] (use randint) and change the turtle heading to 0, 90, 180 or 270 based on the value of the integer: 1, 2, 3 or 4, respectively. You can use turtle.setheading(angle) to do this.  Move the turtle one block (we’ll say forward 30 in turtle graphics represents one city block), in the new heading. Repeat this process 200 times. You may want to use turtle.speed(0) and…

Please assist with problem.

1. Both mergesort and quicksort uses divide and conquer paradigm to sort unsorted list. (a) Imagine you want to write the quicksort algorithm to sort an array into non-increasing order. Write down the partition algorithm that is used in the divide phase in the quicksort algorithm. Show that the time complexity of this algorithm is 0(n). (b) Identify the worst case situation in the naive quicksort algorithm and show that in the worst case situation its time complexity is O(n2)

Can the above algorithm be ran through a test example?