BCA Semester 2 – C programming () Questions & Answers | Past TU Exam Papers

1. What is a Function? Definition A function is a self-contained block of code designed to perform a specific task. It can be called multiple times in a program, which helps in modularity and reusa

1. Define Function Definition A function is a block of code designed to perform a specific task. It can be called multiple times in a program to reuse code and improve modularity. Syntax c returnt

1. Definition of Recursion Recursion is a programming technique where a function calls itself to solve a smaller part of the same problem. Key Points - Every recursive function must have a base case

1. Problem Statement Write a C program to calculate the series: \[ \text{Sum} = 1 + \frac{x}{2!} + \frac{x^2}{3!} + \frac{x^3}{4!} + ... + \frac{x^n}{n!} \] using a user-defined function in C. --- 2.

1. Definitions - Iteration: Repeating a block of code using loops (for, while, do-while) until a condition is met. - Recursion: A function calls itself to solve a smaller instance of the same proble

1. Why Functions are Required in C Programming Definition: A function is a block of code that performs a specific task and can be called from anywhere in the program. Key Points - Modularity: Divid

1. Definition of Recursive Function A recursive function is a function that calls itself directly or indirectly to solve a problem. Key Points: - Used when a problem can be broken into smaller, simi