Download lect01

Business Programming I
Fall – 2000
By
Jim Payne
Links: Early History of Computers
Virginia Tech – History of Computing
Virtual Museum of the United Kingdom
Smithsonian Museum - Computers
Lecture 01
Jim Payne - University of Tulsa
2
History of Computing Devices
Ancient Counting Devices
notches, knots,
pebbles, stone counting tablets
Napier’s Bones and Gunter’s Slide Rule
Charles Babbage – Grandfather of Computing
Hollerith’s Tabulating Machine
Howard Aiken’s – Harvard - MARK I
Lecture 01
Jim Payne - University of Tulsa
3
The Electronic Revolution
John Atanasoff and Clifford Berry - @ Iowa
State University – The ABC Machine (1st fully
electronic computer) Father of Modern Computing
The ENIAC – Mauchly / Eckert
VonNeumann’s Contributions
The UNIVAC - Remember 1951, 1952, 1954
Lecture 01
Jim Payne - University of Tulsa
4
Electronic Computers
Generations of Computers





Lecture 01
First Generation – Vacuum Tubes 1950’s
Second Generation – Transistors 1959
Third Generation - Integrated Circuits 1964
Ted Hoff, Mazor, and Fagin develop the Intel 4004
microprocessor “Computer on a Chip” It could
process 60,000 instructions per second - $300
Fourth Generation - LSIC’s
Large Scale Integrated Circuits 1971
Jim Payne - University of Tulsa
5
Types of Programs
Operating Systems

Windows, System 8, Unix
Utility Programs

Scandisk, Sorting, Virus Scanner
Application Programs

Lecture 01
MS-Word, MS-Excel, Payroll Program in COBOL
Jim Payne - University of Tulsa
6
Types of Languages
Machine Languages

1100000110101100010110100010101010
Assembler Languages
INP
MPY
STA
OUT
A
B
C
C
High Level Languages

Lecture 01
FORTRAN, COBOL, PASCAL, C, JAVA, VISUAL BASIC
Jim Payne - University of Tulsa
7
History of Languages
Charles Babbage – 1833
Link: Babbage biography



Difference Engine
Analytical Engine
Babbage’s Model
Difference Engine
Lecture 01
Jim Payne - University of Tulsa
8
Babbage’s Model
PRIMARY
MEMORY
INPUT
CONTROL UNIT
OUTPUT
ARITHMETIC
UNIT
Lecture 01
PROBLEM:
ANSWER = A + B * C
Jim Payne - University of Tulsa
9
Babbage’s Model
PRIMARY
MEMORY
A,B,C
A=3
B=4
CONTROL UNIT
ARITHMETIC
UNIT
ANSWER
ANSWER =
14 or 11 ?
C=2
Lecture 01
PROBLEM:
ANSWER = A + B * C
Jim Payne - University of Tulsa
10
Order of Operations Rules
If parentheses are present, resolve
them first (then or otherwise)
Precedence Rules:




Lecture 01
Exponentiation First
Multiplication & Division Equal Precedence
Addition & Subtraction Equal Precedence
(items of equal precedence – left to right)
Jim Payne - University of Tulsa
11
Babbage’s Model
Mem:
A 3
B 4
C 2
3,4,2
CU:
INP A,B,C
AU:
Lecture 01
PROBLEM:
ANSWER = A + B * C
Jim Payne - University of Tulsa
12
Babbage’s Model
Mem:
A 3
B 4
C 2
3,4,2
CU: LDA B
AU:
Lecture 01
4
Jim Payne - University of Tulsa
PROBLEM:
ANSWER = A + B * C
13
Babbage’s Model
Mem:
A 3
B 4
C 2
3,4,2
CU:
AU:
Lecture 01
MPY C
4
84
Jim Payne - University of Tulsa
PROBLEM:
ANSWER = A + B * C
14
Babbage’s Model
Mem:
A 3
B 4
C 2
3,4,2
CU:
AU:
Lecture 01
ADD
ADD AA
88
11
Jim Payne - University of Tulsa
PROBLEM:
ANSWER = A + B * C
15
Babbage’s Model
Mem:
C 2
3,4,2
CU:
AU:
Lecture 01
A 3
B 4
D 11
STA D
11
Jim Payne - University of Tulsa
PROBLEM:
ANSWER = A + B * C
16
Babbage’s Model
Mem:
C 2
3,4,2
A 3
B 4
D 11
CU:
11
OUT D
AU:
Lecture 01
Jim Payne - University of Tulsa
PROBLEM:
ANSWER = A + B * C
17
INPUTS:
Problem: A + B * C
Inputs: A,B,C
3,4,2
Program:
ACCUMULATOR:
INP
A,B,C
LDA
B
MPY
C
ADD
A
STA
D
OUTPUT:
OUT
D
11
4
8
11
Contribution by
Babbage’sAssistant
Augusta Ada - Countess of Lovelace
(Lord Byron’s daughter)
Link to biography
She suggested that if they could ever get the
Difference Engine or the Analytical Engine to work
for three values of A,B, and C then a simple GOTO
statement could cause the “program” to work over
and over. “LOOPING”
For this contribution, Ada of Lovelace is often
called the world’s 1st Programmer.
Lecture 01
Jim Payne - University of Tulsa
19
INPUTS:
Problem: A + B * C
Inputs: A,B,C
5,5,4
Program:
ACCUMULATOR:
INP
A,B,C
LDA
B
MPY
C
ADD
A
STA
D
OUTPUT:
OUT
D
25
5
20
25
INPUTS:
Problem: (A + B) * C
Inputs: A,B,C
5,5,4
Program:
ACCUMULATOR:
INP
A,B,C
LDA
A
ADD
B
MPY
C
STA
D
OUTPUT:
OUT
D
40
5
10
40
INPUTS:
Problem: (A + 2) – (B+C)
7,3,4
Inputs: A,B,C
Program:
LDA
A
ADC
2
STA
T1
LDA
B
ADD
C
STA
T2
LDA
T1
SUB
T2
STA
D
OUT
D
ACCUMULATOR:
7
9
3
7
9
2
OUTPUT:
2
Lecture 01
Jim Payne - University of Tulsa
23