Answer:
a. grep 'b[au]nk$' myLine
Explanation:
grep is a command used for searching a specified pattern in a given text.
Our goal is to match the character sequence - bank or bunk at the end of line in a given line referenced by myLine.
The regular expression for the specified match criterion is:
b[au]nk$
The second character can be either a or u.
$ indicates match at end of line.
So the overall grep command is :
grep 'b[au]nk$' myLine
Answer: True
Explanation:
Yes, the given statement is true that the RFID tags are basically used in the secure system because it is impossible to counterfeit.
RFID basically stand for the radio frequency identification that provide a method to retrieve the data or information quickly from the system. It basically used as radio wave technology in which we can easily track the objects and people by using proper programmed data.
The tag is basically placed in the object for unique identification. There are basically two types of tags in the RFID that is active and passive.
/*
Since we have to check the first two options only as mentioned in last part of question the loop will work 2 times only and will compare the cost of first element and second and assign the healthoption accordingly
*/
for(int i =0;i<=1;i++){
if(annualCost[i]<annualCost[i+1]
best2 = healthOption[i]
else
best2 = healthOption[i+1]
}
Answer:
A
Explanation:
The most likely cause of the problem is that You signed in to BIOS/UEFI with the user power-on password rather than the supervisor power-on password. The User password only enables the machine to boot while the supervisor password allows entering the BIOS settings.
Answer:
Let's convert the decimals into signed 8-bit binary numbers.
As we need to find the 8-bit magnitude, so write the powers at each bit.
<u>Sign -bit</u> <u>64</u> <u>32</u> <u>16</u> <u>8</u> <u>4</u> <u>2</u> <u>1</u>
+25 - 0 0 0 1 1 0 0 1
+120- 0 1 1 1 1 0 0 0
+82 - 0 1 0 1 0 0 1 0
-42 - 1 0 1 0 1 0 1 0
-111 - 1 1 1 0 1 1 1 1
One’s Complements:
+25 (00011001) – 11100110
+120(01111000) - 10000111
+82(01010010) - 10101101
-42(10101010) - 01010101
-111(11101111)- 00010000
Two’s Complements:
+25 (00011001) – 11100110+1 = 11100111
+120(01111000) – 10000111+1 = 10001000
+82(01010010) – 10101101+1= 10101110
-42(10101010) – 01010101+1= 01010110
-111(11101111)- 00010000+1= 00010001
Explanation:
To find the 8-bit signed magnitude follow this process:
For +120
- put 0 at Sign-bit as there is plus sign before 120.
- Put 1 at the largest power of 2 near to 120 and less than 120, so put 1 at 64.
- Subtract 64 from 120, i.e. 120-64 = 56.
- Then put 1 at 32, as it is the nearest power of 2 of 56. Then 56-32=24.
- Then put 1 at 16 and 24-16 = 8.
- Now put 1 at 8. 8-8 = 0, so put 0 at all rest places.
To find one’s complement of a number 00011001, find 11111111 – 00011001 or put 0 in place each 1 and 1 in place of each 0., i.e., 11100110.
Now to find Two’s complement of a number, just do binary addition of the number with 1.
