Programming Language an Overview



Figure : Programming Language



Programming Language an Overview

Hi .,                                                                       Welcome to my Blog.

                               This blog is very useful to guide for the basic computer user. First we avoid the inferiority complex about computer usage. Computer is very simple machine while you do interest about that.
Ok., Now we are discuss about the programming language.

Programming Language:
                              What is Programming language? Is it very important?.
Ya. It is very important once when we are using computer or we are create any of application software by help of this. It is used to create a programs and also provides communication between the user and computers.
Figure: Types of programming lanuage

 The Programming Language divided into two parts. They are.,
  • Syntax
  • Semantics
Syntax is nothing but form and also Semantics is nothing but meaning. If you any doubt about the programming language see http://www.webopedia.com/TERM/P/programming_language.html.                    


Figure: Programming Language paradigm





Types of Programming Language:   

The following some programming language are.
 
  • A# .NET 
  • A#
  • ActionScript
  • Ada
  • ALGOL 58
  • ALGOL 60
  • ALGOL 68
  • AppleScript
  • Assembly language
  • Asp
  • B 
  • BASIC 
  • BETA 
  • BitC
  • C
  • C++
  • C#
  • C#.NET
  • COBOL
  • ColdFusion
  • Combined Programming Language (CPL)
  • Common Intermediate Language (CIL)
  • Foxpro
  • FoxBase
  • FORTRAN
  • HTML
  • J
  • J#
  • JAVA
  • J++
  • JavaScript
  • Lava
  • LISA
  • LISP
  • LOTUS
  • PASCAL
  • Python
  • Php
  • Perl
  • ORACLE
  • QBASE
  • UNIX
  • Visula Basic
  • Visual Basic .NET
  • Visual C++
  • Visual C++.NET
  • Visual Foxpro
  • Visual J++
  • X++
  • XML
  • XCode


Programming Language Developers:

                              The following Scientist are developed the computer programming language. They are,

  • Friedrich L. Bauer - ALGOL 
  • Walter Bright - D  
  • Ole-Johan Dahl & Kristen Nygaard - Simula
  • Dennis Ritchie - C
  • Ken Thompson - B
  • Guido van Rossum - Python
  • Bjarne Stroustrup - C++
  • Niklaus Wirth - Modula-2
  • Larry Wall - Perl
  • James Gosling - Java
  • Grace Hopper - COBOL
                                                  
Figure: Programming Languages
                                                 
These are details about Programming Language. If you have Programming Language Research details log on to http://www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mleone/web/language-research.html and also you have details about concept of the programming language go to http://www.cs.grinnell.edu/~stone/courses/languages/.

The Overview of Programming Language is Over. If you have any suggestion to send email vivekananthan15@gmail.com


 

                             

Comments

Post a Comment

Popular posts from this blog

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

Image
The Traveling Salesman Problem (TSP) is a classic problem in computer science and optimization theory. The problem is defined as follows: given a set of cities and the distances between them, find the shortest possible path that visits each city exactly once and returns to the starting city. The Branch and Bound technique is an algorithmic paradigm for solving combinatorial optimization problems. The basic idea is to explore the search space by dividing it into smaller subproblems, and then pruning branches of the search tree that can be shown to lead to suboptimal solutions. The branch and bound algorithm for the TSP works by starting with an initial lower bound on the length of the optimal tour, and then exploring the search space by systematically building up partial tours and computing lower bounds on their completion. Sample C code for solving the Traveling Salesman Problem(TSP) using the branch and bound technique: #include <stdio.h> #include <stdlib.h> #include ...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - FIRST FIT, BEST FIT, WORST FIT ALGORITHM

FIRST FIT, BEST FIT, WORST FIT ALGORITHM PROGRAM: #include<stdio.h> int mem[20],proc[20],bp[20],bm[20],cm[20],cp[20],ms,ps,i,j,ch,y; main() {             printf(“\nEnter the number of memory segments”);             scanf(“%d”,&ms);             printf(“\nEnter the memory segment”);             for(i=0;i<ms;i++)             {                         scanf(“%d”,&mem[i]);                         bm[...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - BANKERS ALGORITHM

BANKERS ALGORITHM – SINGLE RESOURCES PROGRAM: #include<stdio.h> main() { int j=0,cmp=0,i,tot,avail,need[20],n,tr,max[20],hold[20]; printf("Enter the number of process"); scanf("%d",&n); printf("Enter the number of resources"); scanf("%d",&tr); printf("Enter the max,need,hold for each process"); for(i=0;i<n;i++) { printf("p%d",i); scanf("%d",&max[i]); scanf("%d",&hold[i]); } tot=0; for(i=0;i<n;i++) { tot=tot+hold[i]; need[i]=max[i]-hold[i]; } avail=tr-tot; while(j!=tr) { for(i=0;i<n;i++) { if(need[i]!=0&&need[i]<=avail) { avail=avail+hold[i]; need[i]=0; printf("%d\t%d\n",i,avail); cmp++; } } j++; } if(avail==tr) printf("safe state"); else printf("unsafe state"); }
Read more