Python Dictionaries

Dictionaries in Python

• Dictionaries store key-value pairs, efficiently mapping keys to their corresponding values.
• Creation involves using curly braces: {} represents an empty dictionary.
• Key-value pairs are added using dictionary_name[key] = value; for example, conversion_factor['dollar'] = 60.
• print(dictionary_name) displays the entire dictionary.
• dictionary_name.keys() shows a list of keys.
• dictionary_name.values() shows a list of values.
• dictionary_name.items() shows a list of key-value pairs.
• Values are accessed via dictionary_name[key], such as conversion_factor['euro'] returning 80.
• del dictionary_name[key] removes a specific key-value pair, such as del conversion_factor['yen'].
• Updating a value is done like creating a new item: dictionary_name[key] = new_value.
• Accessing a non-existent key raises a KeyError.
• Dictionaries can perform currency conversion, where values are conversion rates.
• Python provides effective tools for dictionary manipulation, showcasing their data structure power.

Speech to Text with Python using Speech Recognition

• Python with the Speech Recognition library converts audio files to text.
• It assists with tasks like learning lyrics and dance skills.
• Installation is done via pip install speechrecognition in the terminal.
• Create an audio file and convert it to the ".wav" extension, as Speech Recognition works only with ".wav" files.
• import speech_recognition as sr imports the library.
• Assign the ".wav" audio filename to a variable (e.g., audio_file).
• Initialize the recognizer using recognizer = sr.Recognizer().
• Read the audio file using audio = sr.AudioFile(audio_file).
• Transcribe audio within a try block with error handling.
• Recognize audio using audio_recognized = recognizer.recognize_google(audio).
• Handle sr.UnknownValueError or sr.RequestError exceptions with messages.
• Print the recognized text using print(audio_recognized).
• Replace "sample_simran.wav" with the path to your .wav audio file.
• The code prints the recognized text to the console.

Monty Hall Problem

• The Monty Hall problem is a probability puzzle inspired by a game show.
• A contestant chooses one of three closed doors.
• One door hides a valuable prize (a BMW car), the other two hide less desirable prizes (goats).
• The host (Monty Hall) opens one of the unchosen doors to reveal a goat.
• The host always chooses a door the contestant didn't pick, hiding a goat.
• The contestant can stick with their original choice or switch to the other unopened door.
• The objective is to determine if swapping gives a higher probability of winning.
• Swapping has a higher probability of winning.
• Code simulates the problem to demonstrate the higher probability of winning by swapping.
• The code simulates numerous games, tracking wins with and without swapping.
• Simulated results show more wins when swapping, consistent with the problem's solution.

Rock Paper Scissors

• This is a game with three entities: Rock, Paper, Scissors.
• Player One's choices: 0 for Rock, 1 for Paper, and 2 for Scissors.
• Player Two's choices: 0 for Paper, 1 for Rock, and 2 for Scissors.
• The program uses user inputs for choices and secret bit positions within a while loop.
• Input includes num_one, num_two, bit_one, and bit_two.
• The loop continues until the user enters 'n' to exit.
• The program compares Player One's choice (num_one and bit_one) with Player Two's choice (num_two and bit_two) based on the game rules.
• The program prints results, indicating a draw or which player wins.
• The user is prompted to continue playing ('y' for yes, 'n' for no).
• If the user chooses 'n', the loop terminates, and the program exits.

Sorting and Searching

• The aim is to explore searching and sorting algorithms.
• Linear search involves checking each element sequentially and can be inefficient for large arrays.
• Binary search is an efficient algorithm for searching in sorted arrays.
• Binary search compares the target element with the middle element of the array.
• With binary search, if the target element is greater, you can discard the left half of the array; if it's smaller, discard the right half.
• Continue this process until the target element is found or the search space is empty.