Your career after Programming Language

What is Programming Language?

A programming language is a set of grammatical rules and vocabulary to instruct a computer to perform the specific tasks. It is generally used to write computer programs such as Applications, utilities, servers, and systems programs. It can be used for two purposes:

• To create programs that can control the behaviour of a machine
• To express algorithms

Basically the description of a language is divided into two components:

• Syntax (form)
• Semantics (meaning)

Till date thousands of programming languages have been created and many more are yet to come. Most of the programming languages explain the basic of computing that is, as a sequence of commands, although some languages, such as those that support functional programming or logic programming, use alternative forms of description.

Programming languages are usually referred to as high-level languages, such as C+, C++, JAVA and many more are part of this group. Every language has a unique set of keywords and a special syntax for organizing program instructions.

The most commonly used programming languages are C, C++, VC++, Java, JavaScript, J2EE - Advanced Java, J2SE - Core Java, PHP, .NET, Adobe Flex, AJAX, EJB, Hibernate, Perl, ROR - Ruby On Rails, Shell Scripting, Spring, Struts ,Python.

However, programming languages are artificial languages designed to control computers and many man hours have been spent to develop modified versions of languages.

Eligibility:

In order to pursue this program, one has to be a graduate from a recognized university in computer science, mathematics, information system, or a related computer technology field.

Career Prospects:

After completing course in a programming language, you can start working as a Basic Programmer, Computer software engineer, web designers and developers, computer systems analyst or freelance as a consultant.

M.C.A Engineering Colleges in Pune

Indira College of Engineering and Management Parandwadi      

Pune

Courses: 

Master of Computer Applications (MCA)

3-Year | Full Time | Degree

JSPMs Jayawantrao Sawant College of Engineering, Hadapsar, Pune      

Pune

Courses: 

M.C.A (Master of Computer Application)

3-Year | Full Time | Degree

Indira Group of Institutes's ISBS, IIMP, IGBS, ICEM, ISC, IIMP (MCA)      

Pune

Courses: 

ICEM- B.E.(Mechanical Engineering)

4-Year | Full Time | Degree

ICEM- B.E. (Computer Engineering)

4-Year | Full Time | Degree

Rajarshi Shahu College of Engineering (RSCOE)      

Pune

Courses: 

M.C.A.

3-Years | Full Time | Degree

Jayawantra Sawant College of Engineering - Maharashtra      

Pune

Courses: 

MCA Master of Computer Application

3-years | Full Time | Degree

Pimpri Chinchwad College Of Engineering      

Pune

Courses: 

MASTER OF COMPUTER APPLICATION. (M.C.A.)

3-Years | Full Time | Degree

HARD DISK drive with 5 MB of storage.

This Picture was Taken in 1956.Thats a HARD DISK drive with 5 MB of storage. In September 1956, IBM launched the 305 RAMAC, the first 'SUPER' computer with a hard disk drive (HDD). The HDD weighed over a ton and stored 5 MB of data.

 

Plzz Read this.. Steve Jobs vs Dennis Ritche

Best MCA colleges in Munbai (Selected)

SIES College of Management Studies, Nerul, Navi Mumbai

Location: Mumbai | Contact college

Veermata Jijabai Technological Institute, Mumbai

Location: Mumbai | Contact college

National Institute of Management, Mumbai

Location: Mumbai | Contact college

Annasaheb Chudaman Patil College of Engineering, Thane, Navi Mumbai

Location: Mumbai | Contact college

MET Institute of Computer Science, Bandra, Mumbai

Contact college

Thakur Institute of Management Studies, Career Development and Research, Mumbai

Contact college

Shreemati Nathibai Damodar Thackersey Womens University, Mumbai

Contact college

Sterling Institute of Technology and Management, Mumbai

Contact college

Vivekanand Education Society Institute of Technology, Chembur, Mumbai

Location: Mumbai | Contact college

KJ Somaiya Institute in Management Studies & Research, Vidyavihar, Mumbai

Contact college

Navinchandra Mehta Institute of Technology & Development, Dadar, Mumbai

Contact college

YMT College of Management, Navi Mumbai

