Let's solve this together.
To make a search term more accurate, you must keep it simple and you must be able to use more specific terms. The more specific you are with what you are asking the engine about, the more friendlier it will respond.
The answer is Option B. I hope this answer helped you!
Answer:
def power(base, expo):
if expo == 0:
return 1
else:
return base * power(base, expo-1)
Explanation:
*The code is in Python.
Create a method called power that takes base and expo as parameters
Check if the expo is equal to 0. If it is return 1 (This is our base case for the method, where it stops. This way our method will call itself "expo" times). If expo is not 0, return base * power(base, expo-1). (Call the method itself, decrease the expo by 1 in each call and multiply the base)
Answer:
A. append()
Explanation:
I don't know python fully but i do know what stuff means
Print: display text
Main: basically the roots of the entire code
Sort: it's in the freaking name
so crossing out 3 of the 4 its safe to assume its append.
Answer:
Description: Write a MASM 32bit program with a loop and indexed addressing that calculates the sum of all thegaps between successive array elements. The array elements are doublewords, sequenced in nondecreasing order.
;Include Irvine32.inc file used with link library for 32 bit applications
.386
.model flat,stdcall
.stack 4096
ExitProcess proto,dwExitCode:dword
INCLUDE Irvine32.inc
.data
myArray DWORD 0,2,5,9,10
arrSize = ($-myArray)/TYPE myArray
gapArr DWORD arrSize-1 DUP(?)
sum DWORD ?
.code
main PROC
;Call the procedure
call Clrscr
;Initialize ESI pointer
mov esi, 0
mov ecx, arrSize
dec ecx
L1:
mov eax, myArray[esi+4]
sub eax, myArray[esi]
mov gapArr[esi], eax
inc esi
loop L1
;Calculate the sum of gaps between array elements
mov sum, 0
mov esi, 0
mov ecx, arrSize
dec ecx
; move gapArr[esi] to a temporary register and then add that register value to sum
L2:
mov edx, gapArr[esi]
add sum, edx
inc esi
loop L2
INVOKE ExitProcess,0
main ENDP
END main
Explanation:
