Merge sort has a o(n log2(n)) complexity. if a computer can sort 1,024 elements in an amount of time x, approximately how long w
1 answer:
You might be interested in
Answer:
<u>The total time elapsed from the time a bit is created (from the original analog signal at Host A) until the bit is decoded (as part of the analog signal at Host B is </u><u>25.11 ms</u>
Explanation:
Host A first converts the analog signal to a digital 64kbps stream and then groups it into 56-byte packets. The time taken for this can be calculated as:
time taken 1=
= (56 x 8) bits / 64 x 10³ bits/s
= 7 x 10⁻³s
time taken 1= 7 ms
The transmission rate of the packet from Host A to Host B is 4 Mbps. The time taken to transfer the packets can be calculated as:
time taken 2= (56 x 8) bits / 4 x 10⁶ bits/s
= 1.12 x 10⁻⁴ s
time taken 2= 112 μs
The propagation delay is 18 ms.
To calculate the total time elapsed, we need to add up all the time taken at each individual stage.
<u /><u> = Time taken 1 + Time taken 2 + Propagation Delay</u>
= 7 ms + 112 μs + 18 ms
= 0.025112 s
= 25.11 ms
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.
