Answer: Provided in the explanation section
Explanation:
The question says :
You are working on a documentation file userNotes.txt with some members of your software development team. Just before the file needs to be submitted, you manager tells you that a company standard requires that one blank space be left between the end-of-sentence period (.) and the start of the next sentence. (This rule does not affect sentences at the very end of a line.) For example, this is OK: Turn the knob. Push the "on" button. This is not: Turn the knob. Push the "on" button. Asking around among your team members, you discover that some of them have already typed their sentences in the approved manner, but others have inserted two or even more blanks between sentences. You need to fix this fast, and the first thing you want to do is to find out how bad the problem is. What command would you give to list all lines of userNotes.txt that contain sentence endings with two or more blanks before the start of the next sentence?
Solution:
Here, our fundamental aim is to look for the content which is having single space between different sentences. As it sentences finishing with . Going before with single and various spaces we have to channel and match just e the sentences which are finishing with ". "
For this we use order called "GREP" in Unix. "GREP " represents worldwide quest for standard articulation. This order is utilized inquiry and print the lines that are coordinating with determined string or an example. The example or indicated string that we have to look through we call it as customary articulation.
Syntax of GREP:
GREP [OPTIONS] PATTERN [FILE_NAME]
For our solution please follow the command
GREP "*\•\s$" userNotes.txt
Now it will display a all the lines having . Followed by single space.
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.
The four levels of organization incorporate official chiefs, program executives, improvement chiefs, and give essayists. The meaning of business organization is a program of study offered at colleges and schools that attention on business hypothesis, practices, and administration. A case of business organization is a class on the standards of bookkeeping.
Answer:
function validateForm(event)
{
event.preventDefault();
var phoneNumber = form.phoneNumber.value;
var userName = form.userName.value;
if(phoneNumber.length!=10)
console.log("Phone Number is Invalid");
if(userName.length<11)
console.log("User Name is Invalid");
}
Answer:
True
Explanation:
If s=abcd is a string defined over {a,b,c,d}, it corresponds to a regular expression which can be represented using a finite automata. Then the reverse of the string essentially corresponds to another finite automata where the starting state becomes the accepting state and vice versa.Moreover all the directions of state transitions will be reversed for each of the transitions in the original automata.
With these modifications, the new finite automata will accept a string which is reverse of the original string ,namely, dcba and this string will ne part of the reverse language.
