Lecture 2 - Developing Programming Skills

ENG 202: Computers and Engineering
Object Oriented Programming in PYTHON

LECTURE 2 – Developing Programming Skills
Maurice J. KHABBAZ, Ph.D.

Today
Preliminary Computations,
Programming skills computer system types of knowledge,
development. organization and algorithm
architecture. development.
Aspects of
programming Mathematical
PYTHON basics
languages, language operations.
levels, writing code.
PYTHON variables
and types.
Sunday, January 13, 2019 NDU - ENG 202 - © Maurice J. KHABBAZ, Ph.D. 2
Developing Programming Skills
• Learning to program a computer:
• Training to solve problems in a very detailed and organized manner.
• Intuitive problem solving experience:

This is what this
• Already acquired. course is all about!
• New Requirement: Develop programming skills.

• Write a problem’s solution in terms of actions appropriate for a computer.
Sunday, January 13, 2019 NDU - ENG 202 - Maurice J. KHABBAZ, Ph.D. 3
Computer System Organization Preliminaries
• Computer system is composed of:
• Hardware:
• Physically tangible pieces (e.g. chips, wires, electronic boards, etc.)
• Useless without instructions to tell them what to do.
• Driven by a series of instructions (a.k.a. programs).
• Software:
• Programs and the data those programs use.
• Non-tangible counterpart of hardware.
Basic Computer System Hardware Architecture
• Central Processing Unit (CPU):

• Brain of the computer system.
• Executes program instructions.
• Memory:
• Stores programs and data.
• Input/Output Peripherals:
• Enable human/machine
CPU interaction.
Basic Computer System Hardware Architecture
MEMORY
INPUT OUTPUT
DEVICES DEVICES
CPU
What Does A Computer System Do?
• Essentially, a computer system:
• Performs calculations (i.e. billions of calculations per second).
• Remembers results (i.e. hundreds of Gigabytes of storage).
• What kinds of calculations?

• Built-in to the language.
• Ones that a programmer defines.
Knowledge?
• Computers:
• Only know what we tell them (will remember it as long as we want them to)
• Only do what we instruct them to (more efficiently, quickly and accurately)
Useful program?
Types Of Knowledge
• Declarative Knowledge: statements of facts.
• e.g.: someone will pass this course with an A+.
• Imperative Knowledge: recipe or “how-to”.

• e.g.:
1) People buy LOTO grid cards.
2) Georgio chooses his combination of numbers.
3) Georgio crosses his chosen numbers on the grid.
4) Georgio submits his grid to the LOTO system.
5) LOTO results conform to Georgio’s chosen numbers. Winner!
Types Of Knowledge – Cont’d.
• Numerical Example:
• The square root of a number ! is y such that " × " = !.
• Recipe for deducing square root of a number ! = 16:
1) Start with a guess, '.
2) If ' × ' is close enough to !, stop and say ' is the answer.
( Control of flow!!
3) Otherwise make a new guess by averaging ' and ).
4) Using the new guess, repeat the process until the answer is close enough.
* *×* + +
* +*
*
-
3 9 16/3 = 5.3333 4.17
4.17 17.36 3.837 4.0035
4.0035 16.0277 3.997 4.000002
What is a Recipe?
• A recipe is:
1. It is a sequence of simple steps.
2. Flow of control process that specifies when each step is executed.
3. A mean to determine when to stop.
• Definition: 1. + 2. + 3. = an algorithm.
Writing A Recipe and Implementing A Program
Implementation Phase
Analysis & Develop

