C Programming Functions Quiz

Palindrome Function

• Checks if a number is a palindrome by reversing its digits.
• Initializes a to the original number and r to 0 to hold the reversed number.
• Uses a loop to extract each digit: multiplies r by 10 to shift digits and adds the last digit of n using n % 10.
• Compares the reversed number r with the original number a to determine if it is a palindrome.
• Outputs "It is a Palindrome" if true, otherwise outputs "It isn't a Palindrome".

Prime Function

• Intended to check if a number is prime starting from i = 2.
• Uses a for loop to iterate from 2 to n-1 for divisibility checking.
• An individual number is considered prime if it has no divisors other than 1 and itself.

Armstrong Function

• Checks if a number is an Armstrong number (sum of its digits raised to the power of the number of digits equals the number itself).
• Initializes c to zero for accumulating the sum of digits raised to the third power.
• The loop processes each digit using modulus and division operations to sum them up.
• Compares the calculated sum c with n for validation.
• Outputs "Armstrong No." if they are equal, otherwise outputs "Not Armstrong".

Reverse Function

• Intended to print the reverse of a number.
• Uses a loop to extract each digit from the number n through division.
• Outputs each digit as it is processed, indicating the result as "Reverse: ".