208 skills found · Page 7 of 7
nwx77 / Cheap CluelyI loved the idea of Cluely, an AI that reads your meetings and screen to give instant answers, but it’s pricey. So I built my own version in Python using OCR (Tesseract) to capture screen text, Whisper for audio transcription, and Google’s Gemini API (with BYO key) for responses, all shown in a translucent always-on-top overlay, invisible to others
joshuahernandezvega / Bypass ReCAPTCHA InvisibleHave you ever wondered how you can get a valid recaptcha token to send valid HTTP request? While doing web pentest for a client, I figured out this idea that can get you a token so as you can implement it with a python function of your own to interact with your target. It might be not the best way, however it helped me a lot.
flybunctious / The Game Of HogIntroduction In this project, you will develop a simulator and multiple strategies for the dice game Hog. You will need to use control statements and higher-order functions together, as described in Sections 1.2 through 1.6 of Composing Programs. In Hog, two players alternate turns trying to be the first to end a turn with at least 100 total points. On each turn, the current player chooses some number of dice to roll, up to 10. That player's score for the turn is the sum of the dice outcomes. To spice up the game, we will play with some special rules: Pig Out. If any of the dice outcomes is a 1, the current player's score for the turn is 1. Example 1: The current player rolls 7 dice, 5 of which are 1's. They score 1 point for the turn. Example 2: The current player rolls 4 dice, all of which are 3's. Since Pig Out did not occur, they score 12 points for the turn. Free Bacon. A player who chooses to roll zero dice scores one more than the largest digit in the opponent's total score. Example 1: If the opponent has 42 points, the current player gains 1 + max(4, 2) = 5 points by rolling zero dice. Example 2: If the opponent has 48 points, the current player gains 1 + max(4, 8) = 9 points by rolling zero dice. Example 3: If the opponent has 7 points, the current player gains 1 + max(0, 7) = 8 points by rolling zero dice. Swine Swap. After points for the turn are added to the current player's score, if both scores are larger than 1 and either one of the scores is a positive integer multiple of the other, then the two scores are swapped. Example 1: The current player has a total score of 37 and the opponent has 92. The current player rolls two dice that total 9. The opponent's score (92) is exactly twice the player's new total score (46). These scores are swapped! The current player now has 92 points and the opponent has 46. The turn ends. Example 2: The current player has 91 and the opponent has 37. The current player rolls five dice that total 20. The current player has 111, which is 3 times 37, so the scores are swapped. The opponent ends the turn with 111 and wins the game. Download starter files To get started, download all of the project code as a zip archive. You only have to make changes to hog.py. hog.py: A starter implementation of Hog dice.py: Functions for rolling dice hog_gui.py: A graphical user interface for Hog ucb.py: Utility functions for CS 61A ok: CS 61A autograder tests: A directory of tests used by ok images: A directory of images used by hog_gui.py Logistics This is a 2-week project. This is a solo project, so you will complete this project without a partner. You should not share your code with any other students, or copy from anyone else's solutions. Remember that you can earn an additional bonus point by submitting the project at least 24 hours before the deadline. The project is worth 20 points. 18 points are assigned for correctness, and 2 points for the overall composition of your program. You will turn in the following files: hog.py You do not need to modify or turn in any other files to complete the project. To submit the project, run the following command: python3 ok --submit You will be able to view your submissions on the Ok dashboard. For the functions that we ask you to complete, there may be some initial code that we provide. If you would rather not use that code, feel free to delete it and start from scratch. You may also add new function definitions as you see fit. However, please do not modify any other functions. Doing so may result in your code failing our autograder tests. Also, please do not change any function signatures (names, argument order, or number of arguments). Testing Throughout this project, you should be testing the correctness of your code. It is good practice to test often, so that it is easy to isolate any problems. However, you should not be testing too often, to allow yourself time to think through problems. We have provided an autograder called ok to help you with testing your code and tracking your progress. The first time you run the autograder, you will be asked to log in with your Ok account using your web browser. Please do so. Each time you run ok, it will back up your work and progress on our servers. The primary purpose of ok is to test your implementations, but there are two things you should be aware of. First, some of the test cases are locked. To unlock tests, run the following command from your terminal: python3 ok -u This command will start an interactive prompt that looks like: ===================================================================== Assignment: The Game of Hog Ok, version ... ===================================================================== ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Unlocking tests At each "? ", type what you would expect the output to be. Type exit() to quit --------------------------------------------------------------------- Question 0 > Suite 1 > Case 1 (cases remaining: 1) >>> Code here ? At the ?, you can type what you expect the output to be. If you are correct, then this test case will be available the next time you run the autograder. The idea is to understand conceptually what your program should do first, before you start writing any code. Once you have unlocked some tests and written some code, you can check the correctness of your program using the tests that you have unlocked: python3 ok Most of the time, you will want to focus on a particular question. Use the -q option as directed in the problems below. We recommend that you submit after you finish each problem. Only your last submission will be graded. It is also useful for us to have more backups of your code in case you run into a submission issue. The tests folder is used to store autograder tests, so do not modify it. You may lose all your unlocking progress if you do. If you need to get a fresh copy, you can download the zip archive and copy it over, but you will need to start unlocking from scratch. If you do not want us to record a backup of your work or information about your progress, use the --local option when invoking ok. With this option, no information will be sent to our course servers. Graphical User Interface A graphical user interface (GUI, for short) is provided for you. At the moment, it doesn't work because you haven't implemented the game logic. Once you complete the play function, you will be able to play a fully interactive version of Hog! In order to render the graphics, make sure you have Tkinter, Python's main graphics library, installed on your computer. Once you've done that, you can run the GUI from your terminal: python3 hog_gui.py Once you complete the project, you can play against the final strategy that you've created! python3 hog_gui.py -f Phase 1: Simulator In the first phase, you will develop a simulator for the game of Hog. Problem 0 (0 pt) The dice.py file represents dice using non-pure zero-argument functions. These functions are non-pure because they may have different return values each time they are called. The documentation of dice.py describes the two different types of dice used in the project: Dice can be fair, meaning that they produce each possible outcome with equal probability. Example: six_sided. For testing functions that use dice, deterministic test dice always cycle through a fixed sequence of values that are passed as arguments to the make_test_dice function. Before we start writing any code, let's understand the make_test_dice function by unlocking its tests. python3 ok -q 00 -u This should display a prompt that looks like this: ===================================================================== Assignment: Project 1: Hog Ok, version v1.5.2 ===================================================================== ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Unlocking tests At each "? ", type what you would expect the output to be. Type exit() to quit --------------------------------------------------------------------- Question 0 > Suite 1 > Case 1 (cases remaining: 1) >>> test_dice = make_test_dice(4, 1, 2) >>> test_dice() ? You should type in what you expect the output to be. To do so, you need to first figure out what test_dice will do, based on the description above. You can exit the unlocker by typing exit() (without quotes). Typing Ctrl-C on Windows to exit out of the unlocker has been known to cause problems, so avoid doing so. Problem 1 (2 pt) Implement the roll_dice function in hog.py. It takes two arguments: a positive integer called num_rolls giving the number of dice to roll and a dice function. It returns the number of points scored by rolling the dice that number of times in a turn: either the sum of the outcomes or 1 (Pig Out). To obtain a single outcome of a dice roll, call dice(). You should call dice() exactly num_rolls times in the body of roll_dice. Remember to call dice() exactly num_rolls times even if Pig Out happens in the middle of rolling. In this way, we correctly simulate rolling all the dice together. Checking Your Work: Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 01 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 01 If the tests don't pass, it's time to debug. You can observe the behavior of your function using Python directly. First, start the Python interpreter and load the hog.py file. python3 -i hog.py Then, you can call your roll_dice function on any number of dice you want, such as 4. >>> roll_dice(4) In most systems, you can evaluate the same expression again by pressing the up arrow or Control-P, then pressing enter or return. You should find that evaluating this call expression gives a different answer each time, since dice rolls are random. The roll_dice function has a default argument value for dice that is a random six-sided dice function. You can also use test dice that fix the outcomes of the dice in advance. For example, rolling twice when you know that the dice will come up 3 and 4 should give a total outcome of 7. >>> fixed_dice = make_test_dice(3, 4) >>> roll_dice(2, fixed_dice) 7 If you find a problem, you need to change your hog.py file, save it, quit Python, start it again, and then start evaluating expressions. Pressing the up arrow should give you access to your previous expressions, even after restarting Python. Once you think that your roll_dice function is correct, run the ok tests again. Tests like these don't prove that your program is exactly correct, but they help you build confidence that this part of your program does what you expect, so that you can trust the abstraction it defines as you proceed. Problem 2 (1 pt) Implement the free_bacon helper function that returns the number of points scored by rolling 0 dice, based on the opponent's current score. You can assume that score is less than 100. For a score less than 10, assume that the first of the two digits is 0. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 02 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 02 You can also test free_bacon interactively by entering python3 -i hog.py in the terminal and then calling free_bacon with various inputs. Problem 3 (1 pt) Implement the take_turn function, which returns the number of points scored for a turn by the current player. Your implementation should call roll_dice when possible. You will need to implement the Free Bacon rule. You can assume that opponent_score is less than 100. Call free_bacon in your implementation of take_turn. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 03 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 03 Problem 4 (1 pt) Implement is_swap, which returns whether or not the scores should be swapped because one is an integer multiple of the other. The is_swap function takes two arguments: the player scores. It returns a boolean value to indicate whether the Swine Swap condition is met. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 04 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 04 Problem 5 (3 pt) Implement the play function, which simulates a full game of Hog. Players alternate turns, each using their respective strategy function (Player 0 uses strategy0, etc.), until one of the players reaches the goal score. When the game ends, play returns the final total scores of both players, with Player 0's score first, and Player 1's score second. Here are some hints: You should use the functions you have already written! You will need to call take_turn with all three arguments. Only call take_turn once per turn. Enforce all the special rules. You can get the number of the other player (either 0 or 1) by calling the provided function other. You can ignore the say argument to the play function for now. You will use it in Phase 2 of the project. A strategy is a function that, given a player's score and their opponent's score, returns how many dice the player wants to roll. A strategy function (such as strategy0 and strategy1) takes two arguments: scores for the current player and opposing player, which both must be non-negative integers. A strategy function returns the number of dice that the current player wants to roll in the turn. Each strategy function should be called only once per turn. Don't worry about the details of implementing strategies yet. You will develop them in Phase 3. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 05 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 05 The last test for Question 5 is a fuzz test, which checks that your play function works for a large number of different inputs. Failing this test means something is wrong, but you should look at other tests to see where the problem might be. Once you are finished, you will be able to play a graphical version of the game. We have provided a file called hog_gui.py that you can run from the terminal: python3 hog_gui.py If you don't already have Tkinter (Python's graphics library) installed, you'll need to install it first before you can run the GUI. The GUI relies on your implementation, so if you have any bugs in your code, they will be reflected in the GUI. This means you can also use the GUI as a debugging tool; however, it's better to run the tests first. Congratulations! You have finished Phase 1 of this project! Phase 2: Commentary In the second phase, you will implement commentary functions that print remarks about the game, such as, "22 points! That's the biggest gain yet for Player 1." A commentary function takes two arguments, the current score for Player 0 and the current score for Player 1. It returns another commentary function to be called on the next turn. It may also print some output as a side effect of being called. The function say_scores in hog.py is an example of a commentary function. The function announce_lead_changes is an example of a higher-order function that returns a commentary function. def say_scores(score0, score1): """A commentary function that announces the score for each player.""" print("Player 0 now has", score0, "and Player 1 now has", score1) return say_scores def announce_lead_changes(previous_leader=None): """Return a commentary function that announces lead changes. >>> f0 = announce_lead_changes() >>> f1 = f0(5, 0) Player 0 takes the lead by 5 >>> f2 = f1(5, 12) Player 1 takes the lead by 7 >>> f3 = f2(8, 12) >>> f4 = f3(8, 13) >>> f5 = f4(15, 13) Player 0 takes the lead by 2 """ def say(score0, score1): if score0 > score1: leader = 0 elif score1 > score0: leader = 1 else: leader = None if leader != None and leader != previous_leader: print('Player', leader, 'takes the lead by', abs(score0 - score1)) return announce_lead_changes(leader) return say Problem 6 (2 pt) Update your play function so that a commentary function is called at the end of each turn. say(score0, score1) should be called at the end of the first turn. Its return value (another commentary function) should be called at the end of the second turn. Each turn, a new commentary function should be called that is the return value of the previous call to a commentary function. Also implement both, a function that takes two commentary functions (f and g) and returns a new commentary function. This new commentary function returns another commentary function which calls the functions returned by calling f and g, in that order. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 06 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 06 Problem 7 (2 pt) Implement the announce_highest function, which is a higher-order function that returns a commentary function. This commentary function announces whenever a particular player gains more points in a turn than ever before. To compute the gain, it must compare the score from last turn to the score from this turn for the player of interest, which is designated by the who argument. This function must also keep track of the highest gain for the player so far. The way in which announce_highest announces is very specific, and your implementation should match the doctests provided. Notice in particular that if the gain is only 1 point, then the message includes "point" in singular form. If the gain is larger, then the message includes "points" in plural form. Use Ok to test your code: python3 ok -q 07 Hint. The announce_lead_changes function provided to you is an example of how to keep track of information using commentary functions. If you are stuck, first make sure you understand how announce_lead_changes works. When you are done, if play the game again, you will see the commentary. python3 hog_gui.py The commentary in the GUI is generated by passing the following function as the say argument to play. both(announce_highest(0), both(announce_highest(1), announce_lead_changes())) Great work! You just finished Phase 2 of the project! Phase 3: Strategies In the third phase, you will experiment with ways to improve upon the basic strategy of always rolling a fixed number of dice. First, you need to develop some tools to evaluate strategies. Problem 8 (2 pt) Implement the make_averaged function, which is a higher-order function that takes a function fn as an argument. It returns another function that takes the same number of arguments as fn (the function originally passed into make_averaged). This returned function differs from the input function in that it returns the average value of repeatedly calling fn on the same arguments. This function should call fn a total of num_samples times and return the average of the results. To implement this function, you need a new piece of Python syntax! You must write a function that accepts an arbitrary number of arguments, then calls another function using exactly those arguments. Here's how it works. Instead of listing formal parameters for a function, we write *args. To call another function using exactly those arguments, we call it again with *args. For example, >>> def printed(fn): ... def print_and_return(*args): ... result = fn(*args) ... print('Result:', result) ... return result ... return print_and_return >>> printed_pow = printed(pow) >>> printed_pow(2, 8) Result: 256 256 >>> printed_abs = printed(abs) >>> printed_abs(-10) Result: 10 10 Read the docstring for make_averaged carefully to understand how it is meant to work. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 08 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 08 Problem 9 (1 pt) Implement the max_scoring_num_rolls function, which runs an experiment to determine the number of rolls (from 1 to 10) that gives the maximum average score for a turn. Your implementation should use make_averaged and roll_dice. If two numbers of rolls are tied for the maximum average score, return the lower number. For example, if both 3 and 6 achieve a maximum average score, return 3. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 09 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 09 To run this experiment on randomized dice, call run_experiments using the -r option: python3 hog.py -r Running experiments For the remainder of this project, you can change the implementation of run_experiments as you wish. By calling average_win_rate, you can evaluate various Hog strategies. For example, change the first if False: to if True: in order to evaluate always_roll(8) against the baseline strategy of always_roll(4). You should find that it wins slightly more often than it loses, giving a win rate around 0.5. Some of the experiments may take up to a minute to run. You can always reduce the number of samples in make_averaged to speed up experiments. Problem 10 (1 pt) A strategy can take advantage of the Free Bacon rule by rolling 0 when it is most beneficial to do so. Implement bacon_strategy, which returns 0 whenever rolling 0 would give at least margin points and returns num_rolls otherwise. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 10 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 10 Once you have implemented this strategy, change run_experiments to evaluate your new strategy against the baseline. You should find that it wins more than half of the time. Problem 11 (2 pt) A strategy can also take advantage of the Swine Swap rule. The swap_strategy rolls 0 if it would cause a beneficial swap. It also returns 0 if rolling 0 would give at least margin points and would not cause a swap. Otherwise, the strategy rolls num_rolls. Before writing any code, unlock the tests to verify your understanding of the question. python3 ok -q 11 -u Once you are done unlocking, begin implementing your solution. You can check your correctness with: python3 ok -q 11 Once you have implemented this strategy, update run_experiments to evaluate your new strategy against the baseline. You should find that it gives a significant edge over always_roll(4). Optional: Problem 12 (0 pt) Implement final_strategy, which combines these ideas and any other ideas you have to achieve a high win rate against the always_roll(4) strategy. Some suggestions: swap_strategy is a good default strategy to start with. There's no point in scoring more than 100. Check whether you can win by rolling 0, 1 or 2 dice. If you are in the lead, you might take fewer risks. Try to force a beneficial swap. Choose the num_rolls and margin arguments carefully. You can check that your final strategy is valid by running Ok. python3 ok -q 12 You can also check your exact final winrate by running python3 calc.py At this point, run the entire autograder to see if there are any tests that don't pass. python3 ok Once you are satisfied, submit to Ok to complete the project. python3 ok --submit You can also play against your final strategy with the graphical user interface: python3 hog_gui.py -f The GUI will alternate which player is controlled by you. Congratulations, you have reached the end of your first CS 61A project! If you haven't already, relax and enjoy a few games of Hog with a friend.
prateekkale / Knowledgegraph Gpt PythonThis is small project to showcase how we can use chatgpt api to generate knowledge graphs using python. Idea is not to showcase fancy graphs but to extract entities and their relationships
flodri / Py DMUD(ABANDONED) A barebone codebase for those who want to tinker with the idea of discord-MUD. It work using python and the Discord.py library.
michplunkett / Python Project TemplateThis repository is a template for a python project using the uv container. The intent is to do all the basic lifting for a python project so that people can hit the ground running with their ideas.
whitetiesec / AtodAtod is a python script which analizes the Alexa top 1 million and creates a dictionary and a stats file. The idea is using the Dictionary as input during the Information Gathering phase and the stats file for analysis purposes.
PydPiper / Viks SoftwareGuideA collection of knowledge focused around python, excel vba, shell, and other various frameworks. The idea is to provide users a step-by-step walk-through on each topic, with emphasis on the "gotchas".
virajbhutada / Python ProjectsThis repository gathers a range of Python projects exploring data analysis, machine learning, and automation. Each project takes on a different challenge, using Python’s libraries and tools to find practical solutions. It’s a place to share ideas and learn, whether you're interested in data insights or automation applications.
basnetsoyuj / MxN Sudoku SolverExtending the idea of the classical 9x9 grid sudoku puzzle, this simple sudoku solver program written in Python can solve any valid grid size of sudoku puzzle with a sub-grid size of MxN.
John-Jelatis / VMBot For DiscordAfter seeing @shirt-dev playing with a python-based bot that interfaced with VirtualBox, I decided I wanted my own, better bot. I threw one together before writing this codebase as to get an idea on complexity, so hopefully my having a vague plan made it at least some what comprehensible.
valenserimedei / Analysis Marketing Campaigns With PythonWelcome to the new era. One of the biggest challenges when studying the technical skills of data science is understanding how those skills and concepts translate into real jobs, like growth marketing. The main idea is to demonstrate how with Python skills you can make the best marketing decisions based on data. In this project, through Python, using packages such as pandas, I perform an analysis of marketing campaigns using machine learning, taking into account the different metrics such as CTR, conversion rate, or retention rate of each social network, to learn how to analyze campaign performance, measure customer engagement, and predict customer churn, to improve company's marketing strategy.
MuhammadRidwan123 / Https Raw.githubusercontent.com Instaloader Instaloader Master Docs Logo Heading.png Travis CI Buhttps://raw.githubusercontent.com/instaloader/instaloader/master/docs/logo_heading.png Travis-CI Build Status Instaloader PyPI Project Page Supported Python Versions MIT License Arch User Repository Package Contributor Count PyPI Download Count Say Thanks! $ pip3 install instaloader $ instaloader profile [profile ...] Instaloader downloads public and private profiles, hashtags, user stories, feeds and saved media, downloads comments, geotags and captions of each post, automatically detects profile name changes and renames the target directory accordingly, allows fine-grained customization of filters and where to store downloaded media. instaloader [--comments] [--geotags] [--stories] [--highlights] [--tagged] [--login YOUR-USERNAME] [--fast-update] profile | "#hashtag" | :stories | :feed | :saved Instaloader Documentation How to Automatically Download Pictures from Instagram To download all pictures and videos of a profile, as well as the profile picture, do instaloader profile [profile ...] where profile is the name of a profile you want to download. Instead of only one profile, you may also specify a list of profiles. To later update your local copy of that profiles, you may run instaloader --fast-update profile [profile ...] If --fast-update is given, Instaloader stops when arriving at the first already-downloaded picture. When updating profiles, Instaloader automatically detects profile name changes and renames the target directory accordingly. Instaloader can also be used to download private profiles. To do so, invoke it with instaloader --login=your_username profile [profile ...] When logging in, Instaloader stores the session cookies in a file in your temporary directory, which will be reused later the next time --login is given. So you can download private profiles non-interactively when you already have a valid session cookie file. Instaloader Documentation Disclaimer Instaloader is in no way affiliated with, authorized, maintained or endorsed by Instagram or any of its affiliates or subsidiaries. This is an independent and unofficial project. Use at your own risk. Instaloader is licensed under an MIT license. Refer to LICENSE file for more information. Contributing As an open source project, Instaloader heavily depends on the contributions from its community. See contributing for how you may help Instaloader to become an even greater tool. It is a pleasure for us to share our Instaloader to the world, and we are proud to have attracted such an active and motivating community, with so many users who share their suggestions and ideas with us. Buying a community-sponsored beer or coffee from time to time is very likely to further raise our passion for the development of Instaloader. For Donations, we provide a PayPal.Me link and a Bitcoin address. PayPal: PayPal.me/aandergr BTC: 1Nst4LoadeYzrKjJ1DX9CpbLXBYE9RKLwY
suryanshagarwal599 / Crytpography Using FlaskCrypto-flask Crypto flask is a web implementation of hybrid cryptography using RSA , AES and SHA-256. RSA Algorithm in Cryptography RSA algorithm is asymmetric cryptography algorithm. Asymmetric actually means that it works on two different keys i.e. Public Key and Private Key. As the name describes that the Public Key is given to everyone and Private key is kept private. An example of asymmetric cryptography : A client (for example browser) sends its public key to the server and requests for some data. The server encrypts the data using client’s public key and sends the encrypted data. Client receives this data and decrypts it. Since this is asymmetric, nobody else except browser can decrypt the data even if a third party has public key of browser. The idea! The idea of RSA is based on the fact that it is difficult to factorize a large integer. The public key consists of two numbers where one number is multiplication of two large prime numbers. And private key is also derived from the same two prime numbers. So if somebody can factorize the large number, the private key is compromised. Therefore encryption strength totally lies on the key size and if we double or triple the key size, the strength of encryption increases exponentially. RSA keys can be typically 1024 or 2048 bits long, but experts believe that 1024 bit keys could be broken in the near future. But till now it seems to be an infeasible task. AES AES is an iterative rather than Feistel cipher. It is based on ‘substitution–permutation network’. It comprises of a series of linked operations, some of which involve replacing inputs by specific outputs (substitutions) and others involve shuffling bits around (permutations). Interestingly, AES performs all its computations on bytes rather than bits. Hence, AES treats the 128 bits of a plaintext block as 16 bytes. These 16 bytes are arranged in four columns and four rows for processing as a matrix − Unlike DES, the number of rounds in AES is variable and depends on the length of the key. AES uses 10 rounds for 128-bit keys, 12 rounds for 192-bit keys and 14 rounds for 256-bit keys. Each of these rounds uses a different 128-bit round key, which is calculated from the original AES key. SHA-256 SHA-256 stands for Secure Hash Algorithm – 256 bit and is a type of hash function commonly used in Blockchain. A hash function is a type of mathematical function which turns data into a fingerprint of that data called a hash. It’s like a formula or algorithm which takes the input data and turns it into an output of a fixed length, which represents the fingerprint of the data. The input data can literally be any data, whether it’s the entire Encyclopedia Britannica, or just the number ‘1’. A hash function will give the same hash for the same input always no matter when, where and how you run the algorithm. Equally interestingly, if even one character in the input text or data is changed, the output hash will change. Also, a hash function is a one-way function, thus it is impossible to generate back the input data from its hash. So, you can go from the input data to the hash but not from the hash to the input data. Requirements : Python 2.7 Flask How to run : python app.py Copy the url from console and run on browser.
shrivenkateshwara / Best Private University In Uttar Pradesh UP Top University In India SVUSri Venkateshwara University (SVU) strives to create professionals who are not only adept in academics but also in application for the benefit of humanity. We foster a culture of learning by doing. We believe in nurturing students who are at the forefront of innovation by offering an environment of research & development to make us Best University in Uttar Pradesh (UP). SVU believes in experiential learning. To facilitate this, we have an ultra-modern infrastructure that motivates students to experiment & excel in their area of interest. The Best University of Moradabad has laboratories & workshops that signify our commitment to core research, thus enabling innovation. SVU is the only institution to have set up labs in collaboration with the industry. This way we can train our students on the latest skills & make them employable. Students sharpen their practical skills under the watch full eyes of trainers & become competent professionals. For the overall development of the students, we organize cultural programs. Students take part in these programs & exhibit their talent to become confident professionals. The annual fest attracts students from all over the country & showcase their talent to make us the Top University in India. We equipped the computing labs with the latest software & hardware to augment the technical skills of the students. SVU’s library is an epitome of knowledge. It has over 3000 books & journals that ensure the students are never short on intellectual input. The team of industry trainers educate them on the key skills so crucial for employment & make us the Best University in Gajraula. The specially created engineering labs assist engineers to refine their technical acumen so much needed for the country. The Chairman Dr. Sudhir Giri believes in removing all the economic & social barriers that can hinder education. Hence, SVU provides many scholarships & grants to meritorious students. Up till now, the college has enabled over 500000 students to attain their academic desires to make us the Best Private University in Uttar Pradesh (UP). The group is running a dozen educational institutions that include medical colleges in India & abroad. Our commitment towards education & healthcare has enabled Dr Sudhir Giri to win the International Glory Man of the year Award 2021. The Best Private University in Moradabad is on the Delhi Moradabad highway, well connected with rail & road. The green surroundings provide peace of mind that enables research based learning. The carefully recruited faculty is the pride of the university. They have years of industrial & academic experience so vital for the students. They transfer key skills & make us the Best Private University in Gajraula. The faculty encourages students to undertake research & sharpen their skills that will enable them to get jobs. Majority of the faculty members are doctorates who educate the students to become competent professionals. The faculty takes part in FDP in order to develop a culture of research. The specialty of SVU is the internship. We have partnered with leading industries for providing internship to the students. We believe that education without applicability is incomplete. Students gain hands on exposure through internship & become job ready. We place most of the students during internship to make us the Top University in India. SVU, the Best University in Uttar Pradesh (UP), adopts a futuristic teaching pedagogy. We strive for experiential learning of our students through role plays, projects & presentation. The students take part in the learning activity & imbibe concepts that enable their placements. The AC seminar & conference halls allow knowledge dispersion for the development of the students. The University is running over 150 undergraduate (UG), postgraduate (PG) courses, (Ph.D.), diploma and certificate courses in various fields of Applied Sciences, Medical Science, Humanities & Social Sciences. We also run courses in Languages, Design, Agriculture, Engineering & Technology, Nursing, Pharmacy, Paramedical, Commerce & Management, Law, Library & information Sciences, Mass Comm. & Journalism to enhance the employability of the youth. SVU has a culture of project based learning. Students do projects in each semester under the guidance of faculty. They complete these projects in earmarked industries to garner hands-on skills. Through these projects, we train students on the hot skills so crucial for employment to make us the Best University in Moradabad. SVU’s Research & Development (R&D) wing encourages students to work on research areas important for the country. We have partnered with leading research institutions to undertake research. The breath-taking infrastructure of the best university in Gajraula motivates researchers to achieve their goals for research. Owing to our dedication, SVU has received grants from GOI for research on areas of national importance. The faculty members provide guidance to the scholars until they achieve their aim. We have set up the incubation center to provide fillip to new ideas that foster entrepreneurship. We want to be an institution that supports the ‘Make in India’ vision of the government. The center supports new ideas that enable the young entrepreneurs to create startups & become successful. Under the strong leadership of Dr. Sudhir Giri, till date we have successfully incubated 150 start-ups. This speaks of our exemplary education & make us the Best Private University in Uttar Pradesh (UP). These startups are not only creating wealth but also providing employment to the needy. The industrialists have lamented that the epicenter for entrepreneurship will be the educational institutions. We need to provide them with the support & infrastructure for this. The annual hackathon attracts individuals who showcase their business acumen to make us the Best Private University in Moradabad. SVU has a dedicated International Research & collaboration Cell (IRCC) that collaborates with universities abroad. Faculty & students who want to pursue studies abroad the IRCC starts admission formalities for them. We have partnered with reputed institutions for providing excellent research collaborations. Those who wish to do P. HD abroad the IRCC help them gain admission & make us the Top University in India. A lot of our faculty members are pursuing their research internationally & contributing to the welfare of humanity. SVU strives to make our students feel comfortable at the campus. Separate hostel for boys & girls with 24 hour security is available at SVU. The cafeteria serves nutritious food to the students. Gym, recreation hall & the sports ground help to relax our students & make us the Best University in Uttar Pradesh (UP). The campus has an in house ATM & convenience store for the benefit of the students. SVU enables placement through exemplary training. We train on communication & interpersonal skills in order to refine the personality of the students. We make them practice mock interviews & group discussion that help to clear placement tests. Ninety percent of the students get placed before their last semester to make us the best university in Moradabad. We have hired industrial trainers in order to provide training on block chain, machine learning, artificial intelligence (AI), and python & data science. These trainers have years of experience that enables them in training the students. The students gain key insights on these technologies & sharpen their acumen to make us the Best University in Gajraula.
er-harsh-dhaduk / Python TipsThis repository will help user to get idea about major python tips in daily life.
refi64 / PycobPython C Obfuscation Bomb: A little April Fools prank for python-ideas
mhidusti / MhidustiTurning ideas into code with Django, Python, and passion
zagrosman / FastScriptThis page will provide highly fast-running python scripts for biologists and biotechnologists. I want to develop my ideas to help my colleagues all over the world for saving their time during computational analyses.
theamnabb / PythonVolunteersHubA collaborative repository driven by volunteers, dedicated to providing Python teaching resources and community support. Our mission is to empower learners and educators by sharing tutorials, project ideas, and best practices for teaching Python.
