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:
Answer:
Option c. you can be sure that a validated page will work correctly in a browser
Explanation:
A faulty HTML codes can result in various types of unexpected error when running the web page in different platforms or browsers. This will cause an inconsistent style or layout. HTML code validation can check if the code adopt the standard tag and structure. A validated HTML code can guarantee a web application running smoothly in different browsers and always present consistent web page layout to users. HTML code validation has become part of the standard workflow before a web page go live in internet.
Answer:
/*
Find Largest and Smallest Number in an Array Example
This Java Example shows how to find largest and smallest number in an
array.
*/
public class FindLargestSmallestNumber {
public static void main(String[] args) {
//array of 10 numbers
int numbers[] = new int[]{32,43,53,54,32,65,63,98,43,23};
//assign first element of an array to largest and smallest
int smallest = numbers[0];
int largetst = numbers[0];
for(int i=1; i< numbers.length; i++)
{
if(numbers[i] > largetst)
largetst = numbers[i];
else if (numbers[i] < smallest)
smallest = numbers[i];
}
System.out.println("Largest Number is : " + largetst);
System.out.println("Smallest Number is : " + smallest);
}
}
/*
Output of this program would be
Largest Number is : 98
Smallest Number is : 23
*/
Explanation:
