Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #!/usr/bin/env python
- # -*- coding: utf-8 -*-
- # http://www.ling.gu.se/~lager/python_exercises.html
- # Wroten by mohamedAziz
- #-----------------------------------
- # ex 1
- def max(nb1, nb2) :
- if nb1 > nb2 :
- return nb1
- elif nb2 > nb1 :
- return nb2
- else: return nb1
- #print max(46, 80)
- #-----------------------------------
- # ex 2
- def max_of_three(nb1, nb2, nb3) :
- a = max(nb1, nb2)
- b = max(a, nb3)
- return max(a, b)
- #print(max_of_three(33, 46, 12))
- #-----------------------------------
- # ex 3
- def leng(s):
- count = 0
- for c in s:
- count += 1
- return count
- #print(leng(['mohamed', 'ali']))
- #-----------------------------------
- # ex 4
- def vowel(ch):
- if ch.upper() in ['A', 'E', 'I', 'O', 'U', 'Y'] :
- return True
- else:
- return False
- #print(vowel('A'))
- #-----------------------------------
- # ex 5
- # the definition of consonant -> http://en.wikipedia.org/wiki/Consonant
- # B, C, D, F, G, H, J, K, L, M, N, P, R, S, T, V, X, Z, and usually W and Y
- def translate(s):
- phrase = ''
- for ch in s :
- if ch.upper() in ['B', 'C', 'D', 'F', 'G', 'H', 'J',
- 'K', 'L', 'M', 'N', 'P', 'R', 'S', 'T', 'V', 'X', 'Z', 'W', 'Y'] :
- ch = ch + 'o' + ch
- phrase += ch
- return phrase
- #print(translate("this is fun"))
- #-----------------------------------
- # ex 6
- def sum(l):
- sm = 0
- for nb in l :
- sm += nb
- return sm
- def multiply(l):
- mu = 1
- for nb in l :
- mu *= nb
- return mu
- #print(sum([1, 2, 3, 4]))
- #print(multiply([1, 2, 3, 4]))
- #-----------------------------------
- # ex 7
- def reverse(s):
- reversed1 = ''
- for ch in s :
- reversed1 = ch + reversed1
- return reversed1
- #print(reverse('mohamed'))
- #-----------------------------------
- # ex 8
- def is_palindrome(s):
- if reverse(s) == s :
- return True
- else :
- return False
- #print(is_palindrome('radar'))
- #-----------------------------------
- # ex 9
- def is_member(x, a):
- rep = False
- for xx in a :
- if xx == x :
- rep = True
- if rep == True :
- return True
- else :
- return False
- #print(is_member(6, [4, 6, 8]))
- #-----------------------------------
- # ex 10
- def overlapping(l1, l2) :
- for x1 in l1 :
- if is_member(x1, l2) == True :
- return True; break
- else :
- return False
- #print(overlapping(['mohamed', 'aziz', 'ali'], ['omar', 'mohamed']))
- #-----------------------------------
- # ex 11
- def generate_n_chars(nb, x) :
- ret = ''
- for t in range(nb) :
- ret += x
- return ret
- #print(generate_n_chars(5, 'x'))
- #-----------------------------------
- # ex 12
- def histogram(l) :
- for h in l :
- print(generate_n_chars(h, '*'))
- #histogram([4, 9, 7])
- #-----------------------------------
- # ex 13
- def max_in_list(l) :
- maxi = l[0]
- for nb in l :
- if nb > maxi :
- maxi = nb
- return maxi
- #print(max_in_list([33, 12, 46]))
- #-----------------------------------
- # ex 14
- def word2integer(lw) :
- li = []
- for w in lw :
- li.append(leng(w))
- return li
- #print(word2integer(['mohamed', 'ali', 'omar']))
- #-----------------------------------
- # ex 15
- def find_longest_word(l) :
- maxi = leng(l[0])
- for w in l :
- if leng(w) > maxi :
- maxi = leng(w)
- return maxi
- #print(find_longest_word(['ali', 'omar', 'mohamed']))
- #-----------------------------------
- # ex 16
- def filter_long_words(lw, n) :
- lwn =[]
- for w in lw :
- if leng(w) > n :
- lwn.append(w)
- return lwn
- #print(filter_long_words(['ali', 'omar', 'mohamed'], 4))
- #-----------------------------------
- # ex 18
- # continuez a ecrire
- def pangram(se) :
- import string
- bb = ''
- maxi = ord[se[0].lower()]
- for x in se :
- if 97 <= ord(x.lower()) <= 122 :
- if maxi > ord(x.lower()):
- pass
- #-----------------------------------
- # ex 19
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement