IMG_0542

NameError Traceback (most recent call last) /var/folders/rh/yydz4sfn4ts333pnp6vmxncm0000gn/T/ipykernel_5330/3156197672.py in <module> 6 result =[] 7 for i in nums: ----> 8 root =(lambda x: math.sqrt(i))(x) 9 result.append(round(root,2)) 10 print(result) NameError: name 'x' is not defined  Im still working on it, as it appear that x is not defined ... any suggestions?

What are the values of PB0-7 and PD0-7 after the following code segment executes? unsigned char w = 0x35; DDRB = 0X0F; DDRD OX0F %3D PORTB = w & OX0F; PORTD = w >>4; P87 P86 PB5 P84 PB3 PB2 PB1 PBO 000 0 010 1 b010 101 0 1 1001 1 001 PD7 PD6 PDS PD4 PD3 PD2 PD1 PDO 0000 001 1 001 1 001 1 10 10 1 01 d000 0000 01 1 Select one: а. а b. b С. с d. d е. е

Write a windows32 assembly language program in visual studio that utilizes a recursive procedure. The main (_MainProc) procedure should: accept, from the user, an integer greater than 0.  Guard against invalid values being entered using a loop. call the recurse sub-procedure using the cdecl protocol, receive the results of the sub-procedure, and display the results.         NOTE: The main procedure should do nothing more than this! The recurse sub-procedure should (following the cdecl protocol): recursively find the solution for: recurse(0) = 3, and recurse(n) = 5 * recurse(n-1) + 9, for n > 0. return the value back to the calling procedure. Notes:   Both the main procedure and recurse sub-procedure must follow the cdecl protocol. I need commented code otherwise it will be not accepted

Write a windows32 assembly language program in visual studio that utilizes a recursive procedure. The main (_MainProc) procedure should: accept, from the user, an integer greater than 0.  Guard against invalid values being entered using a loop. call the recurse sub-procedure using the cdecl protocol, receive the results of the sub-procedure, and display the results.         NOTE: The main procedure should do nothing more than this! The recurse sub-procedure should (following the cdecl protocol): recursively find the solution for: recurse(0) = 3, and recurse(n) = 5 * recurse(n-1) + 9, for n > 0. return the value back to the calling procedure. Notes:   Both the main procedure and recurse sub-procedure must follow the cdecl protocol.

Please help me answer thisd for Operating Systemsz

O RottenAnchoredDecagons x M (no subject) - jcofield122e x O Lab 6: Module 6 - Repetitis x https://tcc.instructure.com/courses/42392/assignments/976548?module_item_id32464159 -Write a program with af as Program for Fibonacci nu x i1390rmc01171ipg (1920 x0 1390 Write a program with a for loop that displays the numbers 1 to 10 and their respective cubes. You may want to use the range function. Your output should look like the example Number Cube ****** 1 8 27 4 64 125 5. 216 343 512 8. 729 9. 1000 10 To format your table you can use the tab syntax, \t, to tab your output. For example: print("Number\t Square")

Demonstrate how the gdb debugger can be utilized in aiding the establishment of Pointer assignment error   language： C   Perform debugging in Ubuntu Linux 16, i.e.   Use only the gdb debugger.   give the following screenshots：1code   2load program to gdb   3set break point   4fixed code   5load proggram ingdb again with fixed code

Write Code in C or C++ Implement matrix multiplication using multithreading. Application should have  pthread_create pthread _join pthread_exit In the program , every thread , must return the value and must be collected in pthread_join in the main function. Final sum of row-colomn must be done by main thread

explain the lines of code:   fast pl

Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifier There are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records. If a2 has the address of a student record, if using indexed addressing mode, what is the index value X such that X(a2) addresses the course mark?

Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifier There are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records. If a2 has the address of a student record, what is the location of the next record in the array / data area:

Crypto Complete the missing BIP39 mnemonic seed phrase and get address 3 at BIP32 derivation path m/0'/0 as the flag. nature midnight buzz toe sleep fence kiwi ivory excuse system ____ ______ You will need to make use of this, as the start of the 128 char BIP39 seed: 131c553f7fb4127e7b2b346991dd92

