3 years ago

HOW TO FREE UP RAM/MEMORY ON YOUR DEVICE?

2 answers:

7 0

Well you can start by getting a app called CM Security Master....it frees junk files and stops viruses, etc.. If you want execive space get a SanDisk (SD) card with how ever much space you want.

Serjik [45]3 years ago

6 0

Answer:

Put it on a hard drive

Explanation:

You might be interested in

What is the limitation of computer<br>

eimsori [14]

The limitation of computer are:

No self-intelligence
No feeling
No learning power
Dependency

3 0

3 years ago

Write a function named initialMatch that takes a string parameter, text, that contains only lowercase letters and whitespace. Th

Furkat [3]

Answer:

Implementing on Python for the question, the following is the code.

Explanation:

def intialMatch(l):

word_dict={}

for word in l.split():

if word_dict.get(word)==None:

word_dict[word]=[]

for key in word_dict.keys():

if key[0]==word[0] and (word is not key) :

values = word_dict.get(key)

if word not in values:

values.append(word)

for key,values in word_dict.items():

for value in values:

if value==key:values.remove(value)

return word_dict

t='do what you can with what you have'

print(intialMatch(t))

6 0

3 years ago

7.5 code practice please I can't get a 100 on it helpppp :/

Shtirlitz [24]

Answer:

100-7.5=92.5

Explanation:

6 0

3 years ago

Read 2 more answers

Which option identifies what the computer will yield in the following scenario?

dolphi86 [110]

I think it would be the computer program will create a design with the exact dimensions

6 0

2 years ago

Consider two vectors that are NOT sorted, each containing n comparable items. How long would it take to display all items (in an

Darina [25.2K]

Answer:

The correct answer to the following question will be "Θ(n2)

". The further explanation is given below.

Explanation:

If we're to show all the objects that exist from either the first as well as the second vector, though not all of them, so we'll have to cycle around the first vector, so we'll have to match all the objects with the second one.

So,

This one takes:

= $O(n^2)$

And then the same manner compared again first with the second one, this takes.

= $O(n^2)$

Therefore the total complexity,

= Θ(n2)

7 0

3 years ago