Specification Concrete
Solution
Problem-Solving (Program Code)
General Solution
(Algorithm)
Testing
No
Verification
No Code
OK?
OK?
Yes Yes
No Yes
OK?
Maintenance
Programming Shortcut
Problem
Solving
Problem Phase
(Algorithm)
Shortcut?
Implementation
Phase
(Writing Code)
THINK FIRST AND CODE LATER
Algorithm Implementation
Georgio’s
Different Programming Languages
Code
PYTHON Peter’s Code
JAVA Mary’s Code
Algorithm
Different Programmers
C#
C++
Capturing A Recipe In A Mechanical Process?
• To capture a recipe in a mechanical process:
• Fixed program (e.g. calculator).
• Stored program:
• Set of instructions.
• Instructions built from pre-defined set of primitives:
• Arithmetic and logic.
• Simple tests.
• Moving data.
• Instructions are then executed by the machine.
Basic Primitives
• Alan Turing developed the Turing Machine:
• A mathematical model of computation that defines an abstract machine:
• Manipulates symbols on a strip of tape according to a table of rules.
• A Turing machine capable of simulating any algorithm’s logic can be constructed.
• An instruction set/programming language is Turing Complete if:
• It can be used to simulate any Turing machine.
• Turing showed that anything can be computed using six primitives.
• Modern programming languages:
• Have more convenient set of primitives.
• Can abstract methods to create new primitives.
• Anything computable in one language is computable in any other language.
Creating Recipes
• A programming language provides a set of primitive operations.
• Expressions are:
• Complex.
• Legal combinations of primitives in a programming language.
• Expressions and computations have:

• Values.
• Meanings in a programming language.
Aspects of Languages
• Primitive constructs:
• English language: words.
• Programming language: numbers, strings, simple operators.
Aspect of Languages – Cont’d.
• Syntax:
• English language:
• “cat dog human” → not syntactically valid.
• “cat eats human” → syntactivally valid.
• Programming language:
• “hi” * 5 → not syntactically valid.
• 3.2 * 5 → syntactically valid.
Aspects of Languages – Cont’d.
• Static semantics are which syntactically valid strings have meaning.
• English language:
• “I are hungry” → syntactically valid but static semantic error.
• “I am hungry” → syntactically valid and static semantic valid.
• Programming language:
• 3.2 * 5 → syntactically valid.
• 3.2 + “hi” → static semantic error.
Where Things Go Wrong
• Syntactic (a.k.a. syntax) errors:
• Common and easily caught.
• Static semantic errors:
• Some languages check for these before running a program.
• Can cause unpredictable behavior.
• No semantic errors but different than what programmer intended:
• Program may:
• Crash.
• Stop running or runs indefinitely.
• Gives an answer different than the one expected.
Programming Language Levels
• In a computer data is represented by binary electric pulses:
• ON – TRUE – YES →‘1’
• OFF – FALSE – NO →‘0’
• Machine Language:
Low-Level languages
• Primitive operations/instructions are built into each machine.

• Each CPU type has its own language.
• Constructing binary-based instructions is a tedious process prone to errors.
• Assembly Language:
• Short words for commands and data that are still tedious to use.
• High-Level Language:
• Expressed in English-like words/phrases that are easy to read/write.
Programming Language Levels – Cont’d.
High-Level Language Assembly Language Machine Language

a + b ld [%fp-20] %o0 1101000000000111
ld [%fp-20] %o1 1101001000000111
add %o0, %o1 1011111111101000
Program Development
• Software tools involved:
• Editor: used to type a program and store it in a file.
• Compiler: translates code in one language into equivalent in another one.
• Original language → source code.
• Target language → particular machine language.
• Such translation may result in errors.
• Change the code to fix the problem.
• Interpreter: executes the program and evaluates results.
Yes Yes
Edit & Save Compile No Interpret No
Error? Error? DONE
Program Program Program
PYTHON Programs
• PYTHON program: is a sequence of definitions and commands:
• Definitions are evaluated.
• Commands are executed by PYTHON interpreter in a shell.
• Program is:
1. Compiled: translated into bytecode and stored in a file with “.pyc” extension.
• Bytecode (as opposed to Machine Language) is not tied to any particular CPU → portability.
2. Interpreted: executed by the PYTHON interpreter.
• Commands (i.e. statements):
• Instruct the interpreter to do something.
• Typed directly in a shell or stored in a file that is read into the shell and evaluated.
Objects
• Programs manipulate data objects.
• Objects have a type that defines things programs can do to them:

