Answer:
See the picture attached
Explanation:
Which of the following is not true about search engine advertising?
1 answer:
You might be interested in
Answer:
Check the explanation
Explanation:
CODE:-
import java.util.*;
class UserName{
ArrayList<String> possibleNames;
UserName(String firstName, String lastName){
if(this.isValidName(firstName) && this.isValidName(lastName)){
possibleNames = new ArrayList<String>();
for(int i=1;i<firstName.length()+1;i++){
possibleNames.add(lastName+firstName.substring(0,i));
}
}else{
System.out.println("firstName and lastName must contain letters only.");
}
}
public boolean isUsed(String name, String[] arr){
for(int i=0;i<arr.length;i++){
if(name.equals(arr[i]))
return true;
}
return false;
}
public void setAvailableUserNames(String[] usedNames){
String[] names = new String[this.possibleNames.size()];
names = this.possibleNames.toArray(names);
for(int i=0;i<usedNames.length;i++){
if(isUsed(usedNames[i],names)){
int index = this.possibleNames.indexOf(usedNames[i]);
this.possibleNames.remove(index);
names = new String[this.possibleNames.size()];
names = this.possibleNames.toArray(names);
}
}
}
public boolean isValidName(String str){
if(str.length()==0) return false;
for(int i=0;i<str.length();i++){
if(str.charAt(i)<'a'||str.charAt(i)>'z' && (str.charAt(i)<'A' || str.charAt(i)>'Z'))
return false;
}
return true;
}
public static void main(String[] args) {
UserName person1 = new UserName("john","smith");
System.out.println(person1.possibleNames);
String[] used = {"harta","hartm","harty"};
UserName person2 = new UserName("mary","hart");
System.out.println("possibleNames before removing: "+person2.possibleNames);
person2.setAvailableUserNames(used);
System.out.println("possibleNames after removing: "+person2.possibleNames);
}
}
Kindly check the attached image below for the code output.
Using programming knowledge, it is possible to use programming logic, we can differentiate and find the terms
<h3>Writing the code and understanding the programming logic:</h3><em>.data</em>
<em>sourceword:</em>
<em>.word 0xAB</em>
<em>wordmask:</em>
<em>.word 0xCF</em>
<em>operand:</em>
<em>.long 0xAA</em>
<em>.text</em>
<em>.globl _start</em>
<em>_start:</em>
<em>movw sourceword, %ax # ax=0x00AB ( move the word value of sourceword =0x00AB to ax register.)</em>
<em>movw %ax, %bx # bx=0x00AB ( copy the value of ax to bx register.)</em>
<em>xorw %cx, %cx # cx=0000 ( cx=cx XOR cx, that is clear cx register.)</em>
<em />
<em>andw wordmask, %ax # ax=0x008B ( ax=ax AND wordmask= 0x00AB AND 0x00CF= 0x008B)</em>
<em>orw wordmask, %bx # bx=0x00EF (bx=bx OR wordmask= 0x00AB OR 0x00CF= 0x00EF.)</em>
<em>xorw wordmask, %cx # cx=0x00CF (cx=cx XOR wordmask= 0x0000 XOR 0x00CF=0x00CF.)</em>
<em />
<em>movl operand, %eax # eax=0x000000AA. ( copy the 32-bit value of operand=0x000000AA to eax.)</em>
<em>movl %eax, %ebx # ebx=0x000000AA.( copy the value of eax to ebx.)</em>
<em>movl %eax, %ecx # ecx=0x000000AA. ( copy the value of eax to ecx.)</em>
<em />
<em>shll $3,%eax # eax=0x00000550. ( logical shift left of eax=0x000000AA by 3 bits.)</em>
<em />
<em># 0x000000AA=00000000000000000000000010101010</em>
<em />
<em># =>00000000000000000000010101010000=0x00000550.</em>
<em />
<em>rorl $4,%ebx # ebx=0xA000000A. (Rotate right ebx=0x000000AA by 4 bits.)</em>
<em />
<em># 0x000000AA=00000000000000000000000010101010</em>
<em />
<em>3 =>10100000000000000000000000001010= 0xA000000A.</em>
<em />
<em>sarl %ecx # here the count value to shift the bits not mentioned.</em>
<em />
<em># It is the arithmetic shift right instruction. the shifted left bits filled with MSB bit.</em>
See more about logic program at brainly.com/question/14970713
#SPJ1
