programing

1. GENERATIONS OF
PROGRAMMING LANGUAGES

2. 2
ACKNOWLEDGEMENT
• I would like to express my sincere gratitude to all those who helped and supported
me in completing this presentation on the Generations of Programming Languages.
• I am especially thankful to my teachers and mentors for their guidance and
encouragement, which helped me understand the concepts clearly.
• I would also like to thank my classmates and friends for their valuable suggestions
and discussions that enriched this work.
• Finally, I thank my family for their constant support and motivation.
• Thank you!

3. AGENDA
PowerPoint presentation on different types
of programming language (including all 5
generations of programming languages.)
with graphical representation of step-by-
step execution of the program, their
processing technique, output generation
and limitations.
3

4. 4
INDEX
• Acknowledgement
• OVERVIEW OF PROGRAMING LANGUAGE GENERATION
• Overview: Step-by-Step Execution of 1st Generation (Machine Language) Program AND
SUMMARY
• Overview: Step-by-Step Execution of second Generation (assembly Language) Program
AND SUMMARY
• Overview: step by step execution of the third-generation language(HIGH LEVEL ) AND
SUMMARY
• Overview: step by step execution of the fourth-generation language (VERY HIGH LEVEL)
AND SUMMARY
• Overview: step by step execution of the fifth-generation language (AI BASED) AND
SUMMARY
• Summary: Processing, Output, and Limitations
• BIBLOGRAPHY

5. PROGRAMMING
LANGUAGE
GENERATIONS
OVERVIEW

6. 6

7. • 1st Generation (1GL): Machine Language -
Binary code
• 2nd Generation (2GL): Assembly Language -
Mnemonics
• 3rd Generation (3GL): High-Level Languages
- C, Java, Python
• 4th Generation (4GL): Very High-Level
Languages - SQL, MATLAB
• 5th Generation (5GL): AI-based - Prolog, LISP
7

8. OVERVIEW: STEP-BY-STEP EXECUTION
OF 1ST GENERATION (MACHINE
LANGUAGE) PROGRAM
8
The execution of a first-generation program
(machine code) involves a direct interaction
with the computer's hardware. The program,
written as a sequence of binary digits (0s and
1s), is fed into the computer, and the central
processing unit (CPU) directly interprets and
executes these instructions. This process is
essentially a series of steps: fetching
instructions from memory, decoding them, and
then executing the corresponding operation

9. 9

10. SUMMARY: 1ST GENERATION:
MACHINE LANGUAGE
Code: Binary (e.g., 10110000 01100001)
Processing: Direct CPU execution
Output: Register or memory
Limitation: Hard to debug, hardware-specific
10

11. 11
OVERVIEW: STEP-BY-STEP EXECUTION
OF SECOND GENERATION (ASSEMBLY
LANGUAGE) PROGRAM
Second-generation programming languages,
also known as assembly languages, use
mnemonics (human-readable notations) to
represent machine instructions. The execution
process involves writing code with these
mnemonics, which is then converted into
machine code (binary) by an assembler, and
finally executed by the computer's processor

12. 12

13. SUMMARY: 2ND GENERATION:
ASSEMBLY LANGUAGE
13
• Code: Mnemonics (e.g., MOV AL,
61h)
• Processing: Assembler converts to
machine code
• Output: Console or memory
• Limitation: Hardware-specific, low-
level

14. OVERVIEW: STEP BY STEP EXECUTION OF
THE THIRD-GENERATION LANGUAGE(HIGH
LEVEL) 14
Third-generation programming languages
(3GLs), like C, Java, and Python, use high-level,
English-like syntax, making them easier to
understand and use than their
predecessors. Execution involves translating the
source code into machine code, either through
compilation (creating an executable file) or
interpretation (executing line by line). This
translation allows the computer to understand
and run the program.

15. 15

16. 16
SUMMARY: 3RD GENERATION: HIGH-
LEVEL LANGUAGES
• Examples: C, Java, Python
• Processing: Compiler/Interpreter
Machine Code
→
• Output: Human-readable (screen,
file)
• Limitation: Platform dependent,
debugging needed

17. 17
OVERVIEW: STEP BY STEP EXECUTION OF
THE FOURTH-GENERATION LANGUAGE
(VERY HIGH LEVEL)
Fourth generation programming languages
(4GLs) are designed to be more user-friendly
and efficient than their predecessors,
focusing on high-level abstractions and often
incorporating database management
capabilities. Execution typically involves a
combination of source code, potentially form
definitions, and potentially report
specifications, all interacting with a
database.

18. 18

19. 19
SUMMARY: 4TH GENERATION: VERY
HIGH-LEVEL LANGUAGES
• Examples: SQL, MATLAB
• Processing: Engine-based
(domain specific)
• Output: Table or visual output
• Limitation: Limited to specific
domains

20. OVERVIEW: STEP BY STEP EXECUTION
OF THE FIFTH-GENERATION LANGUAGE
(AI BASED)
20
The fifth-generation programming languages (5GL)
are designed primarily for solving problems using
logic and rules instead of writing detailed step-by-
step instructions. Languages like Prolog and LISP
fall into this category. They are mainly used in
artificial intelligence, expert systems, and natural
language processing. In 5GL, the programmer
defines what the program should accomplish, and
the inference engine figures out how to achieve it.
While powerful for complex, logic-based tasks,
these languages can be slower, more difficult to
debug, and less efficient for simpler procedural
operations.

21. 21

22. SUMMARY:5TH GENERATION: AI-BASED
LANGUAGES
22
• Examples: Prolog, LISP
• Processing: Inference engine and
logic rules
• Output: Result based on logic
queries
• Limitation: Hard to implement and
slow performance

23. SUMMARY: PROCESSING, OUTPUT,
AND LIMITATIONS
• 1GL: Binary Direct CPU Raw Hard to debug
→ → →
• 2GL: Mnemonics Assembler Console Hardware
→ → →
specific
• 3GL: Code Compiler Screen Platform dependent
→ → →
• 4GL: Declarative Engine Table Domain specific
→ → →
• 5GL: Logic Inference Decision Complex logic
→ → →
23

24. 24
BIBLOGRAPHY
• BOOKS
• GREEKFORGREEK.COM
• WIKIPEDIA
• GOOGLE

25. THANK
YOU
YASH VARDHAN ANAND
XI-D
STREAM – PCM