For the following code fragment.LOOP: LD R1, 0(R2)           ;load R1 from address 0+(R2)           DADDI R1, R1, #1   ;R1 <– R1 + 1           SD R1, 0, (R2)          ;store (R1) at address 0(R2)           DADDI R2, R2, #4    ;R2 <– R2 + 4           DSUB R4, R3, R2      ;R4 <– R3 - R2           BNEZ R4, LOOP       ;branch to LOOP if (R4) != 0Assume that the initial value of R3 is (R2)+20. Show the timing of this code fragment

Appendix A. BTB entries with PC and Target PC. Please include only entries with content.Entry PC Target0 423000 425E407 42E01C 42E0288 423020 4230A811 42E02C 42B30C14 423038 425E40: : :: : :1018 422FE8 4230A8

MATLAB CODE

What does the following Python code do? import serial #Import Serial Library arduinoSerialData = serial.Serial('com11,9600) #Create Serial port object called arduinoSerialData while (1==1): if (arduinoSerialData.inWaiting()>0): myData = arduinoSerialData.readline() print myData O Nothing O Read data from the serial port and plot it on an x-y graph. O Read data from the serial port and displays it on the screen. O Reads data once from the serial port and displays one piece of data on the screen.

AWS Lambda Function-Python programming   Using boto3 library, please give a code that can delete an elastic load balancer with no instance attached to the elastic load balancer   Provide code/screenshot