• Georgio is a human so he can walk, speak English, etc.
• Lassy is a dog so it can walk, bark, lick, etc.
• Objects are:
• Scalar (a.k.a. atomic): cannot be subdivided.
• Non-scalar: have an internal structure that can be accessed.
Scalar Objects
• int – represents integers (e.g. 7)
• float – represents real numbers, (e.g. 1.47)
• bool – represents Boolean values (e.g. True and False)
• NoneType – special type that has only one value, None
• Use the command type() to return the type of an object.
• Example:
PYTHON >>> type(5) What is typed at the prompt in a PYTHON shell.
Prompt
int What appears when the ENTER key is pressed.
>>> type(3.0)
float
Type Casting
• Convert an object from one type to another type.
• Examples:
• float(3) converts the integer 3 into a float 3.0
• int(3.9) truncates the float 3.9 so it becomes the integer 3
Printing To Console
• To show code output to a user, use the print command.
• Examples (In PyCharm Console):

>>> 3+2
5
!
>>> print(3+2) rld
Wo pt,
ll ll prom
o
5 p
e
e H she
y
u t to the cur.
o
>>>print(“Hello World!”) y
If ctly i l l oc
dire rror w
Hello World! e
an
Expressions
• Combine objects and operators to form expressions.
• An expression has a value.
• The expression’s value has a type.
• Generic syntax for a simple expression:

<object> <operator> <object>
Operators on int and float Objects
• i+j → the sum
If both i and j are int the result is int.
• i-j → the difference If either one or both of i and j are float the result is float.
• i*j → the product
• i/j → the division The result is always float.
• i%j → the remainder when i is divided by j

• i**j → i raised to the power of j
• Parentheses () used to prioritize operations within them first.
• Operator precedence without ():
• ** → * → / → + and – as they are executed from left to right as they appear.
Binding Variables And Values
• The equal sign (=) is an assignment operator:
• It assigns a value to a variable name (i.e. binds the name to the value).
• Value is stored in the computer’s memory.
• Retrieve the value associated with the variable by invoking its name.
• Example:
ble e
varia valu
>>> pi = 3.14159
>>> pi_approx = 22/7
>>> pi
3.14159
>>> pi_approx.
3.142857142857143
Abstracting Expressions
• Q: Why give names to values of expressions?
• A: to reuse names instead of the values (easier to change code later)
• Example:
>>> pi = 3.14159
>>> radius = 2.2
>>> area = pi*(radius**2)
>>> area
15.205295600000001
Progamming V.S. Math
• In programming, one does not “solve for x”
lu e.
a va
to
ed
uat l is:
• Example: e nt: t, eva 1
g n m righ . us+
i t i
n ass n the he lef rad
u g h a io n o o n t ius=
o s e ad = 1
Thr xpres e nam r
E abl n for s +
>>> pi = 3.14159 •
Var
i
re ssio adiu
•
t e xp r
>>> radius = 2.2 n
i vale
Equ
>>> radius = radius+1
Changing Binding
• Possible to re-bind variable names using new assignment statements.
• Previous value may still be stored in memory but lost its handle:
• It is identical to garbage that is no longer accessible.
• Previous Example:
>>> pi = 3.14159
>>> radius = 2.2
>>> radius = radius+1
• Value of area does not change unless computer is
instructed to recompute it again.

Lecture 2 - Developing Programming Skills

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lecture 2 - Developing Programming Skills

Uploaded by

Copyright:

Available Formats

ENG 202: Computers and Engineering

Object Oriented Programming in PYTHON

Maurice J. KHABBAZ, Ph.D.

• Intuitive problem solving experience:

• New Requirement: Develop programming skills.

• Central Processing Unit (CPU):

• What kinds of calculations?

• Imperative Knowledge: recipe or “how-to”.

Analysis & Develop

THINK FIRST AND CODE LATER

PYTHON Peter’s Code

JAVA Mary’s Code

• Fixed program (e.g. calculator).

• Expressions and computations have:

• Primitive operations/instructions are built into each machine.

High-Level Language Assembly Language Machine Language

• Objects have a type that defines things programs can do to them:

• Examples (In PyCharm Console):

• An expression has a value.

• The expression’s value has a type.

• Generic syntax for a simple expression:

• i%j → the remainder when i is divided by j

You might also like