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:
These were later renamed to "Specialized Technology" and "Simscape Components" to help explain this difference.
Specialized Technology (Second Generation) is a Simulink based library and has been around for longer. It can still connect to Simscape, but in the same way you can connect Simulink models to Simscape -- that is, you need converters and sometimes to break algebraic loops, etc. It also has more dedicated electrical power systems capabilities. If your model will be only power systems, and especially if it's a larger model, I'd recommend this one.
Simscape Components (Third Generation) is built using the Simscape language and therefore connects directly with other Simscape blocks. If you plan to use other Simscape domains like mechanical, hydraulic, etc. I'd recommend this one.
Answer:
hope this helps and do consider giving a brainliest to the ans if it helped.
Explanation:
//program to check if the entered grid is magic square or not
/**c++ standard libraries
*/
#include<bits/stdc++.h>
using namespace std;
/**function to check whether the entered grid is magic square or not
*/
int isMagicSquare(int arr[3][3]){
int i,j,sum=0,sum1=0,rsum,csum;
for(i=0;i<3;i++){
sum+=arr[i][i];
sum1+=arr[i][2-i];
}
if(sum!=sum1){
return 0;
}
for(i=0;i<3;i++){
rsum=0;
csum=0;
for(j=0;j<3;j++){
rsum+=arr[i][j];
csum+=arr[j][i];
}
if(sum!=rsum){
return 0;
}
if(sum!=csum){
return 0;
}
}
return 1;
}
/** main function to get user entries and
* call function
* and print output
*/
int main(){
int i,j,arr[3][3]={0};
for(i=0;i<3;i++){
for(j=0;j<3;j++){
cout<<"Enter the number for row "<<i<<" and column "<<j<<" : ";
cin>>arr[i][j];
}
}
int ret = isMagicSquare(arr);
if(ret==1){
cout<<"This is a Lo Shu magic square"<<endl;
}
else{
cout<<"This is not a Lo Shu magic square"<<endl;
}
return 0;
}
Answer:
retupmoc
Explanation:
1.) Anwser will be retupmoc
because
public static String mysteryString(String s){
if(s.length() == 1){
return s;
}
else{
return s.substring(s.length() -1) + mysteryString(s.substring(0, s.length()-1));
}
}
In this program input is "computer" . So the function mysteryString(String s) it does
return s.substring(s.length() -1) + mysteryString(s.substring(0, s.length()-1));
so when it enters the first time ??s.substring(s.length() -1) and it will be give you 'r' then it calls the function recursively by reducing the string length by one . So next time it calls the mysteryString function with string "compute" and next time it calls return s.substring(s.length()-1)? + mysteryString(s.substring(0,s.length-1)) so this time it gives "e" and calls the function again recursively . It keeps on doing till it matched the base case.
so it returns "retupmoc".
