DICTIONARY & ITS FUNCTIONS EXPLAINED

- 
# dictionary is nothing but key value is pairs
# d1 = {}
# print(type(d1))
# d2 = {"santosh" : "roti", "amit" : "mutton", "roshan" : "chawal", "balveer" : {"L" : "machchi", "d" : "murga", }}
# d2["aslam"] = "biryani"
# del d2["aslam"]
# print(d2)
# d3 = d2.copy()
# del d3["roshan"]
# d2.update({"leena": "toffee"})
# print(d2.keys())
# print(d2.values())
#
# dc = {"mutable": "Which can be change",
#       "immutable": "Which cannot be changed",
#       "tuple": "A function which cannot be changed",
#       "list": "A function which can be changed",
#       "help": "kisi ki madad karna",
#        "suggest" : "sujhav dena"}
# n1 = input("Enter your word\n")
# print("your words meaning is : " + dc[n1])

# dictio = {'dictionary':'this is a data type','python':'this is a programming language',
#           'santosh':'he is a boy','gupta':'it is a surname'}
# word = input("Enter The Word\n")
# print("definition is : " + dictio[word])


# set
# s = set()
# s1 = [1, 2 , 3 , 4 , 5 , 6]
# s_from_list = set(s1)
# print(s_from_list)
# s.add(2)
# s.add(4)
# s1 = {1,2,3,4}
# print(s.isdisjoint(s1))

Comments

Post a Comment

Popular posts from this blog

MAP FILTER AND REDUCE FUNCTION IN PYTHON

-
  numbers = [ "3" , "34" , "64" ] numbers = list ( map ( int , numbers)) for i in range ( len (numbers)): numbers[i] = int (numbers[i]) numbers[ 2 ] = numbers[ 2 ] + 1 print (numbers[ 2 ]) def sq (a): return a*a num =[ 2 , 5 , 6 , 7 , 9 , 6 , 4 , 3 ] square = list ( map (sq, num)) print (square) num =[ 2 , 5 , 6 , 7 , 9 , 6 , 4 , 3 ] square = list ( map ( lambda x: x*x, num)) print (square) def square (a): return a*a def cube (a): return a*a*a func = [square,cube] for i in range ( 6 ): val = list ( map ( lambda x:x(i), func)) print (val) ################################### FILTER #################################### list_1 = [ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 ] def is_greater_4 (num): return num> 4 gr_than_5 = list ( filter (is_greater_4, list_1)) print (gr_than_5) ################################### REDUCE ################################# from functools import reduce list1 = [ 1 , 2 , 3 , 4 , 5 ] num = reduce( lambda x,y:x...
Read more

Writing Appending to a File

-
# f is better to say file handle which open() return # instead saying it pointer but commonly f also known as file pointer # Opening file in write,text mode # Only 'w' mentioned below because t-text mode is by default # So 'w' is same as 'wt' # IF file "26. Tutorial.txt" not exist then it will create that. # If alrady exist then it will replace all the content with what we will write in the file # f = open("26. Tutorial1.txt", "w") # f.write("Rural Development Party - A party that contests only gram panchayat elections and has the vision to make World Class Villages with limited resources.\n") # f.close() # If we again do f.write on same file it just replace content # but in most cases we want to append the content in the file at end # for that open file in append mode -'a' # f = open("26. Tutorial1.txt", "a") # due to newline character "\n" at the last of previous write # this content...
Read more

Recursions: Recursive Vs Iterative Approach

-
# n! = n * n-1 * n-2 * n-3.......1 # n! = n * (n-1)! def factorial_iterative (n): """ :param n: Integer :return: n * n-1 * n-2 * n-3.......1 """ fac = 1 for i in range (n): fac = fac * (i + 1 ) return fac # def factorial_recursive (n): """ :param n: Integer :return: n * n-1 * n-2 * n-3.......1 """ if n == 1 : return 1 else : return n * factorial_recursive(n - 1 ) # 5 * factorial_recursive(4) # 5 * 4 * factorial_recursive(3) # 5 * 4 * 3 * factorial_recursive(2) # 5 * 4 * 3 * 2 * factorial_recursive(1) # 5 * 4 * 3 * 2 * 1 = 120 # 0 1 1 2 3 5 8 13 def fibonacci (n): if n == 1 : return 0 elif n == 2 : return 1 else : return fibonacci(n - 1 ) + fibonacci(n - 2 ) number = int ( input ( "Enter then number \n " )) # print("Factorial Using Iterative Method", factorial_it...
Read more