Procedural programming

4,925 views

Published on

The Presentation which we used during the presentation section on OrangeScape TechDebate.

0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
4,925
On SlideShare
0
From Embeds
0
Number of Embeds
209
Actions
Shares
0
Downloads
93
Comments
0
Likes
1
Embeds 0
No embeds

No notes for slide

Procedural programming

  1. 1. Engine Anbarasan Gangadaran Sivakumar Venkatraman @anabarasan, @sivaacbe
  2. 2. What’s Next >>>>>
  3. 3.  Ada Lovelace mathematician in mid-1800’s.  Languages provided no abstraction from the computer hardware.  1940’s - general-purpose computers  Machine Language  First Generation  Assembly Language  Second Generation
  4. 4.  Ancestors of Today’s Languages.  Abstracted away the underlying complexities of hardware environment.  1950’s - Fortran, COBOL  Third Generation Languages
  5. 5.  1960’s – 1970’s  Increase the level of Abstraction  Make programs easier to develop and maintain.  Language Enhancements  Programming Paradigms  The GOTO Controversy. Paradigms>>>> GOTO >>>>
  6. 6.  1990’s – increased developer productivity.  Memory Leaks, portability  JVM & CLR  Frameworks
  7. 7.  Formula Translation (FORTRAN) in 1954 led to...  Over 2000 languages.  How many languages in use today?  Difficult to say  Legacy Software(using outdated languages) is everywhere.  Why can’t we just use one language?
  8. 8.  Everyone knows it in one form or another.  Loops & Conditions.  Design Patterns.  APIs  How many of your friends know something called Rule Engine?
  9. 9.  Can get real Complex.  Tower of Babel. The End
  10. 10.  It is just a small piece of software in the big picture.  MAYBE (fuzzy logic)  An = 4an-1-3 (recursive rules)  No Standards  New Learning.  Difficult to Test.
  11. 11. <<<<Back
  12. 12.  Considered Harmful  Led to the concept of Structured Programing  Idea: Code is clearer if we restrict to a few control structures.  Loops have single entry, single exit <<<<<<Back
  13. 13.  Procedural programing  Logic Programing  Program can be broken into  Based on use of declarative procedures (or subroutines or statements in the language of functions) mathematical logic.  Examples:  Examples:Prolog Fortran, Algol, Cobol, C, Pas cal  Object-oriented programing  Program is seen as a group of cooperating objects  Ideas: encapsulation, inheritance  Examples:C++, C#, Java, Pyt <<<<Back hon
  14. 14.  http://techdistrict.kirkk.com/2009/06/17/the-new-era-of-programming-languages/  http://hopl.murdoch.edu.au/  http://www.cs.cornell.edu/Courses/cs212/2008sp/Lectures/Week%206/Week%2006%20- %20Programming%20Languages%20%20.pdf  http://en.wikipedia.org/wiki/Considered_harmful  http://www.stevemcconnell.com/ccgoto.htm
  15. 15. @anabarasan, @sivaacbe anbarasan@orangescape.com sivakumar@orangescape.com

×