Scribd
Upload
92 views2 pages

Peper of Mathematics Foundation

The document outlines the examination structure for B.C.A Part – I (Semester – I) focusing on Problem Solving Using C, with a total of 60 marks. It includes various topics such as algorithms, flowcharting, data types, operators, control structures, arrays, functions, pointers, structures, and unions, with specific questions and options for each section. Students are required to answer all questions, demonstrating their understanding of C programming concepts.

Uploaded by

sunnyharne0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
92 views2 pages

Peper of Mathematics Foundation

The document outlines the examination structure for B.C.A Part – I (Semester – I) focusing on Problem Solving Using C, with a total of 60 marks. It includes various topics such as algorithms, flowcharting, data types, operators, control structures, arrays, functions, pointers, structures, and unions, with specific questions and options for each section. Students are required to answer all questions, demonstrating their understanding of C programming concepts.

Uploaded by

sunnyharne0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.C.

A Part – I (Semester – I) (NEP) Examination


PROBLEM SOLVING USING C
Time: 3 Hours Maximum Marks: 60
Note:
1. All questions are compulsory.

1. A. Explain Algorithm & flowcharting in details. 4


B. Explain Type conversion and Operator Precedence. 6
C. Explain Identifiers and keywords in C. 5

OR

2. A. Explain types of programming in details 4


B. Explain operators and their types in detail. 6
C. Explain constants and variables. 5

3. A. Explain printf, scanf, conditional operator and goto statement in


detail with example. 6
B. Explain Control structures 5
i. if statement
ii. if_else
iii. nested_if
iv. if_else ladder

C. Write a program to print following pattern. 4


* * * * *
* * * *
* * *
* *
*
OR

4. A. Explain Unformatted i/o funcions and the following functions 6


igetch(), gets(), putch(), puts()
B. Explain Looping structures 5
i. while loop
ii. do_while loop
iii. for loop
iv. break and continue
C. Write a program to find the given year Is leap or not. 4
5. A. What is Array and explain types of array in details with example. 6
B. Explain call by value and call by reference with example. 5
C. Explain following string functions: strlen(), strcpy(), strcmp() &strcat() 4

OR

6. A. Explain types of function in detail with example. 6


B. Explain how we can use function with array. And Write a program to
create a function which will find largest element in an array. 5
C. What is Recursion and what are the application of it? 4

7. A. Write difference between a Structure and a Union 4


B. Explain Union and write a simple program to demonstrate union. 5
C. How do we declare pointer and explain the uses of pointer. 6

OR

8. A. Explain Pointers and write a program for pointer arithmetic. 5


B. What is structure and how do we declare and use array of structure. 8
C. What is union, and when should we use it. 3

You might also like