Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Prof. Achala Yash delivered this lecture at Ankit Institute of Technology and Science for Object Oriented Programming course. It includes: Programming, Languages, Low, Level, Machine, Assembly, Structured, Procedural, Object, Oriented, Qualities
Typology: Slides
1 / 18
Machine Language Assembly Language
Structured & Procedural Languages
Object Oriented Languages
Qualities of Low Level & High Level Languages
printf ("hello, world\n"); return (0);
printf ("hello, world\n"); // Function from the Standard Input & Output Library return (0); // main Function Should Return an Integer Value
+=, A += B; // A = A + B; Addition -=, A -= B; // A = A - B; Subtraction *=, A *= B; // A = A * B; Multiplication /=, A /= B; // A = A / B; Division %=, A %= B; // A = A % B; Modulus or Remainder &=, A &= B; // A = A & B; Binary AND |=, A |= B; // A = A | B; Binary OR ^=, A ^= B; // A = A ^B; Binary XOR << =, A << = B; // A = A << B; Binary Shift Left
=, A >> = B; // A = A >> B; Binary Shift Right ++, A++; // A = A + 1; C = B + A++; Increment After ++, ++A; // A = A + 1; C = B + ++A; Increment Before –, A–; // A = A - 1; C = B + A–; Decrement After –, –A; // A = A - 1; C = B + –A; Decrement Before
Expression1 && Expression2; // Logical AND Expression1 || Expression2; // Logical OR Expression1 == Expression2; // Equality Expression1 ~= Expression2; // Inequality Expression1 > Expression2; // Greater value Expression1 >= Expression2; // Greater or Equal value Expression1 < Expression2; // Smaller value Expression1 <= Expression2; // Smaller or Equal value
~Expression; // Logical NOT
Statements if Expression is True
Statements if Expression is Not True
Statements if Expression is True
Statements if Expression is True
Statements if Expression is True except for the first time
int i; for (i = 1; i <= 10; i++) { printf("%d\n", i); } return 0;
–counter if (counter == 0) { return (0); } Recusive_Procedure (counter);