## Read Dataset from excel file

0 likes • Oct 7, 2022 • 0 views
Python

## More Python Posts

#### return multiple values from a function

0 likes • Jun 1, 2023 • 0 views
Python
```def calculate_values():    value1 = 10    value2 = 20    return value1, value2
result1, result2 = calculate_values()print("Result 1:", result1)print("Result 2:", result2)```

#### Plotting Fibonacci

0 likes • Nov 19, 2022 • 0 views
Python
`# Python program for Plotting Fibonacci # spiral fractal using Turtle import turtle import math   def fiboPlot(n):     a = 0    b = 1    square_a = a     square_b = b       # Setting the colour of the plotting pen to blue     x.pencolor("blue")       # Drawing the first square     x.forward(b * factor)     x.left(90)     x.forward(b * factor)     x.left(90)     x.forward(b * factor)     x.left(90)     x.forward(b * factor)       # Proceeding in the Fibonacci Series     temp = square_b     square_b = square_b + square_a     square_a = temp           # Drawing the rest of the squares     for i in range(1, n):         x.backward(square_a * factor)         x.right(90)         x.forward(square_b * factor)         x.left(90)         x.forward(square_b * factor)         x.left(90)         x.forward(square_b * factor)           # Proceeding in the Fibonacci Series         temp = square_b         square_b = square_b + square_a         square_a = temp       # Bringing the pen to starting point of the spiral plot     x.penup()     x.setposition(factor, 0)     x.seth(0)     x.pendown()       # Setting the colour of the plotting pen to red     x.pencolor("red")       # Fibonacci Spiral Plot     x.left(90)     for i in range(n):         print(b)         fdwd = math.pi * b * factor / 2        fdwd /= 90        for j in range(90):             x.forward(fdwd)             x.left(1)         temp = a         a = b         b = temp + b     # Here 'factor' signifies the multiplicative  # factor which expands or shrinks the scale # of the plot by a certain factor. factor = 1  # Taking Input for the number of  # Iterations our Algorithm will run n = int(input('Enter the number of iterations (must be > 1): '))   # Plotting the Fibonacci Spiral Fractal  # and printing the corresponding Fibonacci Number if n > 0:     print("Fibonacci series for", n, "elements :")     x = turtle.Turtle()     x.speed(100)     fiboPlot(n)     turtle.done() else:     print("Number of iterations must be > 0")`

#### Sherlock Holmes Curious Lockbox Solver

0 likes • Mar 12, 2021 • 0 views
Python
`import copybegining = [False,False,False,False,False,None,True,True,True,True,True]#False = black True = whiteits = [0]def swap(layout, step):    layoutCopy = copy.deepcopy(layout)    layoutCopy[(step[0]+step[1])], layoutCopy[step[1]] = layoutCopy[step[1]], layoutCopy[(step[0]+step[1])]    return layoutCopydef isSolved(layout):    for i in range(len(layout)):        if(layout[i] == False):            return (i >= (len(layout)/2))def recurse(layout, its, steps = []):    if isSolved(layout):        its[0] += 1        print(layout,list(x[0] for x in steps))        return    step = None    for i in range(len(layout)):        if(layout[i] == None):            if(i >= 1): #If the empty space could have something to the left                if(layout[i - 1] == False):                    step = [-1,i]                    recurse(swap(layout,step), its, (steps+[step]))                if(i > 1): #If the empty space could have something 2 to the left                    if(layout[i - 2] == False):                        step = [-2,i]                        recurse(swap(layout,step), its, (steps+[step]))            if(i < (len(layout)-1)): #If the empty space could have something to the right                if(layout[i + 1] == True):                    step = [1,i]                    recurse(swap(layout,step), its, (steps+[step]))                if(i < (len(layout)-2)): #If the empty space could have something to the right                    if(layout[i + 2] == True):                        step = [2,i]                        recurse(swap(layout,step), its, (steps+[step]))    its[0] += 1    #return Nonerecurse(begining,its,[])print(its[0])`

#### Currency Converter

