Answer:
Option B and C are the correct answer for the above question
Explanation:
The above question asked about the work of the programmer to catch an error of the program--
- Then the option B states that the programmer needs to prints the value of the various program variable on every line of the program which is the correct solution because it is used to find the error easily. It defines the value of every variable in every place of the program and the programmer caught the error statement in the program if anywhere the variable gets the false value.
- The C option states to help from a friend, it is also a good solution because the friend can easily be caught the error of the program by seeing every line of code.
- But the other option is not correct because the option A states that the change the name of the variable which is not a result of anything.
- And the option D states that the code will be retyped again which is also not justify anything.
Answer:
OC
Explanation:
They were adapted from the Coleco company.
Body.
head contains all of the data that we generally don't see.
Link is used to link to external stylesheets.
script is where you would type scrips.
doctype is used to tell the browser the document type.
she should leave and go somewhere else for a mminute to cool and then come backa nd close tabs.
Answer:
Check the explanation
Explanation:
#!usr/bin/python
#FileName: sieve_once_again.py
#Python Version: 2.6.2
#Author: Rahul Raj
#Sat May 15 11:41:21 2010 IST
fi=0 #flag index for scaling with big numbers..
n=input('Prime Number(>2) Upto:')
s=range(3,n,2)
def next_non_zero():
"To find the first non zero element of the list s"
global fi,s
while True:
if s[fi]:return s[fi]
fi+=1
def sieve():
primelist=[2]
limit=(s[-1]-3)/2
largest=s[-1]
while True:
m=next_non_zero()
fi=s.index(m)
if m**2>largest:
primelist+=[prime for prime in s if prime] #appending rest of the non zero numbers
break
ind=(m*(m-1)/2)+s.index(m)
primelist.append(m)
while ind<=limit:
s[ind]=0
ind+=m
s[s.index(m)]=0
#print primelist
print 'Number of Primes upto %d: %d'%(n,len(primelist))
if __name__=='__main__':
sieve()
