All categories

3 years ago

Are mobile phones hazardous to your health?

Computers and Technology

2 answers:

Digiron [165]3 years ago

6 0

Explanation:

they can be. they can strain your eyes if you look at them too long with no breaks, for one thing

anzhelika [568]3 years ago

3 0

Answer:It’s all in moderation of use usage on an hourly daily base can lead to anxiety issues when separated and also regardless of usage sleeping with it near your head is very dangerous in long term causing radiation

Explanation:

You might be interested in

Write a generator function named count_seq that doesn't take any parameters and generates a sequence that starts like this: 2, 1

-BARSIC- [3]

Answer:

#required generator function

def count_seq():

#starting with number 2. using string instead of integers for easy manipulation

n='2'

#looping indefinitely

while True:

#yielding the integer value of current n

yield int(n)

#initializing an empty string

next_value=''

#looping until n is an empty string

while len(n)>0:

#extracting first digit (as char)

first=n[0]

#consecutive count of this digit

count=0

#looping as long as n is non empty and first digit of n is same as first

while len(n)>0 and n[0]==first:

#incrementing count

count+=1

#removing first digit from n

n=n[1:]

#now appending count and first digit to next_value

next_value+='{}{}'.format(count,first)

#replacing n with next_value

n=next_value

#testing, remove if you don't need this

if __name__ == '__main__':

#creating a generator from count_seq()

gen=count_seq()

#looping for 10 times, printing next value

for i in range(10):

print(next(gen))

Explanation:

6 0

3 years ago

A job placement agency helps match job seekers with potential employers. The agency would like to design a simulation in order t

storchak [24]

Answer:C

Explanation:

The answer is C

6 0

3 years ago

Determine and prove whether an argument in English is valid or invalid. About Prove whether each argument is valid or invalid. F

yawa3891 [41]

Answer:

Each understudy on the respect roll got an A.

No understudy who got a confinement got an A.

No understudy who got a confinement is on the respect roll.

No understudy who got an A missed class.

No understudy who got a confinement got an A.

No understudy who got a confinement missed class

Explanation:

M(x): x missed class

An (x): x got an A.

D(x): x got a confinement.

¬∃x (A(x) ∧ M(x))

¬∃x (D(x) ∧ A(x))

∴ ¬∃x (D(x) ∧ M(x))

The conflict isn't considerable. Consider a class that includes a lone understudy named Frank. If M(Frank) = D(Frank) = T and A(Frank) = F, by then the hypotheses are overall evident and the end is counterfeit. Toward the day's end, Frank got a control, missed class, and didn't get an A.

Each understudy who missed class got a confinement.

Penelope is an understudy in the class.

Penelope got a confinement.

Penelope missed class.

M(x): x missed class

S(x): x is an understudy in the class.

D(x): x got a confinement.

Each understudy who missed class got a confinement.

Penelope is an understudy in the class.

Penelope didn't miss class.

Penelope didn't get imprisonment.

M(x): x missed class

S(x): x is an understudy in the class.

D(x): x got imprisonment.

Each understudy who missed class or got imprisonment didn't get an A.

Penelope is an understudy in the class.

Penelope got an A.

Penelope didn't get repression.

M(x): x missed class

S(x): x is an understudy in the class.

D(x): x got a repression.

An (ax): x got an A.

H(x): x is on the regard roll

An (x): x got an A.

D(x): x got a repression.

∀x (H(x) → A(x)) a

¬∃x (D(x) ∧ A(x))

∴ ¬∃x (D(x) ∧ H(x))

Real.

1. ∀x (H(x) → A(x)) Hypothesis

2. c is a self-self-assured element Element definition

3. H(c) → A(c) Universal dispatch, 1, 2

4. ¬∃x (D(x) ∧ A(x)) Hypothesis

5. ∀x ¬(D(x) ∧ A(x)) De Morgan's law, 4

6. ¬(D(c) ∧ A(c)) Universal dispatch, 2, 5

7. ¬D(c) ∨ ¬A(c) De Morgan's law, 6

8. ¬A(c) ∨ ¬D(c) Commutative law, 7

9. ¬H(c) ∨ A(c) Conditional character, 3

10. A(c) ∨ ¬H(c) Commutative law, 9

11. ¬D(c) ∨ ¬H(c) Resolution, 8, 10

12. ¬(D(c) ∧ H(c)) De Morgan's law, 11

13. ∀x ¬(D(x) ∧ H(x)) Universal hypothesis, 2, 12

14. ¬∃x (D(x) ∧ H(x)) De Morgan's law, 13

4 0

3 years ago

Martha is developing a software program in C++ and has a question about how to implement a particular feature. She performs an o

VLD [36.1K]

Answer:

A blog

Explanation:

A blog is a regularly updated website or web page, typically one run by an individual or small group, that is organised by posts.

7 0

3 years ago

let's imagine you're searching for hotels in searching chicago, what should you search for in order to get the most relevant res

n200080 [17]

Trivago, Trip advisor,

3 0

3 years ago