LECTURE 2

##x = 3 #Create variable x and assign value 3 to it

##x = x*x #Bind x to value 9
##print x
##y = raw_input('enter a number:')
##print type(y)
##print y
##y = float(raw_input('Enter a number: '))
##print type(y)
##print y
##print y*y
##
##x = int(raw_input('Enter an integer: '))
##if x%2 == 0:
## print 'Even'
##else:
## print 'Odd'
## if x%3 != 0:
## print 'And not divisible by 3'
##
##x = int(raw_input('Enter x: '))
##y = int(raw_input('Enter y: '))
##z = int(raw_input('Enter z: '))
##
##if x < y:
## if x < z:
## print 'x is least'
## else:
## print 'z is least'
##else:
## print 'y is least'
##
##if x < y:
## if x < z:
## print 'x is least'
## else:
## print 'z is least'
##elif y < z:
## print 'y is least'
##else:
## print 'z is least'
##
##if x < y and x < z:
## print 'x is least'
##elif y < z:
## print 'y is least'
##else:
## print 'z is least'
##
##
###Find the cube root of a perfect cube
##x = int(raw_input('Enter an integer: '))
##ans = 0
##while ans*ans*ans < abs(x):
## ans = ans + 1
## #print 'current guess =', ans
##if ans*ans*ans != abs(x):
## print x, 'is not a perfect cube'
##else:
## if x < 0:
## ans = -ans
## print 'Cube root of ' + str(x) + ' is ' + str(ans)
##
##
##
##
##

LECTURE 3

###Find the cube root of a perfect cube

##x = int(raw_input('Enter an integer: '))
##ans = 0
##while ans*ans*ans < abs(x):
## ans = ans + 1
## #print 'current guess =', ans
##if ans*ans*ans != abs(x):
## print x, 'is not a perfect cube'
##else:
## if x < 0:
## ans = -ans
## print 'Cube root of ' + str(x) + ' is ' + str(ans)

###Find the cube root of a perfect cube

##x = int(raw_input('Enter an integer: '))
##for ans in range(0, abs(x)+1):
## if ans**3 == abs(x):
## break
##if ans**3 != abs(x):
## print x, 'is not a perfect cube'
##else:
## if x < 0:
## ans = -ans
## print 'Cube root of ' + str(x) + ' is ' + str(ans)
##
##x = 25
##epsilon = 0.01
##numGuesses = 0
##ans = 0.0
##while abs(ans**2 - x) >= epsilon and ans <= x:
## ans += 0.00001
## numGuesses += 1
##print 'numGuesses =', numGuesses
##if abs(ans**2 - x) >= epsilon:
## print 'Failed on square root of', x
##else:
## print ans, 'is close to square root of', x
##
##x = 12345
##epsilon = 0.01
##numGuesses = 0
##low = 0.0
##high = x
##ans = (high + low)/2.0
##while abs(ans**2 - x) >= epsilon and ans <= x:
## #print low, high, ans
## numGuesses += 1
## if ans**2 < x:
## low = ans
## else:
## high = ans
## ans = (high + low)/2.0
###print 'numGuesses =', numGuesses
##print ans, 'is close to square root of', x

##def withinEpsilon(x, y, epsilon):

## """x, y, epsilon all ints or floats
## returns true if x is within epsilon of y"""
## return abs(x - y) <= epsilon
##
##if withinEpsilon(25, 26, 1):
## print 'yes'
##else:
## print 'no'
##
##if withinEpsilon(25, 26, 0.9):
## print 'yes'
##else:
## print 'no'

LECTURE 4

##x = 0.5
##epsilon = 0.01
##low = 0.0
##high = x
##ans = (high + low)/2.0
##while abs(ans**2 - x) >= epsilon and ans <= x:
## print 'ans =', ans, 'low =', low, 'high =', high
## if ans**2 < x:
## low = ans
## else:
## high = ans
## ans = (high + low)/2.0
##print ans, 'is close to square root of', x

##def withinEpsilon(x, y, epsilon):

## """x,y,epsilon ints or floats. epsilon > 0.0
## returns True if x is within epsilon of y"""
## return abs(x - y) <= epsilon

##print withinEpsilon(2,3,1)
##val = withinEpsilon(2,3,0.5)
##print val

##def f(x):
## x = x + 1
## print 'x =', x
## return x
##
##x = 3
##z = f(x)
##print 'z =', z
##print 'x =', x

##def f1(x):
## def g():
## x = 'abc'
## x = x + 1
## print 'x =', x
## g()
## assert False
## return x

##x = 3
##z = f1(x)

##def isEven(i):
## """assumes i a positive int
## returns True if i is even, otherwise False"""
## return i%2 == 0

##def findRoot(pwr, val, epsilon):

## """assumes pwr an int; val, epsilon floats
## pwr and epsilon > 0
## if it exists,
## returns a value within epsilon of val**pwr
## otherwise returns None"""
## assert type(pwr) == int and type(val) == float\
## and type(epsilon) == float
## assert pwr > 0 and epsilon > 0
## if isEven(pwr) and val < 0:
## return None
## low = -abs(val)
## high = max(abs(val), 1.0)
## ans = (high + low)/2.0
## while not withinEpsilon(ans**pwr, val, epsilon):
## #print 'ans =', ans, 'low =', low, 'high =', high
## if ans**pwr < val:
## low = ans
## else:
## high = ans
## ans = (high + low)/2.0
## return ans

##def testFindRoot():
## """x float, epsilon float, pwr positive int"""
## for x in (-1.0, 1.0, 3456.0):
## for pwr in (1, 2, 3):
## ans = findRoot(pwr, x, 0.001)
## if ans == None:
## print 'The answer is imaginary'
## else:
## print ans, 'to the power', pwr,\
## 'is close to', x

#testFindRoot()

##sumDigits = 0
##for c in str(1952):
## sumDigits += int(c)
##print sumDigits

##x = 100
##divisors = ()
##for i in range(1, x):
## if x%i == 0:
## divisors = divisors + (i,)
##
##print divisors
##print divisors[0] + divisors[1]
##print divisors[2:4]