Answer:
I probably won't awnser them all but I'll try my best
Explanation:
Hacking is a breach of privacy online usually caused by some kind of malware injected into your device there's multiple types of this program or files malware which simply damages and harms your device. A Trojan horse is a program which tricks you by selling you a fake product which has code in it which has code which gives the hacker remote access to your device this program is usually free and masked like a crack or patch of a certain program. U got the second an third question with this one so u can just divide it into pieces. Piracy is Hacking but this time the hacker is stealing ur information through the malware. Invasion of privacy can have multiple forms online and offline. Online intrusion is when a service gives out information you entrust to it while off line Intrusion is stalking trespassing blackmail etc.
Answer:
Computer output simply put is any data generated by the computer or feedback gotten from the computer. Output can take many forms, but there are 2 major categories:
- Soft copy output e.g text viewed on a computer screen
- Hard copy output e.g printouts
Explanation:
Answer:
names = ['Peter', 'Bruce', 'Steve', 'Tony', 'Natasha', 'Clint', 'Wanda', 'Hope', 'Danny', 'Carol']
numbers = [100, 50, 10, 1, 2, 7, 11, 17, 53, -8, -4, -9, -72, -64, -80]
for index, element in enumerate(names):
if index % 2 == 0:
print(element)
for num in numbers:
if num >= 0:
print(num, end = " ")
count = 0
for i in numbers:
count += i
avg = count/len(numbers)
print("sum = ", count)
print("average = ", avg)
for num in numbers:
if num % 2 != 0:
print(num, end = " ")
Explanation:
I'm stuck on the last two.. I have to do those too for an assignment.
Answer:
Explanation:
I have written the code in Java. It contains the class Insertion Sorter which has the InsertionSort function. This function uses the insertion sort algorithm to sort a comparable array and if it fails to do so for whatever reason it throws an Illegal ArgumentException. If it sorts the array correctly it returns the number of changes that needed to be made in order to correctly sort the array. Due to technical difficulties I have attached the code as a text document below and proof of output in the picture below as well.