trainity-data-analyst-python-master-class-3.ipynb

{"metadata":{"kernelspec":{"language":"python","display_name":"Python 3","name":"python3"},"language_info":{"name":"python","version":"3.10.13","mimetype":"text/x-python","codemirror_mode":{"name":"ipython","version":3},"pygments_lexer":"ipython3","nbconvert_exporter":"python","file_extension":".py"}},"nbformat_minor":4,"nbformat":4,"cells":[{"cell_type":"markdown","source":"# Data Structures and Control Flow Statements","metadata":{"_uuid":"8f2839f25d086af736a60e9eeb907d3b93b6e0e5","_cell_guid":"b1076dfc-b9ad-4769-8c92-a6c4dae69d19"}},{"cell_type":"markdown","source":"## Dictionaries --> Key - Value Pairs\n### They are Unordered, Unique and Mutable","metadata":{}},{"cell_type":"code","source":"student_dict = {122 : 'Advait', 121:'Aniket' , 123 : 'Max', 124 : 'Joe'}","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:36:10.988159Z","iopub.execute_input":"2024-06-10T13:36:10.988611Z","iopub.status.idle":"2024-06-10T13:36:10.994872Z","shell.execute_reply.started":"2024-06-10T13:36:10.988578Z","shell.execute_reply":"2024-06-10T13:36:10.993527Z"},"trusted":true},"execution_count":4,"outputs":[]},{"cell_type":"code","source":"type(student_dict)","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:36:15.688239Z","iopub.execute_input":"2024-06-10T13:36:15.688675Z","iopub.status.idle":"2024-06-10T13:36:15.697322Z","shell.execute_reply.started":"2024-06-10T13:36:15.688641Z","shell.execute_reply":"2024-06-10T13:36:15.695874Z"},"trusted":true},"execution_count":5,"outputs":[{"execution_count":5,"output_type":"execute_result","data":{"text/plain":"dict"},"metadata":{}}]},{"cell_type":"code","source":"student_dict","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:36:17.488394Z","iopub.execute_input":"2024-06-10T13:36:17.488888Z","iopub.status.idle":"2024-06-10T13:36:17.497503Z","shell.execute_reply.started":"2024-06-10T13:36:17.488851Z","shell.execute_reply":"2024-06-10T13:36:17.496108Z"},"trusted":true},"execution_count":6,"outputs":[{"execution_count":6,"output_type":"execute_result","data":{"text/plain":"{122: 'Advait', 121: 'Aniket', 123: 'Max', 124: 'Joe'}"},"metadata":{}}]},{"cell_type":"code","source":"student_dict[122]","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:37:14.081581Z","iopub.execute_input":"2024-06-10T13:37:14.083208Z","iopub.status.idle":"2024-06-10T13:37:14.092507Z","shell.execute_reply.started":"2024-06-10T13:37:14.083153Z","shell.execute_reply":"2024-06-10T13:37:14.090921Z"},"trusted":true},"execution_count":7,"outputs":[{"execution_count":7,"output_type":"execute_result","data":{"text/plain":"'Advait'"},"metadata":{}}]},{"cell_type":"code","source":"student_dict.update({125 : 'Bush'})","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:38:15.068114Z","iopub.execute_input":"2024-06-10T13:38:15.068592Z","iopub.status.idle":"2024-06-10T13:38:15.074697Z","shell.execute_reply.started":"2024-06-10T13:38:15.068557Z","shell.execute_reply":"2024-06-10T13:38:15.073404Z"},"trusted":true},"execution_count":10,"outputs":[]},{"cell_type":"code","source":"student_dict","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:38:21.743156Z","iopub.execute_input":"2024-06-10T13:38:21.744562Z","iopub.status.idle":"2024-06-10T13:38:21.752363Z","shell.execute_reply.started":"2024-06-10T13:38:21.744493Z","shell.execute_reply":"2024-06-10T13:38:21.750866Z"},"trusted":true},"execution_count":11,"outputs":[{"execution_count":11,"output_type":"execute_result","data":{"text/plain":"{122: 'Advait', 121: 'Aniket', 123: 'Max', 124: 'Joe', 125: 'Bush'}"},"metadata":{}}]},{"cell_type":"code","source":"del(student_dict[123])","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:38:39.781105Z","iopub.execute_input":"2024-06-10T13:38:39.782539Z","iopub.status.idle":"2024-06-10T13:38:39.788159Z","shell.execute_reply.started":"2024-06-10T13:38:39.782482Z","shell.execute_reply":"2024-06-10T13:38:39.786784Z"},"trusted":true},"execution_count":12,"outputs":[]},{"cell_type":"code","source":"student_dict","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:38:53.260627Z","iopub.execute_input":"2024-06-10T13:38:53.261046Z","iopub.status.idle":"2024-06-10T13:38:53.271097Z","shell.execute_reply.started":"2024-06-10T13:38:53.261015Z","shell.execute_reply":"2024-06-10T13:38:53.269602Z"},"trusted":true},"execution_count":13,"outputs":[{"execution_count":13,"output_type":"execute_result","data":{"text/plain":"{122: 'Advait', 121: 'Aniket', 124: 'Joe', 125: 'Bush'}"},"metadata":{}}]},{"cell_type":"markdown","source":"## Sets --> Unordered collections of unique elements\n#### Types -> union, intersection, difference, symmetric difference","metadata":{}},{"cell_type":"code","source":"set_a = {2,4,6,8,10,12,12,14,16,16,18,20,20}","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:43:38.405315Z","iopub.execute_input":"2024-06-10T13:43:38.405847Z","iopub.status.idle":"2024-06-10T13:43:38.412970Z","shell.execute_reply.started":"2024-06-10T13:43:38.405811Z","shell.execute_reply":"2024-06-10T13:43:38.411450Z"},"trusted":true},"execution_count":14,"outputs":[]},{"cell_type":"code","source":"set_a","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:43:42.692777Z","iopub.execute_input":"2024-06-10T13:43:42.693291Z","iopub.status.idle":"2024-06-10T13:43:42.702799Z","shell.execute_reply.started":"2024-06-10T13:43:42.693233Z","shell.execute_reply":"2024-06-10T13:43:42.700884Z"},"trusted":true},"execution_count":15,"outputs":[{"execution_count":15,"output_type":"execute_result","data":{"text/plain":"{2, 4, 6, 8, 10, 12, 14, 16, 18, 20}"},"metadata":{}}]},{"cell_type":"code","source":"set_b = {3,6,9,12,15,18,21}","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:44:21.712485Z","iopub.execute_input":"2024-06-10T13:44:21.712931Z","iopub.status.idle":"2024-06-10T13:44:21.719824Z","shell.execute_reply.started":"2024-06-10T13:44:21.712898Z","shell.execute_reply":"2024-06-10T13:44:21.718331Z"},"trusted":true},"execution_count":16,"outputs":[]},{"cell_type":"code","source":"set_a.union(set_b)","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:44:44.184606Z","iopub.execute_input":"2024-06-10T13:44:44.185058Z","iopub.status.idle":"2024-06-10T13:44:44.193608Z","shell.execute_reply.started":"2024-06-10T13:44:44.185027Z","shell.execute_reply":"2024-06-10T13:44:44.192243Z"},"trusted":true},"execution_count":17,"outputs":[{"execution_count":17,"output_type":"execute_result","data":{"text/plain":"{2, 3, 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21}"},"metadata":{}}]},{"cell_type":"code","source":"set_a.intersection(set_b)","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:44:52.861109Z","iopub.execute_input":"2024-06-10T13:44:52.862084Z","iopub.status.idle":"2024-06-10T13:44:52.869611Z","shell.execute_reply.started":"2024-06-10T13:44:52.862041Z","shell.execute_reply":"2024-06-10T13:44:52.868346Z"},"trusted":true},"execution_count":18,"outputs":[{"execution_count":18,"output_type":"execute_result","data":{"text/plain":"{6, 12, 18}"},"metadata":{}}]},{"cell_type":"code","source":"# Elements of set A not present in set B\nset_a.difference(set_b)","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:45:05.040628Z","iopub.execute_input":"2024-06-10T13:45:05.041127Z","iopub.status.idle":"2024-06-10T13:45:05.051631Z","shell.execute_reply.started":"2024-06-10T13:45:05.041086Z","shell.execute_reply":"2024-06-10T13:45:05.050362Z"},"trusted":true},"execution_count":19,"outputs":[{"execution_count":19,"output_type":"execute_result","data":{"text/plain":"{2, 4, 8, 10, 14, 16, 20}"},"metadata":{}}]},{"cell_type":"code","source":"# All elements from Union expect the elements from Intersection\nset_a.symmetric_difference(set_b)","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:45:16.272541Z","iopub.execute_input":"2024-06-10T13:45:16.272955Z","iopub.status.idle":"2024-06-10T13:45:16.281107Z","shell.execute_reply.started":"2024-06-10T13:45:16.272925Z","shell.execute_reply":"2024-06-10T13:45:16.279768Z"},"trusted":true},"execution_count":20,"outputs":[{"execution_count":20,"output_type":"execute_result","data":{"text/plain":"{2, 3, 4, 8, 9, 10, 14, 15, 16, 20, 21}"},"metadata":{}}]},{"cell_type":"code","source":"set_a.update([22,24,26,28,30])","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:47:10.839343Z","iopub.execute_input":"2024-06-10T13:47:10.839835Z","iopub.status.idle":"2024-06-10T13:47:10.846460Z","shell.execute_reply.started":"2024-06-10T13:47:10.839798Z","shell.execute_reply":"2024-06-10T13:47:10.844784Z"},"trusted":true},"execution_count":22,"outputs":[]},{"cell_type":"code","source":"set_a","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:47:16.078639Z","iopub.execute_input":"2024-06-10T13:47:16.079178Z","iopub.status.idle":"2024-06-10T13:47:16.091179Z","shell.execute_reply.started":"2024-06-10T13:47:16.079138Z","shell.execute_reply":"2024-06-10T13:47:16.089450Z"},"trusted":true},"execution_count":23,"outputs":[{"execution_count":23,"output_type":"execute_result","data":{"text/plain":"{2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30}"},"metadata":{}}]},{"cell_type":"markdown","source":"# Control Flow Statements --> control the order of execution or statements within a program\n\n### Types: -\n### 1. Sequential Control Flow(Line by Line)\n### 2. Selection Control Flow (if, if-else, nested if else, if-elif-else)\n### 3. Loop Control Flow (for loop, while loop)","metadata":{}},{"cell_type":"markdown","source":"### I. Conditional Flow Statements","metadata":{}},{"cell_type":"code","source":"# Taking input from user. Output whether the number is even or odd\ndef even_odd_user():\n    var = (int(input(\"Enter any Whole number(Number without Decimal points/Integer Number) :\")))\n    if var%2 == 0:\n        print(\"The entered number \",var,\" is an Even number\")\n    else: \n        print(\"The entered number \",var,\" is an Odd number\")","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:58:19.716089Z","iopub.execute_input":"2024-06-10T13:58:19.717119Z","iopub.status.idle":"2024-06-10T13:58:19.724010Z","shell.execute_reply.started":"2024-06-10T13:58:19.717083Z","shell.execute_reply":"2024-06-10T13:58:19.722461Z"},"trusted":true},"execution_count":34,"outputs":[]},{"cell_type":"code","source":"even_odd_user()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:58:21.951730Z","iopub.execute_input":"2024-06-10T13:58:21.952183Z","iopub.status.idle":"2024-06-10T13:58:23.631561Z","shell.execute_reply.started":"2024-06-10T13:58:21.952149Z","shell.execute_reply":"2024-06-10T13:58:23.630187Z"},"trusted":true},"execution_count":35,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter any Whole number(Number without Decimal points/Integer Number) : 369\n"},{"name":"stdout","text":"The entered number  369  is an Odd number\n","output_type":"stream"}]},{"cell_type":"code","source":"even_odd_user()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T13:58:27.943783Z","iopub.execute_input":"2024-06-10T13:58:27.944244Z","iopub.status.idle":"2024-06-10T13:58:34.078467Z","shell.execute_reply.started":"2024-06-10T13:58:27.944211Z","shell.execute_reply":"2024-06-10T13:58:34.077018Z"},"trusted":true},"execution_count":36,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter any Whole number(Number without Decimal points/Integer Number) : 99856\n"},{"name":"stdout","text":"The entered number  99856  is an Even number\n","output_type":"stream"}]},{"cell_type":"code","source":"# Input from user. If length of name is less tham 5 then print enter full name\n# If first character of the name is A then print the name begins with A\n# If name contains a comma, thne print No special conditions allowed\n# print name if above conditions are not satisfied\ndef user_name():\n    name = input(\"Enter your name: \")\n    if (len(name) < 5):\n        print(\"The lenght of your entered\",name,\"name is less than 5. Please enter Full name and try again!!\")\n    elif (name[0] == 'A'):\n        print(\"The entered name\",name,\" starts with character A\")\n    elif (name.find(',') != -1):\n        print(\"No Special Characters allowed in name\")\n    else:\n        print(name)","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:05:26.190066Z","iopub.execute_input":"2024-06-10T14:05:26.190637Z","iopub.status.idle":"2024-06-10T14:05:26.200076Z","shell.execute_reply.started":"2024-06-10T14:05:26.190599Z","shell.execute_reply":"2024-06-10T14:05:26.198221Z"},"trusted":true},"execution_count":37,"outputs":[]},{"cell_type":"code","source":"user_name()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:05:38.934346Z","iopub.execute_input":"2024-06-10T14:05:38.934799Z","iopub.status.idle":"2024-06-10T14:05:41.846780Z","shell.execute_reply.started":"2024-06-10T14:05:38.934767Z","shell.execute_reply":"2024-06-10T14:05:41.845649Z"},"trusted":true},"execution_count":38,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter your name:  Advait\n"},{"name":"stdout","text":"The entered name Advait  starts with character A\n","output_type":"stream"}]},{"cell_type":"code","source":"user_name()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:05:47.147874Z","iopub.execute_input":"2024-06-10T14:05:47.149042Z","iopub.status.idle":"2024-06-10T14:05:49.458778Z","shell.execute_reply.started":"2024-06-10T14:05:47.148996Z","shell.execute_reply":"2024-06-10T14:05:49.457335Z"},"trusted":true},"execution_count":39,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter your name:  Om\n"},{"name":"stdout","text":"The lenght of your entered Om name is less than 5. Please enter Full name and try again!!\n","output_type":"stream"}]},{"cell_type":"code","source":"user_name()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:05:57.427048Z","iopub.execute_input":"2024-06-10T14:05:57.427498Z","iopub.status.idle":"2024-06-10T14:06:01.122524Z","shell.execute_reply.started":"2024-06-10T14:05:57.427467Z","shell.execute_reply":"2024-06-10T14:06:01.121342Z"},"trusted":true},"execution_count":40,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter your name:  Adv,ait\n"},{"name":"stdout","text":"The entered name Adv,ait  starts with character A\n","output_type":"stream"}]},{"cell_type":"code","source":"user_name()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:06:09.091541Z","iopub.execute_input":"2024-06-10T14:06:09.092018Z","iopub.status.idle":"2024-06-10T14:06:16.810958Z","shell.execute_reply.started":"2024-06-10T14:06:09.091981Z","shell.execute_reply":"2024-06-10T14:06:16.809494Z"},"trusted":true},"execution_count":41,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter your name:  Bu,sh\n"},{"name":"stdout","text":"No Special Characters allowed in name\n","output_type":"stream"}]},{"cell_type":"code","source":"user_name()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:06:26.355071Z","iopub.execute_input":"2024-06-10T14:06:26.356445Z","iopub.status.idle":"2024-06-10T14:07:03.519806Z","shell.execute_reply.started":"2024-06-10T14:06:26.356383Z","shell.execute_reply":"2024-06-10T14:07:03.518548Z"},"trusted":true},"execution_count":42,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter your name:  GeorgeWillam\n"},{"name":"stdout","text":"GeorgeWillam\n","output_type":"stream"}]},{"cell_type":"markdown","source":"### II. Looping Constructs","metadata":{}},{"cell_type":"code","source":"## Write a program to compute value of 10!\ndef fact():\n    num = int(input(\"Enter the Whole number whose value you need to find: \"))\n    fact = 1\n    if num == 1:\n        print(\"The factorial of the given number is 1\")\n    else:\n        for i in range(1, num+1):\n            fact = fact * i\n    print(\"The factorial of the entered number\",num,\"is\",fact)    ","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:19:32.747848Z","iopub.execute_input":"2024-06-10T14:19:32.748405Z","iopub.status.idle":"2024-06-10T14:19:32.756813Z","shell.execute_reply.started":"2024-06-10T14:19:32.748368Z","shell.execute_reply":"2024-06-10T14:19:32.755205Z"},"trusted":true},"execution_count":51,"outputs":[]},{"cell_type":"code","source":"fact()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:19:40.411354Z","iopub.execute_input":"2024-06-10T14:19:40.411784Z","iopub.status.idle":"2024-06-10T14:19:42.363574Z","shell.execute_reply.started":"2024-06-10T14:19:40.411751Z","shell.execute_reply":"2024-06-10T14:19:42.362092Z"},"trusted":true},"execution_count":53,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter the Whole number whose value you need to find:  10\n"},{"name":"stdout","text":"The factorial of the entered number 10 is 3628800\n","output_type":"stream"}]},{"cell_type":"code","source":"fact()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:21:16.953119Z","iopub.execute_input":"2024-06-10T14:21:16.953585Z","iopub.status.idle":"2024-06-10T14:21:20.487297Z","shell.execute_reply.started":"2024-06-10T14:21:16.953554Z","shell.execute_reply":"2024-06-10T14:21:20.486160Z"},"trusted":true},"execution_count":54,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter the Whole number whose value you need to find:  26\n"},{"name":"stdout","text":"The factorial of the entered number 26 is 403291461126605635584000000\n","output_type":"stream"}]},{"cell_type":"code","source":"fact()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:21:26.395402Z","iopub.execute_input":"2024-06-10T14:21:26.395860Z","iopub.status.idle":"2024-06-10T14:21:28.000501Z","shell.execute_reply.started":"2024-06-10T14:21:26.395827Z","shell.execute_reply":"2024-06-10T14:21:27.999350Z"},"trusted":true},"execution_count":55,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter the Whole number whose value you need to find:  98\n"},{"name":"stdout","text":"The factorial of the entered number 98 is 9426890448883247745626185743057242473809693764078951663494238777294707070023223798882976159207729119823605850588608460429412647567360000000000000000000000\n","output_type":"stream"}]},{"cell_type":"code","source":"## Password authenticationn system\ndef user_pass():\n    correct_pass = 'Adv@2901'\n\n    input_pass = input(\"Enter your password\")\n\n    while (input_pass != correct_pass):\n        print(\"The entered password is incorrect!! Please Try again\")\n        input_pass = input(\"Enter your password\")\n\n    print(\"Successful Login!! Welcome Again\")","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:24:56.774355Z","iopub.execute_input":"2024-06-10T14:24:56.774775Z","iopub.status.idle":"2024-06-10T14:24:56.781583Z","shell.execute_reply.started":"2024-06-10T14:24:56.774742Z","shell.execute_reply":"2024-06-10T14:24:56.780341Z"},"trusted":true},"execution_count":57,"outputs":[]},{"cell_type":"code","source":"user_pass()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:25:01.129776Z","iopub.execute_input":"2024-06-10T14:25:01.130148Z","iopub.status.idle":"2024-06-10T14:25:16.905014Z","shell.execute_reply.started":"2024-06-10T14:25:01.130120Z","shell.execute_reply":"2024-06-10T14:25:16.903428Z"},"trusted":true},"execution_count":58,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter your password Adv@2401\n"},{"name":"stdout","text":"The entered password is incorrect!! Please Try again\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Enter your password Adv@2910\n"},{"name":"stdout","text":"The entered password is incorrect!! Please Try again\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Enter your password Adv@2901\n"},{"name":"stdout","text":"Successful Login!! Welcome Again\n","output_type":"stream"}]},{"cell_type":"markdown","source":"# Assignments","metadata":{}},{"cell_type":"markdown","source":"### 1. Dictionary Quests","metadata":{}},{"cell_type":"markdown","source":"You are on a quest to collect various items in different locations. Your task is to\ncreate a dictionary to keep track of the items you find in each location. Write a\nPython program that allows you to add items to the dictionary, remove items, and\ncheck if a specific item exists in a location.\nRequirements:\n1. Create an empty dictionary to represent the player's inventory.\n2. Prompt the user to enter a location and an item found in that location.\n3. Add the item to the inventory dictionary with the location as the key and the item\nas the value.\n4. Allow the user to remove an item from a specific location.\n5. Implement a function to check if a specific item exists in any of the locations in\nthe inventory.\n6. Display the current inventory after each operation.","metadata":{}},{"cell_type":"code","source":"def add_item(inventory, location, item):\n    if location in inventory:\n        inventory[location].append(item)\n    else:\n        inventory[location] = [item]\n        \ndef remove_item(inventory, location, item):\n    if location in inventory and item in inventory[location]:\n        inventory[location].remove(item)\n        if not inventory[location]:\n            del inventory[location]\n\n\ndef check_item(inventory, item):\n    for location, items in inventory.items():\n        if item in items:\n            return True\n    return False\n\ndef display_inventory(inventory):\n    if not inventory:\n        print(\"Inventory is empty.\")\n    else:\n        for location, items in inventory.items():\n            print(f\"{location}: {', '.join(items)}\")","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:35:17.333707Z","iopub.execute_input":"2024-06-10T14:35:17.334500Z","iopub.status.idle":"2024-06-10T14:35:17.344512Z","shell.execute_reply.started":"2024-06-10T14:35:17.334464Z","shell.execute_reply":"2024-06-10T14:35:17.343245Z"},"trusted":true},"execution_count":62,"outputs":[]},{"cell_type":"code","source":"def main():\n    inventory = {}\n    \n    while True:\n        print(\"\\nOptions:\")\n        print(\"1. Add an item\")\n        print(\"2. Remove an item\")\n        print(\"3. Check if an item exists\")\n        print(\"4. Display inventory\")\n        print(\"5. Exit\")\n        \n        choice = input(\"Choose an option: \")\n        \n        if choice == '1':\n            location = input(\"Enter the location: \")\n            item = input(\"Enter the item found: \")\n            add_item(inventory, location, item)\n        elif choice == '2':\n            location = input(\"Enter the location: \")\n            item = input(\"Enter the item to remove: \")\n            remove_item(inventory, location, item)\n        elif choice == '3':\n            item = input(\"Enter the item to check: \")\n            if check_item(inventory, item):\n                print(f\"{item} exists in the inventory.\")\n            else:\n                print(f\"{item} does not exist in the inventory.\")\n        elif choice == '4':\n            display_inventory(inventory)\n        elif choice == '5':\n            break\n        else:\n            print(\"Invalid choice. Please choose a valid option.\")","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:35:20.731663Z","iopub.execute_input":"2024-06-10T14:35:20.732173Z","iopub.status.idle":"2024-06-10T14:35:20.744133Z","shell.execute_reply.started":"2024-06-10T14:35:20.732136Z","shell.execute_reply":"2024-06-10T14:35:20.742682Z"},"trusted":true},"execution_count":63,"outputs":[]},{"cell_type":"code","source":"main()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:35:28.493812Z","iopub.execute_input":"2024-06-10T14:35:28.494241Z","iopub.status.idle":"2024-06-10T14:38:48.018462Z","shell.execute_reply.started":"2024-06-10T14:35:28.494209Z","shell.execute_reply":"2024-06-10T14:38:48.017194Z"},"trusted":true},"execution_count":64,"outputs":[{"name":"stdout","text":"\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the location:  Texas\nEnter the item found:  I.T. Engineer\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\n"},{"name":"stdout","text":"Texas: I.T. Engineer\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the location:  UAS\nEnter the item found:  Civil Engineer \n"},{"name":"stdout","text":"\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\n"},{"name":"stdout","text":"Texas: I.T. Engineer\nUAS: Civil Engineer \n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  USA\n"},{"name":"stdout","text":"Invalid choice. Please choose a valid option.\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  Electrical Engineer \n"},{"name":"stdout","text":"Invalid choice. Please choose a valid option.\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\n"},{"name":"stdout","text":"Texas: I.T. Engineer\nUAS: Civil Engineer \n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the location:  USA\nEnter the item found:  Electrical Engineer\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\n"},{"name":"stdout","text":"Texas: I.T. Engineer\nUAS: Civil Engineer \nUSA: Electrical Engineer\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  3\nEnter the item to check:  Civil Engineer\n"},{"name":"stdout","text":"Civil Engineer does not exist in the inventory.\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  UAS\n"},{"name":"stdout","text":"Invalid choice. Please choose a valid option.\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  3\nEnter the item to check:  UAS\n"},{"name":"stdout","text":"UAS does not exist in the inventory.\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\n"},{"name":"stdout","text":"Texas: I.T. Engineer\nUAS: Civil Engineer \nUSA: Electrical Engineer\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  3\nEnter the item to check:  Civil Engineer\n"},{"name":"stdout","text":"Civil Engineer does not exist in the inventory.\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  3\nEnter the item to check:  Civil Engineer \n"},{"name":"stdout","text":"Civil Engineer  exists in the inventory.\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  2\nEnter the location:  UAS\nEnter the item to remove:  Civil Engineer \n"},{"name":"stdout","text":"\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\n"},{"name":"stdout","text":"Texas: I.T. Engineer\nUSA: Electrical Engineer\n\nOptions:\n1. Add an item\n2. Remove an item\n3. Check if an item exists\n4. Display inventory\n5. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  5\n"}]},{"cell_type":"markdown","source":"## 2. Set Collector","metadata":{}},{"cell_type":"markdown","source":"You are a collector of unique items. Your task is to create sets of items based on\ntheir categories and perform operations on those sets. Write a Python program\nthat allows you to create sets, combine sets, find common elements, and check if\none set is a proper subset of another set.\n Requirements:\n1. Prompt the user to enter items and their categories.\n2. Create sets of items based on their categories.\n3. Allow the user to combine two sets into a single set.\n4. Implement a function to find and display the common elements between two\nsets.\n5. Implement a function to check if one set is a proper subset of another set.\n6. Display the sets and the results of the operations after each step.","metadata":{}},{"cell_type":"code","source":"def add_item_to_category(categories, category, item):\n    if category in categories:\n        categories[category].add(item)\n    else:\n        categories[category] = {item}\n\ndef combine_sets(categories, category1, category2, new_category):\n    if category1 in categories and category2 in categories:\n        categories[new_category] = categories[category1].union(categories[category2])\n    else:\n        print(\"One or both categories do not exist.\")\n\ndef common_elements(categories, category1, category2):\n    if category1 in categories and category2 in categories:\n        return categories[category1].intersection(categories[category2])\n    else:\n        print(\"One or both categories do not exist.\")\n        return set()\n\ndef is_proper_subset(categories, subset_category, superset_category):\n    if subset_category in categories and superset_category in categories:\n        return categories[subset_category] < categories[superset_category]\n    else:\n        print(\"One or both categories do not exist.\")\n        return False\n\ndef display_categories(categories):\n    if not categories:\n        print(\"No categories available.\")\n    else:\n        for category, items in categories.items():\n            print(f\"{category}: {', '.join(items)}\")\n\ndef set_main():\n    categories = {}\n    \n    while True:\n        print(\"\\nOptions:\")\n        print(\"1. Add an item to a category\")\n        print(\"2. Combine two sets\")\n        print(\"3. Find common elements between two sets\")\n        print(\"4. Check if one set is a proper subset of another\")\n        print(\"5. Display categories\")\n        print(\"6. Exit\")\n        \n        choice = input(\"Choose an option: \")\n        \n        if choice == '1':\n            category = input(\"Enter the category: \")\n            item = input(\"Enter the item: \")\n            add_item_to_category(categories, category, item)\n        elif choice == '2':\n            category1 = input(\"Enter the first category to combine: \")\n            category2 = input(\"Enter the second category to combine: \")\n            new_category = input(\"Enter the name of the new combined category: \")\n            combine_sets(categories, category1, category2, new_category)\n        elif choice == '3':\n            category1 = input(\"Enter the first category: \")\n            category2 = input(\"Enter the second category: \")\n            common = common_elements(categories, category1, category2)\n            if common:\n                print(f\"Common elements between {category1} and {category2}: {', '.join(common)}\")\n        elif choice == '4':\n            subset_category = input(\"Enter the subset category: \")\n            superset_category = input(\"Enter the superset category: \")\n            if is_proper_subset(categories, subset_category, superset_category):\n                print(f\"{subset_category} is a proper subset of {superset_category}.\")\n            else:\n                print(f\"{subset_category} is not a proper subset of {superset_category}.\")\n        elif choice == '5':\n            display_categories(categories)\n        elif choice == '6':\n            break\n        else:\n            print(\"Invalid choice. Please choose a valid option.\")\n\n","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:41:32.650992Z","iopub.execute_input":"2024-06-10T14:41:32.651502Z","iopub.status.idle":"2024-06-10T14:41:32.672385Z","shell.execute_reply.started":"2024-06-10T14:41:32.651469Z","shell.execute_reply":"2024-06-10T14:41:32.670847Z"},"trusted":true},"execution_count":66,"outputs":[]},{"cell_type":"code","source":"set_main()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:41:38.641411Z","iopub.execute_input":"2024-06-10T14:41:38.641848Z","iopub.status.idle":"2024-06-10T14:45:51.903046Z","shell.execute_reply.started":"2024-06-10T14:41:38.641802Z","shell.execute_reply":"2024-06-10T14:45:51.901537Z"},"trusted":true},"execution_count":67,"outputs":[{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the category:  Fruits\nEnter the item:  Apple\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the category:  Fruits\nEnter the item:  Banana\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  Vegetables\n"},{"name":"stdout","text":"Invalid choice. Please choose a valid option.\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the category:  Vegetables\nEnter the item:  Carrot\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  5\n"},{"name":"stdout","text":"Fruits: Apple, Banana\nVegetables: Carrot\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  2\nEnter the first category to combine:  Fruits\nEnter the second category to combine:  Vegetables\nEnter the name of the new combined category:  Food\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  5\n"},{"name":"stdout","text":"Fruits: Apple, Banana\nVegetables: Carrot\nFood: Apple, Banana, Carrot\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the category:  Fruits\nEnter the item:  Orange\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  1\nEnter the category:  Vegetables\nEnter the item:  Tomato\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  3\nEnter the first category:  Fruits\nEnter the second category:  Vegetables\n"},{"name":"stdout","text":"\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\nEnter the subset category:  Fruits\nEnter the superset category:  Food\n"},{"name":"stdout","text":"Fruits is not a proper subset of Food.\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  5\n"},{"name":"stdout","text":"Fruits: Apple, Banana, Orange\nVegetables: Tomato, Carrot\nFood: Apple, Banana, Carrot\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  3\nEnter the first category:  Food\nEnter the second category:  Fruits\n"},{"name":"stdout","text":"Common elements between Food and Fruits: Apple, Banana\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  4\nEnter the subset category:  Food\nEnter the superset category:  Vegetables\n"},{"name":"stdout","text":"Food is not a proper subset of Vegetables.\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  5\n"},{"name":"stdout","text":"Fruits: Apple, Banana, Orange\nVegetables: Tomato, Carrot\nFood: Apple, Banana, Carrot\n\nOptions:\n1. Add an item to a category\n2. Combine two sets\n3. Find common elements between two sets\n4. Check if one set is a proper subset of another\n5. Display categories\n6. Exit\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Choose an option:  6\n"}]},{"cell_type":"markdown","source":"## 3. Number Challenge ","metadata":{}},{"cell_type":"markdown","source":"You have encountered a number challenge! Your task is to solve different\nnumber-related puzzles using control flow statements. Write a Python program\nthat prompts the user to enter a number and perform operations to determine\nproperties of the number.\n Requirements:\n1. Prompt the user to enter a number.\n2. Check if the number is positive, negative, or zero, and display the result.\n3. Check if the number is even or odd, and display the result.\n4. Prompt the user to enter a divisor and check if the number is a multiple of the\ndivisor, displaying the result.\n5. Provide feedback to the user based on their answers and encourage them to\nsolve more number challenges.","metadata":{}},{"cell_type":"code","source":"def pos_neg(num):\n    if num < 0:\n        print(\"The entered number\",num,\"is a negative number\")\n    elif num > 0:\n        print(\"The entered number\",num,\"is a positive number\")\n    elif num == 0:\n        print(\"The entered number\",num,\"is 0\")\n        \ndef even_odd(num):\n    if (num%2 == 0):\n        print(\"The entered number\",num,\"is an Even number\")\n    elif (num%2 != 0):\n        print(\"The entered number\",num,\"is an Odd number\")\n            \ndef mul_div(num):\n    div = int(input(\"Enter the divisor(whole number): \"))\n    if (num%div == 0):\n        print(\"The entered number\",num,\"is a multiple of entered divisor\",div)\n    else:\n        print(\"The entered number\",num,\"is a not a multiple of entered divisor\",div)   ","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:57:20.875295Z","iopub.execute_input":"2024-06-10T14:57:20.875793Z","iopub.status.idle":"2024-06-10T14:57:20.885920Z","shell.execute_reply.started":"2024-06-10T14:57:20.875757Z","shell.execute_reply":"2024-06-10T14:57:20.884595Z"},"trusted":true},"execution_count":70,"outputs":[]},{"cell_type":"code","source":"def num_main():\n    num = int(input(\"Enter any whole number(number without decimal points): \"))\n    pos_neg(num)\n    even_odd(num)\n    mul_div(num)","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:58:16.860880Z","iopub.execute_input":"2024-06-10T14:58:16.862162Z","iopub.status.idle":"2024-06-10T14:58:16.869652Z","shell.execute_reply.started":"2024-06-10T14:58:16.862107Z","shell.execute_reply":"2024-06-10T14:58:16.867886Z"},"trusted":true},"execution_count":71,"outputs":[]},{"cell_type":"code","source":"num_main()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:58:24.083412Z","iopub.execute_input":"2024-06-10T14:58:24.083887Z","iopub.status.idle":"2024-06-10T14:59:02.688499Z","shell.execute_reply.started":"2024-06-10T14:58:24.083853Z","shell.execute_reply":"2024-06-10T14:59:02.687136Z"},"trusted":true},"execution_count":72,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter any whole number(number without decimal points):  32190\n"},{"name":"stdout","text":"The entered number 32190 is a positive number\nThe entered number 32190 is an Even number\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Enter the divisor(whole number):  14\n"},{"name":"stdout","text":"The entered number 32190 is a not a multiple of entered divisor 14\n","output_type":"stream"}]},{"cell_type":"code","source":"num_main()","metadata":{"execution":{"iopub.status.busy":"2024-06-10T14:59:10.794974Z","iopub.execute_input":"2024-06-10T14:59:10.795439Z","iopub.status.idle":"2024-06-10T15:00:02.628558Z","shell.execute_reply.started":"2024-06-10T14:59:10.795406Z","shell.execute_reply":"2024-06-10T15:00:02.627115Z"},"trusted":true},"execution_count":73,"outputs":[{"output_type":"stream","name":"stdin","text":"Enter any whole number(number without decimal points):  32190\n"},{"name":"stdout","text":"The entered number 32190 is a positive number\nThe entered number 32190 is an Even number\n","output_type":"stream"},{"output_type":"stream","name":"stdin","text":"Enter the divisor(whole number):  15\n"},{"name":"stdout","text":"The entered number 32190 is a multiple of entered divisor 15\n","output_type":"stream"}]},{"cell_type":"code","source":"","metadata":{},"execution_count":null,"outputs":[]}]}