In which type of attack do you get malicious code in links from seemingly reliable websites?

When does technology become assistive technology?

deff fn [24]

Technology becomes assistive technology C. WHEN SOMEONE WITH A DISABILITY OR LIMITATION USES IT TO HELP HIM OR HER DO SOMETHING.

Assistive technology is defined as any technological item, equipment, software or product system that is used to assist individuals with disabilities to increase, improve, and maintain their functional capabilities.

6 0

2 years ago

Read 2 more answers

Gathering information with your eyes is called

Ivahew [28]

Observing, Looking, Collecting, there are a few words for "gathering information with your eyes".

4 0

3 years ago

Read 2 more answers

Write a procedure named Str_find that searches for the first matching occurrence of a source string inside a target string and r

kirill115 [55]

Answer: Provided in the explanation section

Explanation:

Str_find PROTO, pTarget:PTR BYTE, pSource:PTR BYTE

.data

target BYTE "01ABAAAAAABABCC45ABC9012",0

source BYTE "AAABA",0

str1 BYTE "Source string found at position ",0

str2 BYTE " in Target string (counting from zero).",0Ah,0Ah,0Dh,0

str3 BYTE "Unable to find Source string in Target string.",0Ah,0Ah,0Dh,0

stop DWORD ?

lenTarget DWORD ?

lenSource DWORD ?

position DWORD ?

.code

main PROC

INVOKE Str_find,ADDR target, ADDR source

mov position,eax

jz wasfound ; ZF=1 indicates string found

mov edx,OFFSET str3 ; string not found

call WriteString

jmp quit

wasfound: ; display message

mov edx,OFFSET str1

call WriteString

mov eax,position ; write position value

call WriteDec

mov edx,OFFSET str2

call WriteString

quit:

exit

main ENDP

;--------------------------------------------------------

Str_find PROC, pTarget:PTR BYTE, ;PTR to Target string

pSource:PTR BYTE ;PTR to Source string

;

; Searches for the first matching occurrence of a source

; string inside a target string.

; Receives: pointer to the source string and a pointer

; to the target string.

; Returns: If a match is found, ZF=1 and EAX points to

; the offset of the match in the target string.

; IF ZF=0, no match was found.

;--------------------------------------------------------

INVOKE Str_length,pTarget ; get length of target

mov lenTarget,eax

INVOKE Str_length,pSource ; get length of source

mov lenSource,eax

mov edi,OFFSET target ; point to target

mov esi,OFFSET source ; point to source

; Compute place in target to stop search

mov eax,edi ; stop = (offset target)

add eax,lenTarget ; + (length of target)

sub eax,lenSource ; - (length of source)

inc eax ; + 1

mov stop,eax ; save the stopping position

; Compare source string to current target

cld

mov ecx,lenSource ; length of source string

L1:

pushad

repe cmpsb ; compare all bytes

popad

je found ; if found, exit now

inc edi ; move to next target position

cmp edi,stop ; has EDI reached stop position?

jae notfound ; yes: exit

jmp L1 ; not: continue loop

notfound: ; string not found

or eax,1 ; ZF=0 indicates failure

jmp done

found: ; string found

mov eax,edi ; compute position in target of find

sub eax,pTarget

cmp eax,eax ; ZF=1 indicates success

done:

ret

Str_find ENDP

END main

cheers i hoped this helped !!

6 0

3 years ago

How many times do you need to click the Format Painter button to apply copied formats to multiple paragraphs one right after the

const2013 [10]

The answer is (A) Twice

Format painter is that icon tool that looks like a paintbrush that is used to pick up formatting of an existing text and then paints it on the next text you select. If you wish to apply the formatting to more than one element, you should double-click the format painter and press esc key to deactivate.

5 0

3 years ago

Read 2 more answers

Write a method that prints on the screen a message stating whether 2 circles touch each other, do not touch each other or inters

beks73 [17]

Answer:

The method is as follows:

public static void checkIntersection(double x1, double y1, double r1, double x2, double y2, double r2){

double d = Math.sqrt(Math.pow((x1 - x2),2) + Math.pow((y1 - y2),2));

if(d == r1 + r2){

System.out.print("The circles touch each other"); }

else if(d > r1 + r2){

System.out.print("The circles do not touch each other"); }

else{

System.out.print("The circles intersect"); }

}

Explanation:

This defines the method

public static void checkIntersection(double x1, double y1, double r1, double x2, double y2, double r2){

This calculate the distance

double d = Math.sqrt(Math.pow((x1 - x2),2) + Math.pow((y1 - y2),2));

If the distance equals the sum of both radii, then the circles touch one another

if(d == r1 + r2){

System.out.print("The circles touch each other"); }

If the distance is greater than the sum of both radii, then the circles do not touch one another

else if(d > r1 + r2){

System.out.print("The circles do not touch each other"); }

If the distance is less than the sum of both radii, then the circles intersect

else{

System.out.print("The circles intersect"); }

}

6 0

2 years ago