14 dec 2023 SRMIST TRC MCA AN

int triangularNumber(int n) { if (n == 0) return 0; else return n + triangularNumber(n - 1); } int main() { printf("Triangular Number: %d\n", triangularNumber(3)); return 0; }

• 3
• 6
• 9
• 12

int countDown(int n) { if (n <= 0) return 0; else { return 1 + countDown(n - 1); } } int main() { printf("Count Down: %d\n", countDown(4)); return 0; }

• 3
• 2
• 4
• 6

int digitSum(int n) { if (n == 0) return 0; else return n % 10 + digitSum(n / 10); } int main() { printf("Digit Sum: %d\n", digitSum(567)); return 0; }

• 9
• 18
• 15
• 27

int consecutiveSquaresSum(int n) { if (n == 0) return 0; else return n * n + consecutiveSquaresSum(n - 1); } int main() { printf("Consecutive Squares Sum: %d\n", consecutiveSquaresSum(3)); return 0; }

• 8
• 10
• 12
• 14

int decimalToBinary(int n) { if (n == 0) return 0; else return n % 2 + 10 * decimalToBinary(n / 2); } int main() { printf("Binary Representation: %d\n", decimalToBinary(5)); return 0; }

• 100
• 101
• 110
• 111

int palindromeCheck(int n) { if (n <= 0) return 1; else return n % 10 == (n / 10) % 10 && palindromeCheck(n / 100); } int main() { printf("Palindrome Check: %d\n", palindromeCheck(1221)); return 0; }

• 0
• 1
• 10
• 11

int sumOfEvenDigits(int n) { if (n == 0) return 0; else return (n % 10 % 2 == 0 ? n % 10 : 0) + sumOfEvenDigits(n / 10); } int main() { printf("Sum of Even Digits: %d\n", sumOfEvenDigits(123456)); return 0; }

• 10
• 15
• 12
• 11

#include <stdio.h> int powerSum(int base, int exponent) { if (exponent == 0) return 1; else return base * powerSum(base, exponent - 1); } int main() { printf("Power Sum: %d\n", powerSum(2, 3)); return 0; }

• 6
• 8
• 12
• 16

#include <stdio.h> int fibonacci(int n) { if (n <= 1) return n; else return fibonacci(n - 1) + fibonacci(n - 2); } int main() { printf("Fibonacci: %d\n", fibonacci(5)); return 0; }

• 5
• 10
• 9
• 7

#include <stdio.h> int countDigits(int n) { if (n == 0) return 0; else return 1 + countDigits(n / 10); } int main() { printf("Count of Digits: %d\n", countDigits(12345)); return 0; }

• 1
• 2
• 3
• 5