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:
Hi, A Tech-Savvy here.
Answer:
(C) Lengthen the time period between forced password changes.
Answer:
Swipe down in the right corner or for older versions swipe from bottom
Explanation:
Answer:
It is not possible.
Explanation:
In this example, we need to accommodate 473 computers for six clients that are 473 IP addresses.
For this request just we have /22 IPv4 address blocks, this mean
22 red bits 11111111111111111111110000000000 <--- 10 host bits
We must increase red bits to 25, we need these 3 bits to create 6 sub red, in this case, 2^3 = 8 sub red.
Why did we ask 3 bits? Because if we ask only 2, 2^2 = 4, and we need 6 sub red.
25 red bits 11111111111111111111111110000000 7 host bits
In this case, we need more than 260 computers, but just we have 7 bits, this means.
2^7 = 128 and just one customer needs 260, for that is impossible.
