1. Programming Language
1.1. a system of sign used to communicate a task/algorithm to a computer,causing the task to be performed
1.2. the task to be is called computation,which follows absolutely precise and unambiguous rules
1.3. contains set of instruction,data,and rules that are used to constructs a program
2. Programming Language
2.1. 3 levels of programming language
2.1.1. 1.Machine Language
2.1.1.1. consist of individual instruction that will be execute by the CPU one at a time
2.1.1.2. using binary code
2.1.2. 2.Low Level Language (assembly language)
2.1.2.1. designed for a specific family of processor
2.1.2.2. consists of symbolic instruction directly related to machine language instruction
2.1.3. 3.High Level Language
2.1.3.1. example : C,C++,JAVA and VB
2.1.3.2. designed to eliminate the technicalities of a particular computer
2.1.3.3. statement compiled in a high level language typically generate many low level instruction
3. Machine Language
3.1. the representation of a computer program which is actually read and understood by the computer
3.2. instruction
3.2.1. machine instruction are in binary code
3.2.2. instruction specify operations and memory cell involved in the operation
4. High Level Language
4.1. a programming language which use statement consisting of english like keywords such as "FOR" , "PRINT",or "IF" and etc
4.2. each statement corresponds to several machine language instruction
4.3. much easier to program than in assembly language
4.4. data are reference using descriptive names
4.5. operations can be described using familiar symbols
4.6. example : cost ;=price + tax
5. Programming Application Domain
5.1. scientific application
5.2. business application
5.3. artificial intelligence
5.4. system proggramming
5.5. web software
6. Computer Program
6.1. a set of instruction that the computer needs to follow to process the data info information
6.2. tell the computer,what actions you want the computer to perform the order those actions should happen in
7. Elements of Computer Program
7.1. Input
7.1.1. whatever data that inserted into a computer using input devices
7.1.2. example : mouse,keyboard
7.2. Processing
7.2.1. convert input data into information
7.2.2. example : CPU
7.3. Storage
7.3.1. store data or information for future use(permanently or temporarily)
7.3.2. example : hard disk,memory
7.4. Output
7.4.1. generate the useful information using output devices
7.4.2. example : monitor,printer
8. Assembly Language
8.1. a symbolic of a machine language of a specific processor
8.2. converted to a machine code by an assembler
8.3. one to one correspondence
8.4. programming in assembly language is slow and error prone but is more efficient in terms of hardware performance
8.5. mnemonic representations of the instruction and data
8.6. example : load,price
9. Programming Paradigm
9.1. a model for a class of programming language that share a common characteristic and its differences
9.1.1. Common Programming Paradigm
9.1.1.1. imperative paradigm
9.1.1.1.1. the sequential execution of instruction
9.1.1.1.2. the use of variable representing memory locations
9.1.1.1.3. the use of assignment to change the values of variables
9.1.1.2. object oriented paradigm
9.1.1.2.1. allow programmers to write reusable code that operates in a way that mimics the behavior of objects i the real world
9.1.1.3. the functional paradigm
9.1.1.3.1. based on the abstract notion of a function as studied in the lambda calculus
9.1.2. Imperative Paradigm
9.1.2.1. describe how the computer should achieve solution
9.1.2.2. example : C,Pascal,FORTRAN,ALGO,COBOL
9.1.2.3. key future : , stored memory,mutable variables
9.1.3. Object Oriented Paradigm
9.1.3.1. based on imperative / procedural style with added data and code abstraction and encapsulation
9.1.3.2. a revolutionary concept that changed the rules in computer program development
9.1.3.3. OOP is organized around objects rather actions ,data rather than logic
9.1.3.4. example : smalltalk,C++ and JAVA
9.1.3.5. key future : abstraction,encapsulation,inheritance
9.1.4. Logic Paradigm
9.1.4.1. a declarative and relational style of programming
9.1.4.2. example : Prolog
9.1.4.3. concepts is based on {Horn clauses}
9.1.4.4. based on facts and rules known as { clauses}
9.1.4.5. clauses may contain {logic variable } which take any value necessary to make the fact or the left side of the rule match a goal
9.1.4.6. key future : no mutable variable,statement are logical predicates or assertion,recursion
9.1.5. Functional Paradigm
9.1.5.1. based on the concept of function in mathematics
9.1.5.2. based on Lambda calculus
9.1.5.3. programs written are compacts but run slowly and require a lot of memory
9.1.5.4. example : Haskell,ML,LISP,Scheme
9.1.5.5. key future : no mutable variables,everything is an expression,no iteration,recursive