Answer:
def remove_duplicates(lst):
no_duplicate = []
dup = []
for x in lst:
if x not in no_duplicate:
no_duplicate.append(x)
else:
dup.append(x)
for y in dup:
if y in no_duplicate:
no_duplicate.remove(y)
return no_duplicate
Explanation:
Create a function called remove_duplicates that takes one parameter, lst
Create two lists one for no duplicate elements and one for duplicate elements
Create for loop that iterates through the lst. If an element is reached for first time, put it to the no_duplicate. If it is reached more than once, put it to the dup.
When the first loop is done, create another for loop that iterates through the dup. If one element in no_duplicate is in the dup, that means it is a duplicate, remove that element from the no_duplicate.
When the second loop is done, return the no_duplicate
When a cache block has been modified since being read from main memory the dirty bit is set.
Answer:
C
Explanation:
I believe that's the answer if it's not sorry
C wifi A company is developing a smart TV that connects to a wireless home network. Which technology can best help to establish this connection?
Bluetooth
Infrared
C.
WI-FI
D
Internet of things
E
satellite
