This document classifies and describes computer programming languages at different levels:
1. Machine language is the lowest-level language that computers can directly understand as binary code. It is difficult for humans to read and write.
2. Assembly language uses mnemonics instead of binary and requires translation to machine language by an assembler. It is easier for humans than machine language.
3. High-level languages like FORTRAN, COBOL, BASIC, and Pascal use natural language-like syntax that is machine-independent. Source code in these languages requires compilation to machine language. They are easier for humans to write, read and modify than low-level languages.
This document classifies and describes computer programming languages at different levels:
1. Machine language is the lowest-level language that computers can directly understand as binary code. It is difficult for humans to read and write.
2. Assembly language uses mnemonics instead of binary and requires translation to machine language by an assembler. It is easier for humans than machine language.
3. High-level languages like FORTRAN, COBOL, BASIC, and Pascal use natural language-like syntax that is machine-independent. Source code in these languages requires compilation to machine language. They are easier for humans to write, read and modify than low-level languages.
This document classifies and describes computer programming languages at different levels:
1. Machine language is the lowest-level language that computers can directly understand as binary code. It is difficult for humans to read and write.
2. Assembly language uses mnemonics instead of binary and requires translation to machine language by an assembler. It is easier for humans than machine language.
3. High-level languages like FORTRAN, COBOL, BASIC, and Pascal use natural language-like syntax that is machine-independent. Source code in these languages requires compilation to machine language. They are easier for humans to write, read and modify than low-level languages.
This document classifies and describes computer programming languages at different levels:
1. Machine language is the lowest-level language that computers can directly understand as binary code. It is difficult for humans to read and write.
2. Assembly language uses mnemonics instead of binary and requires translation to machine language by an assembler. It is easier for humans than machine language.
3. High-level languages like FORTRAN, COBOL, BASIC, and Pascal use natural language-like syntax that is machine-independent. Source code in these languages requires compilation to machine language. They are easier for humans to write, read and modify than low-level languages.
1. Machine Language - Computer can understand it without translation Program. - Written in binaries( I’s and O’s) - Computer converts them into electiicat signals needed to execute them. - Computer use binary digits to perform any operation. - Difficult for user to read and understand - Advantage – it’s faster in execution since the computer directly starts executing.
Disadvantages of machine language
1. Machine dependent 2. Difficult to program 3. Prone to errors 4. Difficult to modify 5. We rarely use machine language because of difficult and time consuming to do so.
2. Assembly language - Uses symbols (letter - It is a language that allows the use of letters and symbols instead of numbers for representing instructions and storage. - We must convert an assembly program into its equivalent machine language program before executing it on a computer.
Translator (assembler)
It’s a system software that translates an assembly language to machine language.
Assembly input output machine language program
Assembler Language
(Source program) Translator (object program)
N.B: It is after the translation of the source program to object program that execution takes palce. Advantages of assembly language
1. Easy to understand and use
2. Easy to locate and correct errors 3. Easy to modify since its easy to understand ,locate, correct and modify instructions.
Disadvantages of both assembly language and machine language
1. Machine dependent 2. They require programmers to have a good knowledge on programming 3. Iots difficult fghhj 4. Its time consuming 5. its because of this that we rate them to low- level language.
High level languagers
It’s a Programming language that uses natural language
Featuresof high-level programming language
1. They are machine independent.
2. They are easily portable 3. Do not require programmes to know internal structurer 4. Easy to detect and correct errors. 5. Programming language are similar to natural languages e.g natural languages.
High level source program must be transalated first into a form a machine cann easily understand.this is done by use of a compiler.
Compiler
Takes source code as an input and produce the machine language code as output.
High level language compiler machine language program
Program
Source program (object program)
Examples of high-level language
1. FORTRAN (1957) - Stands for FORmular TRANslation - It’s the oldest high-level language - Designed to solve scientific and Engineering problems it has evolved over the years .
it is designed to solve problems that are mathematical in nature
2. COBOL (1959) - Stands for common Business Orientation Language - Designed for business data processing applications. 3. BASIC - Stands for Beginers All Purpose Symbolic Instruction Code. - Objectives of coming up of this language Iteractive languages –allowing direct communication between user and computer. Easy to lern and use it for non-science students. - Programmer can use for programming both business and scientific applications - BASIC was the first programming language to be used in personal cojmputeers. 4. PASCAL - Named after French mathematician Blaise Pascal. - Developed to allow beginners to learn and solve programming - Developed on concept of structured programming.
PROGRAM PLANNING
ALGORITHMS
- Planning a program involves defining the correct sequence and introduction needed to solve . - Algorithm is procedure consisting of a finite set of unambiquoius rules. - Algorithm is the logic of a program
Examples of an algorithm.
Less than 40 E
40 – 49 D
50 – 59 C
60 -69 B
70 and above A
STEP 1: INPUT THE SCDORE OF A STUDENT
STEP 2:if the score is less than 40 the point E
Step 3:if score greater than or equal 40 and less than 55, then print D.
Step 4: if score is greater than 50 and less than 59 then print C
Step 5: if score is greater than 60 and less trhan 65 then print B END
Step 6: if score is 70 and above theN print A
STEP 7: END OF A PROGRAM
Representation of algorithm
Algorithm can be represented using 3 ways
1. As a program 2. As a flow chart 3. As pseudocode