Location: Mumbai |

Bankers algorithm (SYSPRO)

//  Program: Bankers algorithm

#include<stdio.h>

#include<conio.h>

#include<math.h>

int m,n;

int avl[20];

int max[20][20];

int need[20][20];

int allocat[20][20];

int finish[20];

int work[20];

int ssindex;

int safe_seq[20];

void find_need();

void get_data(int mat[20][20]);

void safety_algorithm(int p);

int chk_safe();

void resource_request();

void main()

{

      int flag=0;

      int r,p,i;

      clrscr();

      printf("\nHow many process u want:");

      scanf("%d",&n);

      printf("\n How many resources u want:");

      scanf("%d",&m);

      printf("\n Enter allocation matrix");

      get_data(allocat);

      printf("\nEnter max matrix");

      get_data(max);

      printf("\nenter available resources:");

      for(r=0;r<m;r++)

      scanf("%d",&avl[r]);

      find_need();

      for(r=0;r<m;r++)

      {

            work[r]=avl[r];

            finish[r]=0;

      }

      for(p=0;p<n;p++)

      {

            flag=0;

            for(r=0;r<m;r++)

            if(need[p][r]>work[r])

            {

                  flag=1;

                  break;

            }

            if(flag==0)

            {

                  safety_algorithm(p);

                  finish[p]=1;

                  safe_seq[ssindex]=p;

                  ssindex++;

            }

      }

      getch();

      printf("safe sequence is:");

      printf("<");

      for(i=0;i<ssindex;i++)

            printf("p%d ",safe_seq[i]);

            printf(">\n\n");

      if(chk_safe())

            printf("\nEntered sequence is safe:");

      else

            printf("\nEntered sequence is not safe:");

            getch();

            //printf("Enter process id for request:");

            //scanf("%d",&p);

            printf("\nEnter request for %d resources",m);

            //for(r=0;r<m;r++)

            //for(p=0;p<n;p++)

            for(r=0;r<m;r++)

                  scanf("%d",&max[p][r]);

                  resource_request();

}//main

void find_need()

{

      int p,r;

      for(p=0;p<n;p++)

      for(r=0;r<m;r++)

      need[r][p]=max[p][r]-allocat[p][r];

      //need=max_requirement-currnt_allocation

}

void get_data(int mat[20][20])

{

      int r,p;

      for(p=0;p<n;p++)

      for(r=0;r<m;r++)

      scanf("%d",&mat[p][r]);

}

void safety_algorithm(int p)

{

      int r=0;

      for(r=0;r<m;r++)

      work[r]=work[r]+allocat[p][r];

}

int chk_safe()

{

      int i;

      for(i=0;i<n;i++)

      if(finish[i]==0)

            return(0);

            return(1);

}

void resource_request()

{

      int r,p;

      for(r=0;r<m;r++)

      if(max[p][r]>need[r][p])

      {

            printf("\n Process has exceeded it's max limit");

            getch();

            exit(0);

      }//if

      for(r=0;r<m;r++)

      if(max[p][r]>avl[r])

      {

            printf("\n Resourses are not available pricess should wait");

            getch();

            exit(0);

      }//if

      for(r=0;r<m;r++)

      {

            avl[r]-=max[p][r];

            allocat[r][p]+=max[p][r];

            need[r][p]-=max[p][r];

      }//for

      if(chk_safe())

      {

            printf("\n Request can be imidiately granted");

            //printf_safe();

            getch();

      }

      else

      {

            printf("\n Request can not be granted");

            getch();

      }

}

/* OUTPUT:

How many process u want:5                                                      

How many resources u want:4

Enter allocation matrix:

0 6 3 2

0 0 1 2

1 0 0 0

1 3 5 4

0 0 1 4

Enter max matrix:

0 6 5 2

0 0 1 2

1 7 5 0

2 3 5 6

0 6 5 6

Enter available resources:3 14 12 12

safe sequence is:<p0 p1 p2 p3 p4 >

Entered sequence is safe:

Enter request for 4 resources 1 2 0 1

Process has exceeded it's max limit

*/