Python programming Introduction about Python

Chapter 1: Introduction
This chapter addresses the question “What is computer science?” We begin by introducing
the essence of computational problem solving via some classic examples. Next, computer
algorithms, the heart of computational problem solving, are discussed. This is followed by a
look at computer hardware (and the related issues of binary representation and operating
systems) and computer software (and the related issues of syntax, semantics, and program
translation). The chapter finishes by presenting the process of computational problem
solving, with an introduction to the Python programming language.
1
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons

Computing technology has changed—and is continuing to change—the world.
Essentially every aspect of life has been impacted by computing. Computing
related fields in almost all areas of study are emerging.
2
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons
Motivation

Computer science is fundamentally about computational problem solving.
Programming and computers are only tools in the field of computing. The field
has tremendous breadth and diversity. Areas of study include:
3
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons Section 1.1 What is Computer Science?
• Software Engineering
• Database Management / Data Mining
• Computer Networks
• Computer Graphics
• Computer Simulation
• Information Security
• Programming Language Design
• Systems Programming
• Computer Architecture
• Human–Computer Interaction
• Robotics
• Artificial Intelligence
What is Computer Science?

Computational Problem Solving
Two things that are needed to perform
computational problem solving:
• a representation that captures all the
relevant aspects of the problem
• an algorithm that solves the problem
by use of the representation
4
Thus, computational problem solving finds a solution within a
representation that translates into a solution for what is being represented.

The Use of Abstraction in
A representation that leaves out detail of what is being represented is
a form of abstraction.
Abstraction is prevalent in the everyday world. For example, maps are
abstract representations.
5

6
Below is the original 1908 map of the London Underground (Subway).

7
Below is a more abstract, but topologically correct, map of the London Underground
subway system. It shows the bends and curves of each track.
This map contains too much information for its purpose—that is, to find out where
each subway line leads, and where the connections are between lines.

8
Below is a more abstract representation of the subway system, developed
by Harry Beck in 1931. The track lines are straightened out where the track
curves are irrelevant for subway riders. This is a simpler, easier to read, and
thus a better representation for its purpose.

9
This particular abstraction is still in use today.
Washington D.C. Metro Map

10
An interesting form of abstraction is the creative work of Chris Jordan,
which allows the viewer to control the degree of abstraction of the work.

11
Cans Seurat, 2007 60x92“ Copyright Chris Jordan
Depicts 106,000 aluminum cans, the number used in the U.S. every thirty seconds.

12
Clicking on the image causes the picture to zoom in, showing more detail.
(Copyright Chris Jordan)

13
Zooming in closer …

14

15
www.chrisjordan.com/current_set2.php
More
Images

Abstraction in Computing
Abstraction is intrinsic to computing and computational problem
solving.
• The concept of “1s” and “0s” in digital computing is an abstraction
digital information is actually represented as high or low voltage
levels, magnetic particles oriented one of two ways, pits on an optical
disk, etc.
• Programming languages are an abstraction
the instructions and data of a computer program is an abstract
representation of the underlying machine instructions and storage
• Programming design involves the use of abstraction
programs are conceptualized as various modules that work together
16

Man, Cabbage, Goat, Wolf Problem
17
A man lives on the east side of a river. He wishes
to bring a cabbage, a goat, and a wolf to a village
on the west side of the river to sell. However, his
boat is only big enough to hold himself, and
either the cabbage, goat, or wolf. In addition,
the man cannot leave the goat alone with the cabbage because the goat will eat
the cabbage, and he cannot leave the wolf alone with the goat because the wolf
will eat the goat. How does the man solve his problem?

18
There is a simple algorithmic approach for solving this problem by simply trying all
possible combinations of items that may be rowed back and forth across the river.
Trying all possible solutions is referred to as a brute force approach.
What would be an appropriate representation for this problem? Whatever
representation we use, only the aspects of the problem that are relevant for its
solution need to be represented.
• Color of the boat?
• Name of the man?
• Width of the river?
The only information relevant for this problem is where each particular item is at
each step in the problem solving. Therefore, by the use of abstraction, we define a
representation that captures only this needed information.

