The fundamental building block in every Hypertext Markup Language (HTML) document is the _____ tag, which marks a component in t
2 answers:
You might be interested in
Answer:
import string
dic = {}
book=open("book.txt","r")
# Iterate over each line in the book
for line in book.readlines():
tex = line
tex = tex.lower()
tex=tex.translate(str.maketrans('', '', string.punctuation))
new = tex.split()
for word in new:
if len(word) > 2:
if word not in dic.keys():
dic[word] = 1
else:
dic[word] = dic[word] + 1
for word in sorted(dic):
print(word, dic[word], '\n')
book.close()
Explanation:
The code above was written in python 3.
<em>import string </em>
Firstly, it is important to import all the modules that you will need. The string module was imported to allow us carry out special operations on strings.
<em>dic = {} </em>
<em>book=open("book.txt","r") </em>
<em> </em>
<em># Iterate over each line in the book</em>
<em>for line in book.readlines(): </em>
<em> </em>
<em> tex = line </em>
<em> tex = tex.lower() </em>
<em> tex=tex.translate(str.maketrans('', '', string.punctuation)) </em>
<em> new = tex.split() </em>
<em />
An empty dictionary is then created, a dictionary is needed to store both the word and the occurrences, with the word being the key and the occurrences being the value in a word : occurrence format.
Next, the file you want to read from is opened and then the code iterates over each line, punctuation and special characters are removed from the line and it is converted into a list of words that can be iterated over.
<em />
<em> </em><em>for word in new: </em>
<em> if len(word) > 2: </em>
<em> if word not in dic.keys(): </em>
<em> dic[word] = 1 </em>
<em> else: </em>
<em> dic[word] = dic[word] + 1 </em>
<em />
For every word in the new list, if the length of the word is greater than 2 and the word is not already in the dictionary, add the word to the dictionary and give it a value 1.
If the word is already in the dictionary increase the value by 1.
<em>for word in sorted(dic): </em>
<em> print(word, dic[word], '\n') </em>
<em>book.close()</em>
The dictionary is arranged alphabetically and with the keys(words) and printed out. Finally, the file is closed.
check attachment to see code in action.
Answer:
(a)Applications Time Stamp Events
(b)S=0.5(W-)+
, where
≤W≤
+8.
Explanation:
Some applications assume that clocks always advance, so they could timestamp events under this assumption.
In our case we have the wrong timed clock, say W and the hardware clock H which is supposed to advance at a perfect rate.
We proceed to construct a software clock such that after 8 seconds we can replace the wrong timed clock with the software clock in good conditions.
Let us denote the software clock with S.
Then, S=c(W-)+
where:
=The current Time(10:27:54) and;
c is to be found.
We already know that S=+4 when W=
+8,
So:
S=c(W-)+
+4=c(
+8-
)+
4=8c
c=0.5
We obtain the formula
S=0.5(W-)+
, where
≤W≤
+8.