Btech Sem 1 2 Btps 101 18 Programming For Problem Solvingg
Btech Sem 1 2 Btps 101 18 Programming For Problem Solvingg
INSTRUCTIONS TO CANDIDATES :
1. SECTION- A is COMPULSORY consisting of TEN questions carrying TWO marks
each.
2. SECTION - B & C have FOUR questions each.
3. Attempt any FIVE questions from SECTION B & C carrying EIGHT marks each.
4. Select atleast TWO questions from SECTION - B & C.
SECTION-A
l. Write short notes on :
1 | M-93803 (S1)-595
SECTION-B
3. List various symbols used in flowchart. Draw a flowchart to find the sum of all numbers
from 1 to n.
SECTION-C
6. What is recursion? Write a program to find the factorial of a number using recursion.
7. What is a pointer? Write a program to find the sum of all elements of an array using
pointers.
8. Discuss the use of user-defined functions in C. Explain the difference between various
methods of passing arguments to a function.
9. Differentiate between :
NOTE : Disclosure of Identity by writing Mobile No. or Marking of passing request on any
paper of Answer Sheet will lead to UMC against the Student.
2 | M-93803 (S1)-595