Abdul Karim Shahid

([email protected])

1
 What are computers?
 What is software?
 What is programming?
 Why programming?
 Basic Concepts
 Algorithms
 Pseudo code
 Flowcharts
 First C program
 Understanding the steps to write/run programs
 Low and high level programming

Sli
de
2
 Computer
◦ Device capable of performing computations and making logical
decisions
◦ Computers process data under the control of sets of instructions called
computer programs
 Hardware
◦ Various devices comprising a computer
◦ Keyboard, screen, mouse, disks, memory, CD-ROM, and processing
units
 Software
◦ Programs that run on a computer
 System Software
 Application Software

Sli
de
3
Sli
de
4
Sli
de
5
 Tablet
Palmtop
Laptop
Desktop
And many more!!!

Polly Huang, NTU EE 6

 The similarity
◦ Both software

 The distinction
◦ Scope of users

Polly Huang, NTU EE 7

 MS Office
Internet Explorer
Real Player
…

Polly Huang, NTU EE 8

 System software (OS)
◦ Serving all users
◦ I.e., everyone needs it
◦ Known functionalities
 Application software (MS Office)
◦ Serving those users who need the specific
functions
◦ I.e., not everyone needs it
◦ User-specific functionalities

Polly Huang, NTU EE 9

 MS Office
 Internet Explorer
 Real Player

Polly Huang, NTU EE 10

Polly Huang, NTU EE 11
 Can’t talk about them all
◦ Select some
 But which?
◦ Some want to learn this; some want that

Polly Huang, NTU EE 12

Polly Huang, NTU EE 13
Polly Huang, NTU EE 14
Polly Huang, NTU EE 15
 Terminology
 Program composition
 Programming languages
 Programming language classification

Polly Huang, NTU EE 16

 Application
◦ Short for application software
◦ Short for application program

 Programme (noun)
◦ Specific, countable
 Software
◦ General, not countable
◦ Usually meant a collection of programs

Polly Huang, NTU EE 17

 Programme
◦ A set of rules for your computers to follow in
order to achieve a goal
 Programmer
◦ A person who produces the program
◦ A person who makes a living from producing
programs
 Programming language
◦ A way for a programmer to write about the set of
rules

Polly Huang, NTU EE 18

 Computers are creatures from outer space
 They speak strange languages

 Programmers study their languages

 Therefore, they are able to tell the computers
what to do

Polly Huang, NTU EE 19

 Programmers write programs
using programming languages.

Polly Huang, NTU EE 20

Murakami Haruki writes Noruwei No Mori using
Japanese.

Polly Huang, NTU EE 21

Ali writes Hello World
using C.

Polly Huang, NTU EE 22

You write your homepage
using HTML.

Polly Huang, NTU EE 23

Polly Huang, NTU EE 24
 Setting the theme  Defining the problem
 Structuring  Planning the solution
 Writing  Coding the program
 Proof-reading  Testing the program

 Documenting the
program
◦ commenting

Polly Huang, NTU EE 25

 Input
 Output
 Problem to be solved

Polly Huang, NTU EE 26

 Algorithms
◦ Ways of solving the same problem
◦ Some fast; some slow
◦ Some long; some short

 Formats
◦ Pseudo code
◦ Flow chart

Polly Huang, NTU EE 27

• The order of the actions in an algorithm is important
– Example: algorithm to go to work every morning
• Get out of bed;
• Take a bath;
• Get dressed;
• Eat breakfast;
• Take the bus to work.
• If I carry out the same actions in a different order
• Get out of bed;
• Get dressed;
• Take a bath;
• Eat breakfast;
• Take the bus to work.
• Then, I will still get to work, however soaking wet
Sli
So order is important de
28
 However, programming languages can be complex for
students that are starting to learn how to program

 The focus in programming fundamentals is also to learn how

to solve a problem through a computer program

 Therefore, we will introduce the use of pseudo codes and

flowcharts to describe algorithms (solutions of the proposed
problems) and after that, we will learn how to translate them to
a programming language, like C

Sli
de
29
 Flow Lines Connectors
Flow Lines
Connectors
30
  Example: The following set of instructions forms a
detailed algorithm in pseudo-code for calculating the
payment of person.

◦ Begin
◦ Input the three values into the variables Name, Hours, Rate.
◦ Calculate Pay = Hours * Rate.
◦ Display Name and Pay.
◦ End

