Consider the code presented below: y = (1,9, 2) y[1]=8 print(y) What do we get when we execute this code? Answer:

Answer with proper explanation and step by step solution.

[ Select ] initializes pseudo-random numbers in the range of 1 to 100, whereas ( Select] causes same set of random numbers in the given range to appear again and again.

Data Mining - cosine similarity, Jaccard coefficient, Euclidean distance, correlation coefficient.

Use C++

Need some help with this c++ recursive function: Write the function int countEights(int n). Inside the function, compute recursively (no loops) the count of the occurrences of 8 as a digit inside the parameter n. Except that an 8 with another 8 immediately to its left counts double, so 8818 yields 4. Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12). Here are some examples: countEights(8) returns 1 countEights(818 returns 2 countEights(8818) returns 4

write in assebly language using lc3 simulator LC3 simulator-https://wchargin.com/lc3web/  Write a program that implements a for loop that adds 5 to R3 every iteration a. Increment a register by 1 in every cycle of the loop to keep track of the loop iterationsb. Store the maximum amount of iterations that the loop can have in a memory locationc. Your for loop should start at 0 iterations (i.e. i = 0) and stop looping once the maximum is reached Psuedo code: .ORIG x3000 ; Step 1: Clear R3 ; Step 2: Clear R0 ; Step 3: Load the value of MAX into R1 (maximum amount of iterations) ; Step 4: Take the two's compliment of R1 (2 instructions!)   loop ; Step 5: Add #5 to R3 (result) ; Step 6: Increment R0 (loop iteration counter) ; Step 7: Add R1 and R0 and put the result in R2 (Since we did a 2's complement on R1, we are essentially subtracting R1 from R0) ; Step 8: Branch if negative back to loop (this means that R1 > R0 and we need to keep looping) ; Step 9: Halt CPU…

c(n)=10*c(n-1),c(1)=3

8. Given this code: //This a code to determine the root of a function //The function is (cosx+2)/3 #include #include float root(float); int main() { float a[100],b[100],c=100.0; int i=1,j=0; b[0]=(cos(0)-3*0+1); printf("\nEnter a beginning guess:\n"); scanf ("%f",&a[0]); while(c>0.00001) { a[j+1]=root(a[j]); c=a[j+1]-a[j]; c=fabs(c); //fabs = Absolute Value of Floating-Point Number j++; } printf("\n The root of the given function is %f",a[j]); } float root(float x) {

Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"