Python Introduction

Python Introduction:-

What is Python?

Python is a popular programming language. It was created by Guido van Rossum, and released in 1991. Python programmers are often called Pythonists or Pythonistas.

It is used for:

web development (server-side),
software development,
mathematics,
system scripting.

What can Python do?

Python can be used on a server to create web applications.
Python can be used alongside software to create workflows.
Python can connect to database systems. It can also read and modify files.
Python can be used to handle big data and perform complex mathematics.
Python can be used for rapid prototyping, or for production-ready software development.

Why Python?

Python works on different platforms (Windows, Mac, Linux, Raspberry Pi, etc).
Python has a simple syntax similar to the English language.
Python has a syntax that allows developers to write programs with fewer lines than some other programming languages.
Python runs on an interpreter system, meaning that code can be executed as soon as it is written. This means that prototyping can be very quick.
Python can be treated in a procedural way, an object-oriented way, or a functional way.

Python Syntax compared to other programming languages:-

Python was designed for readability and has some similarities to the English language with influence from mathematics.
Python uses new lines to complete a command, as opposed to other programming languages which often use semicolons or parentheses.
Python relies on indentation, using whitespace, to define scope; such as the scope of loops, functions, and classes. Other programming languages often use curly brackets for this purpose.

EXAMPLES:-

print("Hello, World!")

Python compiler:- https://www.onlinegdb.com

Python official -https://www.python.org

Blogspot site -https://code-with- yash.blogspot

Comments

Program to find Smallest element in an array using C

Program to find Smallest element in an array using C We will find the smallest or minimum element in an array using the C concept. We apply an algorithm that assumes the first element as the smallest element and then compares it with other elements if an element is smaller than it then, it becomes the new smallest element, and this process is repeated till the complete array is scanned. ALGORITHMS:- STEP 1:- Initialize the required variables. STEP 2:- Take the input from the user. STEP 3:- Assume the smallest element is present at the first position. STEP 4:- Scan each element with the help of for a loop. STEP 5: - Check if the element Scanned is new smaller than small. STEP 6:- If it is smallest than small, change the value of small. STEP 7:- Print small as it stores the smallest element of the array. CODE:- #include <stdio.h> int main() { int a[ 50 ],p,...

Write a C program to find number is Abundant number or not

Write a C program to find the number is an Abundant number or not:- In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition the sum of its proper di visors is greater than the number itself. And the difference between these two values is called abundance. Ex:- Abundant number 12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number. Some other abundant numbers 18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120.. ALGORITHMS:- Step 1 - Enter the number, to find the Abundant number. Step 2 - Initialize the loop with c=1 to c<=number and follow the following calculation (i) check if whether the number is divisible with c and c got a result zero. (ii) now sum=sum+c, add a digit into a sum and store it in the sum. Step 3 . then the...

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

Chakra Vyuh Bhedna, the only answer to how to crack group discussions! Because of the pandemic, the placement drive was conducted virtually. And to add to the difficulty level, more than 200 students participated in the drive. The selection process consisted of an online test that included the aptitude and technical questions, which was followed by a group discussion. Both were elimination rounds. The shortlisted students were then called for the final round, the personal interview. All about cracking group discussions and interviews My strategy was to be attentive in the pre-placement talks by asking questions to them and even trying to answer their questions. This helped me to boost my self-confidence and made me perform well during the Group Discussion. For cracking group discussion, I practiced a simple and powerful technique called Chakra Vyuh Bhedna . It's a complete weapon to crack any GD. This technique has 4 parts. Awareness of the topic Understanding PE...

Code_with_chandan

Search This Blog