Slide 31
Sli
de
32
(b) Pseudo code
Place 0 in sum
Place 0 in counter
Enter first number
DOWHILE the number is not equal to 999
Add number to sum
Add 1 to counter
Enter next number or 999
ENDDO
Divide sum by counter to get average
Write the average

Accept series of numbers

and display the average

Polly Huang, NTU EE 33

 A way to solve problems using a computer

 How?
◦ Through a sequence of very clear and defined steps that aim to solve the
problem -> this is called an algorithm

 Algorithms are not only used for computer programming, they

are a general concept for problem solving

Sli
de
34
 Sentence by sentence, word by word
 Detailed description in the chosen language

Polly Huang, NTU EE 35

 Translation – compiler
◦ Translates from source module into object
module
◦ Detects syntax errors
 Link – linkage editor (linker)
◦ Combines object module with libraries to create
load module
◦ Finds undefined external references (run-time
errors)
 Debugging
◦ Run using data that tests all statements
◦ Logic errors

Polly Huang, NTU EE 36

 Source code
◦ Your creation
 Object modules
◦ Machine code of your creation
 Load modules
◦ Machine code of pre-installed functions
 Executable programs
◦ Combination of your and pre-installed machine
code

Polly Huang, NTU EE 37

 Comments within source code
 In plain English
 Convenient for
◦ The programmer him/herself who needs to read the
program later
◦ Somebody else who needs to read the program

Polly Huang, NTU EE 38

Polly Huang, NTU EE 39
 Until now we have used the English language to describe the
algorithms
 Natural languages like English, Russian, Urdu are not
completely formal and many times they are vague or
ambiguous
 The written algorithms used in computers need to be concise,
complete and non-ambiguous, therefore, a formal language is
used to describe them

Sli
de
40
 Generation First Second Third Fourth
1010101001
100010 body.top {
1001101010 color :
Code LDA 34 ADD
000001 x = x + 1 red; font-
example #1 STO 34
1111111110 style :
100010 italic }

(LOW) (LOW) (HIGH) Visual (HIGH) SQL,

Language Machine Assembly Basic, C, pyt CSS, Haskell
Code Code hon etc. etc.
Relation to
Object Code -- one to one one to many one to many
(generally)

Sli
de
41
Sli
de
42
 Machine Language, Assembly Language
and High Level Language
 Three types of programming languages
1. Machine languages
 Strings of numbers giving machine specific instructions. Programs
written in machine language consist of entirely of 1s and 0s
 Example:
00101010 000000000001 000000000010
10011001 000000000010 000000000011
2. Assembly languages
 English-like abbreviations representing elementary computer operations
(translated via assemblers)
 Example:
LOAD BASEPAY
ADD OVERPAY
STORE GROSSPAY
Sli
de
43
Machine Language, Assembly Language
and High Level Language
3. High-level languages
 Codes similar to everyday English
 Use mathematical notations (translated via compilers)
 Example:
grossPay = basePay + overTimePay

Sli
de
44
Sli
de
45
 ‘C’ language was evolved by Dennis Ritchie (1972) from two previous
programming languages, BCPL and B at Bell Labs
 Standard created in 1989 ( American National Standards Institute (ANSI)),
updated in 1999 (International Organization for Standardization (ISO))
 C programs consist of pieces/modules called functions
 A programmer can create his own functions
 Programmers will often use the C library functions
 Use these as building blocks
 Avoid re-inventing the wheel
 C++  A superset of C was developed by Bjarne Stroustrup at Bell Labs
 Object Oriented Design of C++ - Code REUSABILITY
 Because C++ includes C, it’s best to master C then learn C++
 Other object oriented programming languages are: JAVA, COBOL 2002,
FORTRAN 2003 etc Sli
de
46
Sli
de
47
Sli
de
48
Sli
de
49
Sli
de
50
 Program is created in the
Editor Disk editor and stored on disk.
Phases of C Programs:
Preprocessor program
 Edit Preprocessor Disk processes the code.
 Preprocessor
Compiler creates object code
 Compile Compiler Disk and stores it on disk.
 Link
Linker Linker links the object code
 Load Disk with the libraries
 Execute
Loader Physical Loader puts program in
Memory memory.

Disk
CPU takes each instruction
Physical and executes it, possibly
CPU storing new data values as
Memory
the program executes.

Sli
Slide 51 de
51
Sli
de
52
Sli
de
53