Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
Answer:
cryptography
Explanation:
cryptography
In computer science, cryptography refers to secure information and communication techniques derived from mathematical concepts and a set of rule-based calculations called algorithms, to transform messages in ways that are hard to decipher
Answer:
good luck djfjjdndnfjfjjfjfdsadd
Answer:
1. Bits
2. Bitrate
3. The amount of time it takes for bits to travel from one place to another.
4. Used to send bits wirelessly.
5. Cables that carry light and dramatically increase the speed and accuracy of information over the internet.
6. 8
7. The number of bits per second a system can transmit.
Explanation:
hey lol
Answer:
see explaination for program code
Explanation:
scalar_product = 0
li=[]
li2=[]
#reading numbers1.txt and numbers2.txt intoli and li2 respectively
with open('numbers1.txt') as n1, open('numbers2.txt') as n2:
for line1 in n1:
li.append(int(line1))
for line2 in n2:
li2.append(int(line2))
#storing min list size into variable l
a=len(li)
b=len(li2)
if a<b:
l=a
else:
l=b
#calculating scalar product
for i in range(l):
scalar_product=scalar_product+li[i]*li2[i]
print("scalar product is",scalar_product)