0 likes • Nov 19, 2022 • 0 views
Python
`""" Currency Converter----------------------------------------"""import urllib.requestimport jsondef currency_converter(currency_from, currency_to, currency_input):    yql_base_url = "https://query.yahooapis.com/v1/public/yql"    yql_query = 'select%20*%20from%20yahoo.finance.xchange%20where%20pair' \                '%20in%20("'+currency_from+currency_to+'")'    yql_query_url = yql_base_url + "?q=" + yql_query + "&format=json&env=store%3A%2F%2Fdatatables.org%2Falltableswithkeys"    try:        yql_response = urllib.request.urlopen(yql_query_url)        try:            json_string = str(yql_response.read())            json_string = json_string[2:            json_string = json_string[:-1]            print(json_string)            yql_json = json.loads(json_string)            last_rate = yql_json['query']['results']['rate']['Rate']            currency_output = currency_input * float(last_rate)            return currency_output        except (ValueError, KeyError, TypeError):            print(yql_query_url)            return "JSON format error"    except IOError as e:        print(str(e))currency_input = 1#currency codes : http://en.wikipedia.org/wiki/ISO_4217currency_from = "USD"currency_to = "TRY"rate = currency_converter(currency_from, currency_to, currency_input)print(rate)`

#### Propositional logic with itertools

0 likes • Nov 18, 2022 • 0 views
Python
```from itertools import productV='∀'E='∃'

def tt(f,n) :  xss=product((0,1),repeat=n)  print('function:',f.__name__)  for xs in xss : print(*xs,':',int(f(*xs)))  print('')
# p \/ (q /\ r) = (p \/ q) /\ (p \/ r)
def prob1(p,q,r) :  x=p or (q and r)  y= (p or q) and (p or r)  return x==y
tt(prob1,3)
# p/\(q\/r)=(p/\q)\/(p/\r)
def prob2(p,q,r) :  x=p and ( q or r )  y=(p and q) or (p and r)  return x==y
tt(prob2,3)
#~(p/\q)=(~p\/~q)
def prob3(p,q) :  x=not (p and q)  y=(not p) or (not q)  return x==ytt(prob3,2)
#(~(p\/q))=((~p)/\~q)
def prob4(p, q):   x = not(p or q)   y = not p and not q   return x == y
tt(prob4, 2)
#(p/\(p=>q)=>q)
def prob5(p,q):  x= p and ( not p or q)  return not x or q    tt(prob5,2)
# (p=>q)=((p\/q)=q)
def prob6(p,q) :  x = (not p or q)  y=((p or q) == q)  return x==y tt(prob6,2)

#((p=>q)=(p\/q))=qdef prob7(p,q):  if ((not p or q)==(p or q))==q:    return 1 tt(prob7,2)

#(p=>q)=((p/\q)=p)def prob8(p,q):  if (not p or q)==((p and q)==p):    return 1 tt(prob8,2)

#((p=>q)=(p/\q))=p
def prob9(p,q):  if ((not p or q)==(p and q))==p:    return '1'
tt(prob9,2)

#(p=>q)/\(q=>r)=>(p=>r)def prob10(p,q,r) :  x = not ((not p or q) and (not q or r)) or (not p or r)  return x tt(prob10, 3)

# (p = q) /\ (q => r)  => (p => r)#answer 1def prob11(p,q,r) :  x = not((p is q) and (not q or r)) or (not p or r)  return x tt(prob11, 3)
#(p=q)/\(q=>r)=>(p=>r)#answer 2def prob11(p,q,r):  x=(p==q) and (not q or r)  y=not p or r  return not x or y
tt(prob11,3)
#((p=>q)/\(q=r))=>(p=>r)
def prob12(p,q,r):  x=(not p or q) and ( q==r )  y=not p or r  return not x or y
tt(prob12,3)
#(p=>q)=>((p/\r)=>(q/\r))
def prob13(p,q,r):  x=not p or q  y=(not(p and r) or ( q and r))  return not x or y
tt(prob13,3)
#Question#2----------------------------------------
#(p=>q)=>r=p=>(q=>r)
def prob14(p,q,r):  x=(not(not p or q) or r)  y=(not p or (not q or r))  return x==y
tt(prob14,3)

def prob15(p, q):    x = not(p and q)    y = not p and not q    return x == y
tt(prob15, 2)

def prob16(p, q):    x = not(p or q)    y = not p or not q    return x == y
tt(prob16, 2)

def prob17(p):    x = p    y = not p    return x == y
tt(prob17, 1)```

#### Delete all even numbers

0 likes • Nov 19, 2022 • 0 views
Python
`# Deleting all even numbers from a lista = [1,2,3,4,5]del a[1::2]print(a)`