Skip to main content

High level languages

High level languages
High level languages were developed for make programming easier.Tgese languages are called higher level languages.Because there syntax is more like human language than assembly or machine language code.Higher level programming languages use familiar words rather than make up machine instructions.To express computer operations.These languages use operators such as the + and - sign that are the familiar components of mathematics.As a result people can read,Write and understand computer programmes much more easily when using a high level language.Still the instructions must be translated inyo machine language before the computer can understand and carry them out.

Labels:

Comments

Post a Comment

Popular posts from this blog

CALCULATE PERCENTAGE

Calculate percentage #include < stdio.h > void main() { int s1, s2, s3, s4, s5, sum, total = 500; float per; printf("\nEnter marks of 5 subjects : "); scanf("%d %d %d %d %d", &s1, &s2, &s3, &s4, &s5); sum = s1 + s2 + s3 + s4 + s5; printf("\nSum : %d", sum); per = (sum * 100)/500; /* percentage formula*/ printf("\nPercentage : %f", per); }
Post a Comment
Read more

SIMPLE INTEREST

Simple interest #include < stdio.h > void main() { int amount, rate, time, ans; printf("\nEnter Principal Amount : "); scanf("%d", &amount); printf("\nEnter Rate of Interest : "); scanf("%d", &rate); printf("\nEnter Period of Time : "); scanf("%d", &time); ans = (amount * rate * time)/100; /*Simple interest formula*/ printf("\nSimple Interest : %d",ans); }
Post a Comment
Read more

HCF AND LCM

HCF and LCM #include < stdio.h > long gcd(long, long); int main() {   long x, y, hcf, lcm;   printf("Enter two integers\n");   scanf("%ld%ld", &x, &y);   hcf = gcd(x, y);   lcm = (x*y)/hcf;   printf("Greatest common divisor of %ld and %ld = %ld\n", x, y, hcf);   printf("Least common multiple of %ld and %ld = %ld\n", x, y, lcm);   return 0; } /*if 1st no is 0 then 2nd no is gcd make 2nd no 0 by subtracting smallest from largest and return 1st no as gcd*/ long gcd(long x, long y) {   if (x == 0) {   return y;   }   while (y != 0) {   if (x > y) {     x = x - y;   }   else {     y = y - x;   } } return x; }
Post a Comment
Read more