Answer:
num
Explanation:
In java reserved words are also known as keywords, keywords are reserve words for a language that can't be used as an identifier(name of a class, name of a variable, name of an array etc.) int, public static, are reserve words.
In given question num is not a reserved word.
Answer:
oid changeCase (char char_array[], int array_size ) {
__asm{
mov eax, char_array;
mov edi, 0;
readArray:
cmp edi, array_size;
jge exit;
mov ebx, edi;
shl ebx, 2;
mov cl, [eax + ebx];
check:
//working on it
cmp cl, 0x41;
jl next_indx;
cmp cl, 0x7A;
jg next_indx;
cmp cl, 'a';
jl convert_down;
jge convert_up;
convert_down:
or cl, 0x20; //make it lowercase
jmp write;
convert_up:
and cl, 0x20;
jmp write;
write:
mov byte ptr [eax + ebx], cl
next_indx:
inc edi;
exit:
cmp edi, array_size;
jl readArray;
mov char_array, eax;
}
}
Explanation:
- Move char_array to eax as it is base image
.
- Use ebx as offset
.
- Use ecx as the storage register
.
- check if cl is <= than ASCII value 65 (A)
.
Answer:
1. Where,
2. From
Explanation:
In SQL query language when working on a database, a user can use certain clauses to carry out some functions.
Hence, The WHERE clause allows us to select only those rows in the result relation of the FROM clause that satisfy a specified predicate.
This is because the "Where clause" selects the rows on a particular condition. While the "From clause" gives the relation which involves the operation.
Answer:
function countWords(sentence) {
return sentence.match(/\S+/g).length;
}
const sentence = 'This sentence has five words ';
console.log(`"${sentence}" has ${countWords(sentence)} words` );
Explanation:
Regular expressions are a powerful way to tackle this. One obvious cornercase is that multiple spaces could occur. The regex doesn't care.
Answer:
False
Explanation:
The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.
The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:
- If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
- If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
- Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
- Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
- Repeat the above steps again till R = 0.