19
For example, we could use a sequence to indicate where each of the objects
currently are,
man cabbage goat wolf boat village
[ e a s t , w e s t , e a s t , w e s t , e a s t , w e s t ]
where it is understood that the first item in the sequence is the location of the man,
the second the location of the cabbage, etc.
Note that the village is always on the west side of the river—it doesn’t move! Its
location is fixed and therefore does not need to be represented.
Also, the boat is always in the same place as the man. So representing the location of
both the man and the boat is redundant information. The relevant, minimal
representation is given below,
man cabbage goat wolf
[ E , W , E , E ]

20
The actual problem is to determine how the man can row objects across the river,
with certain constraints on which pairs of objects cannot be left alone.
The computational problem is to find a way to convert the representation of the
start state of the problem, when all the object are on the east side of the river,
[ E , E , E , E ]
to the goal state with all objects on the west side of the river,
[ W , W , W , W
with the constraint that certain invalid states should never be used.
Thus, in a computational problem solving approach, a problem is solved within the
representation used, in which the solution within the representation must
translate into a solution of the actual problem.

21
For example, from the start state, there are three possible moves that can be
made, only one of which results in a valid state.
[ E , E , E , E ] START STATE
[ W , W , E , E ] [ W , E , W , E ] [ W , E , E , W ]
Man rows cabbage across Man rows goat across Man rows wolf across
INVALID STATE
Goat left alone with wolf
VALID STATE
Cabbage left alone with wolf
INVALID STATE
Cabbage left alone with goat


22
We check if the new problem state is the goal state. If true, then we solved the
problem in one step! (We know that cannot be so, but the algorithmic approach that
we are using does not.)
[ E , E , E , E ] START STATE
[ W , E , W , E ]
Man rows goat across 
Is goal state [ W , W , W , W ] ? No
Therefore we continue searching from the current state.

23
Since the man can only row across objects on the same side of the river, there are
only two possible moves from here,
man cabbage goat wolf INTERMEDIATE
[ W , E , W , E ] STATE
[ E , W , E , E ] [ E , E , E , E ]
Man rows back alone Man rows goat across
VALID STATE
Cabbage left alone with wolf
 VALID STATE
BUT, previously in this state. It is
the start state. No progress made!


24
This would continue until the goal state is reached,
[ E , W , E , E ]
[ W , W , W , W ] GOAL STATE
Thus, the computational problem of generating the goal state from the start state
translates into a solution of the actual problem since each transition between
states has a corresponding action in the actual problem—of the man rowing across
the river with (or without) a particular object.
.
.

The Importance of Algorithms
25
As another example computational problem,
suppose that you needed to write a program
that displays a calendar month for any given
month and year.
The representation of this problem is rather
straightforward. Only a few values are
needed:
• the month and year
• number of days in each month
• names of the days of the week
• day of the week that the first day of the month falls on

26
The month and year, number of days in a month, names of the days of the week can
be easily handled. The less obvious part is how to determine the day of the week
that a particular date falls on.
How would you do that?
Start with a known day of the week for a given year in the past and
calculate forward from there?
That would not be a very efficient way of solving the problem.
Since calendars are based on cycles, there must be a more direct method for doing
this. Thus, no matter how good a programmer you may be, without knowledge of
the needed algorithm, you could not write a program that solves the problem.

The Limits of
27
Once an algorithm for a given problem is developed or found, an important question is
“Can a solution to the problem be found in a reasonable amount of time?”
“But aren’t computers very fast, and getting faster all the time?”
Yes, but some problems require an amount of time to compute a solution that is
astronomical compared to the capabilities of current computing devices.
A classic problem in computer science that demonstrates this is the Traveling
Salesman problem.

The Traveling Salesman Problem
28
A salesman needs to visit a
set of cities. He wants to find
the shortest route of travel,
starting and ending at any
city for a given set of cities,
what route should he take?
The algorithm for solving this problem is a simple one. Determine the lengths of all
possible routes that can be taken, and find the shortest one. That is, by using a
brute force approach. The computational issue, therefore, is for a given set of
cities, how many possible routes are there?

29
If we consider a route to be a specific sequence of names of cities, then how many
permutations of that list are there?
New York, Boston, Chicago, San Francisco, Los Angeles, Atlanta
New York, Boston, Chicago, San Francisco, Atlanta, Loa Angeles
New York, Boston, Chicago, Los Angeles, San Francisco, Atlanta
etc.
Mathematically, the number of permutations for n entities is n! (n factorial).
How big a number is that for various number of cities?

30
Below are the number of permutations (and this number of routes) there are for
varies numbers of cities:
Ten Cities 10! 3,628, 800 (over three million)
Twenty Cities 20! 2,432,902,008,176,640,000
Fifty Cities 50! Over 1064
If we assume that a computer could compute the routes of one million cities per
second:
• for twenty cities, it would take 77,000 years
• for fifty cities, it would take longer than the age of the universe!

The Game of Chess
31
When a computer plays chess against a human
opponent, both have to “think ahead” to the
possible outcomes of each move it may make.
A brute force approach can also be used for a
computer playing a game of chess. A program
can consider all the possible moves that can be
made, each ending in a win, loss, or draw.
It can then select the move that leads to the most number of ways of winning.
(Chess masters, on the other hand, only think ahead a few moves, and
“instinctively” know the value of each outcome.)

32
There are approximately 10120 possible chess games that can be played. This is
related to the average number of look-ahead steps needed for deciding each move.
There are approximately,
1080 atoms in the observable universe
and an estimated
3 × 1090 grains of sand to fill the universe solid
Thus, there are more possible chess games that can be played than grains of sand
to fill the universe solid!
Therefore, for problems such as this and the Traveling Salesman problem in which a
brute-force approach is impractical to use, clever and more efficient problem-solving
methods must be discovered that find either an exact or an approximate solution to
the problem.

0

An algorithm is a finite number of clearly
described, unambiguous “doable” steps
that can be systematically followed to
produce a desired result for given input in
a finite amount of time (that is, it
eventually terminates).
The word “algorithm” is derived from the
ninth-century Arab mathematician, Al-
Khwarizmi who worked on “written
processes to achieve some goal.”
40
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons Section 1.2 Computer Algorithms
Computer Algorithms

Computer algorithms are central to computer science. They provide
step-by-step methods of computation that a machine can carry out.
Having high-speed machines (computers) that can consistently follow a
given set of instructions provides a reliable and effective means of
realizing computation. However, the computation that a given computer
performs is only as good as the underlying algorithm used.
Because computers can execute a large number of instructions very
quickly and reliably without error, algorithms and computers are a
perfect match!
41
Algorithms and Computers: A Perfect Match

An algorithm for computing the greatest common denominator (GCD)
of two given integers. It is one of the oldest numerical algorithms still in
common use.
1. Assign M the value of the larger of the two values.
2. Divide M by N, call the remainder R.
3. If R is not 0, then assign M the value of N, assign N the value of R, and
go to step 2.
4. The greatest common divisor is N.
42
Euclid’s Algorithm
One of the Oldest Known Algorithms

Finding the GCD of 18 and 20
1. Assign M the value of the larger of the two values, and N the smaller.
M  20 N  18
43
Example Use

Finding the GCD of 18 and 20
M  20 N  18
M/N = 20 / 18 = 1, with R  2
44
Example Use

Finding the GCD of 18 and 20 (first time through, second time through)
M  20 N  18
M/N = 20 / 18 = 1, with R  2
M/N = 18 / 2 = 9, with R  0
3. If R is not 0, assign M the value of N, assign N the value of R, and go to step 2.
R = 2. Therefore, M  18, N  2. Go to step 2.
45
Example Use

M  20 N  18
M/N = 20 / 18 = 1, with R  2
M/N = 18 / 2 = 9, with R  0
R is 0. Therefore, proceed to step 4.
46
Example Use

M  20 N  18
M/N = 20 / 18 = 1, with R  2
M/N = 18 / 2 = 9, with R  0
R is 0. Therefore, proceed to step 4.
4. The greatest common divisor is N.
GCD = N = 2
47
Example Use

48
Animation of Euclid’s Algorithm

49
Following is an example algorithm for
determining the day of the week for any date
between January 1, 1800 and December 31, 2099

50

51
Notable Contemporary Algorithms

The sequencing of the human genome was dependent on the
development of fast, efficient comparing and matching of DNA
sequences.
52
BLAST Algorithm

The RSA algorithm is the basis of public key encryption. It requires the
factorization of large prime numbers to break, which for large enough
primes, is considered impossible. It is the method used for secure web
communication.
53
RSA Algorithm

Computer hardware comprises the physical part of a computer system. It
includes the all-important components of the central processing unit
(CPU) and main memory. It also includes peripheral components such as
a keyboard, monitor, mouse, and printer.
60
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons Section 1.3 Computer Hardware
Computer Hardware

Digital Computing: It’s All About Switches
It is essential that computer hardware be reliable and error free. If the
hardware gives incorrect results, then any program run on that hardware
may give incorrect results as well.
The key to developing reliable systems is to keep the design as simple
as possible. In digital computing, all information is represented as a
series of digits.
61

Decimal Digitalization
In electronic computing, values are represented by discrete voltage
levels. Suppose that the computer represented numbers as we are used
to, in base ten.
62

Each digit is represented by a different voltage level. The more voltage
levels (digits) that the hardware must utilize and distinguish, the more
complex the hardware becomes to design. This results in greater chance
of hardware design errors.
63

Information Theory
The Fundamental Theorem of Information
Science of Claude Shannon states that all
information can be represented by the use
of only two symbols, 0 and 1. This is
referred to as binary representation.
Shannon is known as the “Father of
Information Theory.”
64

Binary Digitalization
In this representation, each digit can be one of only two possible values,
similar to a light switch that can be either on or off. Computer hardware,
therefore, is based on the use of simple electronic on/off switches called
transistors that can switched at essentially the speed of light.
65

The Transistor
The transistor, developed in 1947, revolutionized electronics. Its
invention is what has allowed for all of the dramatic advances in
computing technology that we continue to see today.
66

Integrated Circuits
Integrated circuits (chips), the building blocks of computer hardware, are
comprised of millions or even billions of transistors.
67

The Binary Number System
For representing numbers, any base (radix) can be used. For example, in
base 10, there are ten possible digits (0, 1, ..., 9), in which each column
value is a power of ten:
10,000,000 1,000,000 100,000 10,000 1,000 100 10 1
107 106 105 104 103 102 101 100
9 9 = 99
68

For representing numbers in base 2, there are two possible digits (0, 1)
in which each column value is a power of two:
128 64 32 16 8 4 2 1
27 26 25 24 23 22 21 20
0 1 1 0 0 0 1 1
0 + 64 + 32 + 0 + 0 + 0 + 2 + 1 = 99
69
Although values represented in base 2 are significantly longer than those in
base 10, binary representation is used in digital computing because of the
resulting simplicity of hardware design.

Bits and Bytes
Each binary digit is referred to as a bit. A group of (usually) eight bits is
called a byte. Converting a base ten number to base two involves the
successive division of the number by 2.
70

Fundamental Hardware Components
Central processing unit (CPU) – the “brain” of a computer system.
Interprets and executes instructions.
Main memory – is where currently executing programs reside.
It is volatile, the contents are lost when the power is turned off.
Secondary memory – provides long-term storage of programs and data.
Nonvolatile, the contents are retained when power is turned off. Can be
magnetic (hard drive), optical (CD or DVD), or flash memory (USB drive).
Input/output devices – mouse, keyboard, monitor, printer, etc.
Buses – transfer data between components within a computer system.
System bus (between CPU and main memory).
71

72

Operating Systems
An operating system is software that manages and interacts
with the hardware resources of a computer.
Because an operating system is intrinsic to the operation of a
computer, it is referred to as system software.
73

74

Operating systems also provide a particular user interface.
It is the operating system installed on a given computer that
determines the “look and feel” of the user interface and how
the user interacts with the system, and not the particular
model computer.
75

Limits of Integrated Circuits
Technology: Moore’s Law
In 1965, Gordon E. Moore, one of the pioneers in the
development of integrated circuits and cofounder of Intel
Corporation, predicted that the number of transistors that
would be able to be put on a silicon chip would double
roughly every two years, allowing the complexity and
therefore the capabilities of integrated circuits to grow
exponentially. This prediction became known as Moore’s
Law.
76

Amazingly, to this day that
prediction has held true.
While this doubling of
performance cannot go on
indefinitely, it has not yet
reached its limit.
77

78

79

80

81

82

83

84

85

86

What is computer software?
Computer software is a set of program instructions,
including related data and documentation, that can be
executed by computer. This can be in the form of instructions
on paper, or in digital form.
While system software is intrinsic to a computer system,
application software fulfills users’ needs, such as a photo-
editing program.
87
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons Section 1.4 Computer Software
Computer Software

The First Computer Programmer
The first computer programs ever
written were for a mechanical
computer designed by Charles
Babbage in the mid-1800s. The
person who wrote these
programs was a woman, Ada
Lovelace, who was a talented
mathematician. Thus, she is
referred to as “the first computer
programmer.”
88

Syntax, Semantics and
Program Translation
Programming languages (called “artificial languages”) are
languages just as “natural languages” such as English and
Mandarin (Chinese). Syntax and semantics are important
concepts that apply to all languages.
89

The syntax of a language is a set of characters and the acceptable
sequences (arrangements) of those characters.
English, for example, includes the letters of the alphabet,
punctuation, and properly spelled words and properly punctuated
sentences. The following is a syntactically correct sentence in
English,
“Hello there, how are you?”
The following, however, is not syntactically correct,
“Hello there, hao are you?”
The sequence of letters “hao” is not a word in the English language.
90
Syntax

The semantics of a language is the meaning associated with each
syntactically correct sequence of characters.
Consider the following sentence:
“Colorless green ideas sleep furiously.”
This sentence is syntactically correct, but has no meaning. Thus, it is
semantically incorrect.
Every language has its own syntax and semantics.
91
Semantics

For example, in English “Hao” is syntactically incorrect. In Mandarin
(Chinese), however, “Hao” is a valid word meaning “good.” (“Hao”
is from a system called pinyin, which uses the Roman alphabet
rather than Chinese characters for writing Mandarin.)
92

Program Translation
A central processing unit (CPU) is designed to interpret and
execute a specific set of instructions represented in binary
form (i.e., 1s and 0s) called machine code. Only programs in
machine code can be executed by a CPU.
93

Writing programs at this “low level” is tedious and error-
prone. Therefore, most programs are written in a “high-level”
programming language such as Python. Since the instructions
of such programs are not in machine code that a CPU can
execute, a translator program must be used.
There are two fundamental types of translators:
• Compiler translates programs into machine code
to be executed by the CPU
• Interpreter executes instructions in place of the CPU
94

95
Compiler
Compiled programs generally execute faster than interpreted programs.

96
Interpreter
An interpreter can immediately execute instructions as they are
entered. This is referred to as interactive mode. This is a very useful
feature for program development. Python, as we shall see, is executed
by an interpreter.

97
Program Debugging:
Syntax Errors vs. Semantic Errors
Program debugging is the process of finding and correcting errors
(“bugs”) in a computer program. Programming errors are inevitable
during program development.
Syntax errors are caused by invalid syntax (for example, entering prnt
instead of print).
Since a translator cannot understand instructions containing syntax
errors, translators terminate when encountering such errors indicating
where in the program the problem occurred.

98
In contrast, semantic errors (generally called logic errors ) are errors in
program logic. Such errors cannot be automatically detected, since
translators cannot understand the intent of a given computation.
For example, if a program computed the average of three numbers as
follows,
(num1 + num2 + num3) / 2.0
a translator would have no means of determining that the divisor should
be 3 and not 2. Computers do not understand what a program is meant
to do, they only follow the instructions given. It is up to the
programmer to detect such errors.
Program debugging is not a trivial task, and constitutes much of the time
of program development.

99
In 1947, engineers working on the Mark II
computer at Harvard University found a
moth stuck in one of the components,
causing the machine to malfunction. They
taped the insect in their logbook and
labeled it “first actual case of bug being
found.” It has become a standard part of
the language of computer programmers.
The log book, complete with the attached
bug, is on display at the Smithsonian
Institution in Washington, D.C.
The First Actual Computer “Bug”

100
Programming languages fall into a number of programming paradigms. The
two major programming paradigms in use today are procedural
(imperative) programming and object-oriented programming. Each provides
a different way of thinking about computation. While most programming
languages only support one paradigm, Python supports both procedural and
object-oriented programming. We will start with the procedural aspects of
Python.
Procedural vs. Object-Oriented
Programming

101

102

103

104

105

106

107

108

109

Computational problem solving does not simply involve the
act of computer programming. It is a process, with
programming being only one of the steps.
Before a program is written, a design for the program must
be developed. And before a design can be developed, the
problem to be solved must be well understood. Once
written, the program must be thoroughly tested.
110
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons Section 1.5 Computational Problem Solving
The Process of

111
Computational Problem Solving Steps

112
Problem Analysis
Must understand the fundamental
computational issues involved
• For calendar month problem, can use direct
calculation for determining the day of the week for
a given date
• For MCGW problem, can use brute-force approach
of trying all of the possible rowing actions that may
be taken
• For the Traveling Salesman and Chess playing
problems, a brute-force approach is intractable.
Therefore, other more clever approaches need to
be tried

113
Knowing what constitutes a solution.
For some problems, there is only one solution. For others, there may be a
number (or infinite number) of solutions. Thus, a problem may be stated as
finding,
• A solution (calendar month, chess playing)
• An approximate solution
• A best solution (MCGW, Traveling Salesman Problem)
• All solutions

114
Describe Data and Algorithms
• For calendar month problem, need to store the month and year,
the number of days in each month, and the names of the days of
the week
• For the MCGW problem, need to store the current state of the
problem (as earlier shown)
• For Traveling Salesman need to store the distance between every
pair of cities
• For the chess playing problem, need to store the configuration of
pieces on a chess board

115
Table Representation of Data for the
Traveling Salesman Problem
Note that only half of the table need be stored

116
Representation for Chess Playing Program
Although the representation on the left is intuitive, the one on the
right is more appropriate for computational problem solving.

117
Describing the Algorithms Needed
When solving a computational problem, either suitable existing
algorithms may be found, or new algorithms must be developed.

118
For the MCGW problem, there are standard search algorithms that
can be used.
For the calendar month problem, a day of the week algorithm
already exists.
For the Traveling Salesman problem, there are various (nontrivial)
algorithms that can be utilized for solving problems with tens of
thousands of cities.
Finally, for the chess playing, since it is infeasible to look ahead at
the final outcomes of every possible move, there are algorithms
that make a best guess at which moves to make. Algorithms that
work well in general but are not guaranteed to give the correct
result for each specific problem are called heuristic algorithms.

119
Program Implementation
Design decisions provide general details of the data representation
and the algorithmic approaches for solving a problem. The details,
however, do not specify which programming language to use, or
how to implement the program. That is a decision for the
implementation phase.
Since we are programming in Python, the implementation needs to
be expressed in a syntactically correct and appropriate way, using
the instructions and features available in Python.

120
Program Testing
Writing computer programs is difficult and challenging. As a result,
programming errors are pervasive, persistent and inevitable.
Given this fact, software testing is a crucial part of software
development. Testing is done incrementally as a program is being
developed, when the program is complete, and when the program
needs to be updated.

121
Truisms of Software Development
1. Programming errors are pervasive, persistent, and inevitable.
2. Software testing is an essential part of software development.
3. Any changes made in correcting a programming error should be
fully understood as to why the changes correct the detected error.

122
The Python Programming Language was
created by Guido van Rossum. It was first
released in the early 1990s.
Its name comes from a 1970s British
comedy sketch show called Monty
Python’s Flying Circus (The Argument Clinic).
Companies and organizations that use
Python include YouTube, Google, Yahoo
and NASA.
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons Section 1.6 Python Programming Language
The Python Programming
Language

Python Features
123
• Simple Syntax
Python programs are clear and easy to read
• Interpreted Language
Python instructions can be executed interactively
• Powerful Programming Features
Can accomplish significant computation with few instructions
• Numerous Python Modules Provide Additional Capabilities
Capabilities that can be incorporated into a Python program

The IDLE Python
Development Environment
124
IDLE is an integrated development environment (IDE). An IDE is a bundled
set of software tools for program development. This typically includes,
• an editor
for creating and modifying programs
• a translator
for executing programs, and
• a program debugger
for taking control of the execution of a program
to aid in finding program errors

The Python Shell
125
Python can be executed interactively in the Python shell. In this mode,
executing Python is similar to using a calculator.
The >>> symbol is the shell prompt. Here, typing 2 + 3 at prompt outputs
the result 5, again displaying the prompt in wait of another instruction.

The Python Standard Library
126
The Python Standard Library is a collection of built-in modules, each
providing specific functionality beyond what is included in the “core” part
of Python.
For example, the math module provides additional mathematical functions.
The random module provides the ability to generate random numbers,
useful in programming, as we shall see.
Other Python modules are described in the Python 3 Programmers’
Reference.

Importing a Library Module
127
In order to utilize the capabilities of modules in a specific program, an
import statement is used as shown.

128
Because the factorial function is from the math module, the function is
called with the name of the module prepended:
e.g., math.factorial(20)

A Bit of Python
129
We introduce a bit of Python, just enough to begin writing some simple
programs.
Since all computer programs,
• input data
• process the data
• output results
we look at the notion of a variable, how to perform some simple arithmetic
calculations, and how to do simple input and output.

Variables
130
One of the most fundamental concepts in programming is that of a variable.
A variable is “a name that is assigned to a value,” as shown below,
n = 5 variable n is assigned the value 5
Thus, whenever variable n appears in a calculation, it is the current value of
n is that is used, as in the following,
n + 20 (5 + 20)
If variable n is assigned a new value, then the same expression will produce
a different result,
n = 10
n + 20 (10 + 20)

Some Basic Arithmetic Operators
131
The common arithmetic operators in Python are,
+ (addition) * (multiplication) ** (exponentiation)
- (subtraction) / (division)
Addition, subtraction, and division use standard mathematical notation,
10 + 20 25 - 15 20 / 10
(Also, // for truncated division, discussed later)
For multiplication and exponentiation, the asterisk (*) is used,
5 * 10 (5 times 10) 2 ** 4 (2 to the 4th power)
Multiplication is never denoted by the use of parentheses,
10 * (20 + 5) CORRECT 10(20 + 5) INCORRECT
Note that parentheses may be used to denote subexpressions.

Basic Input
132
The programs that we will write request and get information from the user.
In Python, the input function is used for this purpose,
name = input('What is your name?: ')
Characters within quotes are called strings. This particular use of a string, for
requesting input from the user, is called a prompt.
The input function displays the string on the screen to prompt the user for
input,
What is your name?: Charles
The underline is used here to indicate the user’s input.

Basic Output
133
The print function is used to display information on the screen in Python.
This may be used to display a message (string),
>>> print('Welcome to My First Program!')
Welcome to My First Program!
or used to output the value of a variable,
>>> n = 10
>>> print(n)
10

134
Can also display a combination of strings and variables,
>>> name = input('What is your name?: ')
What is your name?: Charles
>>> print('Hello', name)
Hello Charles
Note that a comma is used to separate the individual items being printed,
which causes a space to appear between each when displayed. Thus, the
output of the print function in this case is
Hello Charles
and not
HelloCharles
We will soon learn more about variables, operators, and input/output in
Python.

Using IDLE
135
In order to become familiar with writing your own Python programs using
IDLE, we will create a simple program that asks the user for their name and
responds with a greeting. This program utilizes the following concepts:
➤ Creating and executing Python programs
➤ Input and print functions

Creating a New Python Program
136
To create a Python program file, select New Window from the File menu in
the Python shell,

137
A new, untitled window will appear,

138
Now can begin entering lines of a program without them being immediately
executed, as in the Python shell.
Note that parts of the program lines are displayed in a certain color. Since
print and input are predefined function names in Python, they are
colored purple. The strings in the program are colored green. The statement
in red is a comment statement. Comment statements are for those reading
the program, and are ignored when the program is executed.

139
When finished, save the program file by selecting Save As under the File
menu, and save in the appropriate folder with the name MyFirstProgram.py.

140
To run a Python program, select Run Module from the Run menu (or simply
hit function key F5).
Executing a Python Program

141
If you have entered the program code correctly, the program should execute
as shown
If, however, you have mistyped part of the program resulting in a syntax
error (such as mistyping print), you will get an error message.

142
In such instances, you need to go back to the program window and make the
needed corrections, the re-save and re-execute the program. You may need
to go through this process a number of times until all the syntax errors have
been corrected.

143
Dr. Frank Drake conducted the first search for
radio signals from extraterrestrial civilizations
in 1960. This established SETI (Search for
Extraterrestrial Intelligence), a new area of
scientific inquiry. In order to estimate the
number of civilizations that may exist in our
galaxy that we may be able to communicate
with, he developed what is now called the
Drake equation.
Introduction to Computer Science Using Python – Dierbach Copyright 2013 John Wiley and Sons Section 1.7 A First Program – Drake Equation
A First Program
Calculating the Drake Equation

144
The Drake equation accounts for a number of different factors. Some of the
values are the result of scientific study, while others are only the result of an
“intelligent guess.” The factors consist of,
R, the average rate of star creation per year in our galaxy
p, the percentage of those stars that have planets
n, the average number of planets that can potentially support life for each star with planets
f, the percentage of those planets that actually go on to develop life
I, the percentage of those planets that go on to develop intelligent life
c, the percentage of those that have the technology communicate with us and
L, the expected lifetime of civilizations (the period that they can communicate).
The Drake equation is simply the multiplication of all these factors, giving N,
the estimated number of detectable civilizations there are at any given time,
N = R * p * n * f * i * c * L

145
The following table shows those parameters in the Drake equation that have
some consensus as to their correct value, as well as the values that Drake
himself has used.

The Problem
146
The value of 7 for R, the rate of star creation, is the least disputed value in
the Drake equation today.
Given the uncertainty of the remaining factors, develop a program that
allows a user to enter their own estimated values for the remaining six
factors (p, n, f, i, c, and L) and displays the calculated result.

Problem Analysis
147
The problem is very straightforward. We only need to understand the
equation provided.

Program Design
148
The program design for this problem is straightforward. The data to be
represented consist of numerical values, with the Drake equation as the
algorithm.

149
The Overall Steps of the Program

Program Implementation
150
The implementation of this program is fairly simple. The only programming
elements needed are input, assignment, and print, along with the use of
arithmetic operators.

151

152
Executable Section of the Program

Python Issues to Point Out
153
• Comment statements are used, starting with a hash (#) sign
• Comments at the start of the program give an overall description
• Comments within code serve as section headers
• Print function is used for program welcome (Iines 26-29)
• Empty print function call causes a skipped line on the screen (line 44)
• Print function also used to display results (lines 45-47)
• Input function is used for getting factors from user for Drake Equation
• The input function always returns a string value
• int(input('……')) used to convert input string to an integer value

Example Execution
154

Program Testing
155
To test the program, we can calculate the Drake equation for various other
values using a calculator, providing a set of test cases.
A test case is a set of input values and expected output of a given program.
A test plan consists of a number of test cases to verify that a program meets
all requirements.
A good strategy is to include “average,” as well as “extreme” or “special”
cases in a test plan.

Test Plan (with results)
156

Python programming Introduction about Python

Recommended

More Related Content

Similar to Python programming Introduction about Python (20)

More from Senthil Vit (20)

Recently uploaded (20)

Python programming Introduction about Python