FI 2 Overview S To demonstrate you can implement the microservices architecture, write software comprised of three separate programs: W F2 7x 1. A program that generates pseudo-random numbers (PRNG Service) 2. A program that, given a non-negative integer i, returns the ith image in a set (order doesn't matter) (Image Service) If i is the number of images, modulo i by the size of the image set 3. A user interface (UI) that either has a button or can receive a user command. When the button is pushed or the command is entered... Programs can be written in any language(s). (a) UI calls the PRNG Service (b) UI calls the Image Service using the pseudo-random number from the PRNG Service (c) UI displays the image (or a path to it) Use any set of images (e.g., downloaded from https://www.kaggle.com/). Store images locally in a folder; no API calls needed. No DB needed. Requirements UI must either have a button (if UI is graphical) or be able to receive a user command (if UI is text-based) # 3…

switch (c) { case 1: a = 10; break; case 2: a = 20; break; case 3: a = 30; break; default: a = 0; } Translate this piece of C codes into ILOC codes. Variable c and a should be stored in the activation record. Your translated codes start at address 1000 and grow to larger addresses. The address of a variable in the activation record is r_arp[@name], where r_arp is the register storing the activation record address and @name is the macro for the offset of the variable name. You may use labels instead of address number in jump/branch instructions.

Find the register values:.datamyBytes BYTE 12h,34h,56h,78h.codemov ax,WORD PTR [myBytes] ; AX = ?mov ax,WORD PTR [myBytes+2] ; AX = ?mov eax,DWORD PTR myBytes ; EAX = ?

This is what I have so far I need help with the commenting on the assembly code    I have included my C code that this assembly was generated from so it can be of help please do not just give me back my already commented C code that does not help me My assembly code largest(int*, int):         push    rbp         mov     rbp, rsp         mov     QWORD PTR [rbp-24], rdi         mov     DWORD PTR [rbp-28], esi         mov     rax, QWORD PTR [rbp-24]         mov     eax, DWORD PTR [rax]         mov     DWORD PTR [rbp-4], eax         mov     DWORD PTR [rbp-8], 1         jmp     .L2 .L4:         mov     eax, DWORD PTR [rbp-8]         cdqe         lea     rdx, [0+rax*4]         mov     rax, QWORD PTR [rbp-24]         add     rax, rdx         mov     eax, DWORD PTR [rax]         cmp     DWORD PTR [rbp-4], eax         jge     .L3         mov     eax, DWORD PTR [rbp-8]         cdqe         lea     rdx, [0+rax*4]         mov     rax, QWORD PTR [rbp-24]         add     rax, rdx         mov…

In python    Code so far: # TODO: Declare global variables here.recursions = 0comparisons = 0 def binary_search(nums, target, lower, upper):    # Type your code here.    target = (lower + upper) //2    global         if target == nums[index]:        return index    if (lower == upper):        comparisons +=1        if target == nums[lower]:            return lower        else:            return -1    if (nums[index] < target):        recursions += 1        return binary_search(nums,target, index, upper)    if nums[index] > target:        recursions += 1        return binary_search(nums, target, 0, lower) if __name__ == '__main__':    # Input a list of nums from the first line of input    nums = [int(n) for n in input().split()]        # Input a target value    target = int(input())     # Start off with default values: full range of list indices    index = binary_search(nums, target, 0, len(nums) - 1)     # Output the index where target was found in nums, and the    # number of…

Please give me correct solution and fast.

numbers (-23, -5, 9, 14, 15, 18, 23, 24, 25, 29, 34, 62, 85, 87); int index = binarySearch (numbers, 25); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search. Now suppose we are performing both an iterative (loop-based) sequential search and then a recursive binary search on the same list. The sequential search is a standard version that does not take any advantage of the sortedness of the list, simply looking each element in order from the start to the end of the list. Suppose we are searching the list for the value 25. Also suppose that we are operating on a special computer where reading an element's value in the list (such as examining the value of numbers [0]) costs 7 units of time; calling any function costs 10 units of time; and all other operations are essentially O cost. (Keep in mind that even in a non-recursive search, the cost of making the one and…

Direction: You can consult any resources such as books, online references, and videosfor this assignment, however, you have to properly cite and paraphrase your answerswhen it is necessary.Solve the problem correctly.   Design an enhanced 32 bit ADDER with  AND logic. Discuss what type ofVerilog models (e.g. Structural, Dataflow etc.) you have used and why? Also show yourcomments for all the parameters such as input and output ports, connections, instancesof other lower level modules etc.

vv^(1) 2 3 4 Write the expression as a single logarithm. 3(logz-4logy)+2logw

class Solution:     def searchRange(self, nums, target):         def binary_search(nums, target, left, right):             while left <= right:                 mid = (left + right) // 2                 if nums[mid] == target:                     return mid                 elif nums[mid] < target:                     left = mid + 1                 else:                     right = mid - 1             return -1           def find_leftmost(nums, target):             left, right = 0, len(nums) - 1             while left <= right:                 mid = (left + right) // 2                 if nums[mid] >= target:                     right = mid - 1                 else:                     left = mid + 1             return left           def find_rightmost(nums, target):             left, right = 0, len(nums) - 1             while left <= right:                 mid = (left + right) // 2                 if nums[mid] <= target:                     left = mid + 1…

Create an aligned malloc and free code that enables memory allocation with the requirement that the returned memory value be divisible by a particular power of two.The memory location returned by EXAMPLE align_malloc (1000, 128) is a multiple of 128 and refers to memory with a 1000-byte capacity.Memory allotted by align_malloc will be released by aligned_free().

HOW TO DO THIS path FUNCTION IN C PROGRAMMING HELP!!!   Add a new built-in path command that allows users to show the currentpathname list, append one pathname, or remove one pathname. In your shellimplementation, you may keep a data structure to deal with the pathname list.If you do not use execle() or execve() that allows you to execute withyour own environment variables, you will need to add it to the “real” PATHenvironment variable for executables in the path to work correctly. The initialvalue of path within your shell shall be the pathname list contained in the PATHenvironment variable. Implement the path command as follows:• path (without arguments) displays the pathnames currently set. It shouldshow pathnames separated by colons. For example, "/bin:/user/bin".• path + ./bin appends the pathname to the path variable. You mayassume that only one pathname is added at a time.• path - ./bin removes the pathname to the path variable. You mayassume that only one pathname is removed at…