Lecture 1 5.

Data types
1. Algorithms a. Attribute of data
a. Any computation performed via 6. Kinds of Data types
set of rules in decimal form a. Integers
b. Representation of a solution to i. Numeric data Items
a problem ii. Positive or Negative
c. Step by step procedure to solve b. Real Number: Fixed Point
a given problem i. Decimal Points
d. Finite step of unambiguous c. Real Number: Floating point
rules that provide solution to i. Numbers which are
the problem held as binary fractions
2. Procedure ii. Used to overcome the
a. Finite sequence of well-defined restrictions placed on
instructions the magnitude of
b. Breaking up the problem numbers
solution into parts d. Character
c. Consist of smaller steps i. Any digits, letters which
d. No ambiguities in the internal coding system
translation is capable of
3. Flowcharts representing
a. For showing the steps involved ii. Enclosed by quotation
in a process marks
b. Diagram made up of boxes, e. Boolean
diamonds, etc. i. Two values: True or
c. Combines symbols and flow False
lines. 7. Data Item
d. Uses symbols to represent the a. Constants
type of operations i. Required to keep values
e. 6 Basic Symbols: throughout the
i. Terminal (Oblong) – program
Starting and Ending b. Variable
ii. Process (Rectangle) – i. Symbolic name
any type of operation / assigned to a data item
computational ii. May change many
iii. Input/output ( )– times during executions
obtain data or output 8. Assignment operation
results a. Used to assign a name to a
iv. Decision (Diamond) – value
ask question True/False 9. Pseudocode
v. Connector (Circle) – a. Tools that can be used to write
allows to be drawn a preliminary plan
without intersecting b. Generic way of describing an
lines algorithm
vi. Predefined Process ( c. Cannot be executed on a real
) – invoke a subroutine computer
4. Computer Lecture 2
a. Has potential for saving 1. Programming Language
time/energy
 a. Set of rules that a way telling a interpretation
computer what operations to accomplished by this
th
perform 6. 4 Generation Languages
b. Set of rules for communicating a. Requires fewer instruction to
an algorithm accomplish task
c. Provides linguistic framework b. Used with databases
d. Notational system for 7. 5th Generation Languages
describing computation a. Functional: Declarative or
e. Tool for developing executable Applicative Languages
models b. Logic: Mathematica Logic, Rule-
f. Has words symbols, and rules of Constraint based
grammar 8. Beyond 5th Generation Languages
2. Syntax a. No clear definition at present
a. Grammatical rules 9.
FIRST PROGRAMMING LANGUAGES WERE
DEVELOPED IN 1950S.
3. 1st Generation Languages
a. Operation Code – addition and
subtraction
b. Operands – identify the data to
be processed
c. Machine Language – machine
dependent
d. Efficient code but difficult to
write
4. 2nd Generation Languages
a. Assembly Languages
i. Symbolic operation
codes replaced binary
ii. are needed to be
“assembled”
iii. Very efficient code and
easier to write
5. 3rd Generation Languages
a. Closer to English but included
mathematical notation
i. Object code – programs
written in source code
to be translated into
machine
ii. Compiler – translation
of source code to object
code is accomplished by
this.
iii. Interpreter –
alternative to
compilation is