0% found this document useful (0 votes)
3 views3 pages

B.Tech Programming Assessment Hall Ticket

This document is a hall ticket for the I B.Tech I Semester Continuous Assessment II exam for the course 'Programming for Problem Solving' scheduled on December 24, 2025. It outlines the course outcomes, assessment structure, and includes both multiple choice and descriptive questions related to programming concepts such as functions, pointers, file handling, and sorting algorithms. The exam consists of Part-A with various question types and Part-B requiring detailed programming solutions.

Uploaded by

Ganesh Deshmukh
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views3 pages

B.Tech Programming Assessment Hall Ticket

This document is a hall ticket for the I B.Tech I Semester Continuous Assessment II exam for the course 'Programming for Problem Solving' scheduled on December 24, 2025. It outlines the course outcomes, assessment structure, and includes both multiple choice and descriptive questions related to programming concepts such as functions, pointers, file handling, and sorting algorithms. The exam consists of Part-A with various question types and Part-B requiring detailed programming solutions.

Uploaded by

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

Hall Ticket Cour

No: se Code: A9501

I [Link] I Semester Continuous Assessment – II, December- 2025


(Regulations: VCE-R25)
PROGRAMMING FOR PROBLEM SOLVING
(Common to all Branches)
Date: 24 December Time: 2 Hours Max. Marks: 30
2025
Answer all Questions in Part-A
Answer any FOUR Questions in Part-B
Course Outcomes with Bloom’s Levels:
Bloom
CO ’s
CO Statement
# Level
(L#)
CO Use basic programming constructs and control statements to
L3
1 design solutions for computational problems
CO Develop programs using arrays and strings to store and
L3
2 manipulate sequential data.
CO Implement modular programming using functions, pre-processor
L3
3 directives, structures, and unions to manage complex data.
CO Make use of pointers and file handling to effectively manage and
L3
4 process data
CO Choose appropriate searching and sorting technique to organize
L3
5 and retrieve data efficiently.
Questions:
PART-A (Multiple Choice / Fill in the Blanks / Match the Following / Short
Answer Type Questions)
Mark
CO# BL#
s
1 a) What are the advantages of defining user defined
CO3 L2 1M
. function in C?
b) Write a recursive function to find the factorial of a
CO3 L3 1M
given number.
c) Given the following structure definition.
struct student {
int rollno; char name[30]; float avg;
}; CO3 L3 1M
struct student s={123,”Abhilash”,37.56};
Display the student details using pointer to a
structure.
d) Consider the code segment. CO4 L3 1M
int x=20;
int *p=&x;
Let the address of x is 2240. What is the value of p
after the following statement is executed.
p=p+3;
e) What is the output of the following code segment?
FILE *fp= fopen(“[Link]”, “w”);
CO4 L3
fclose(fp); 1M
fputc(‘A’,fp);
f) Differentiate between the fprintf() and fputs()
CO4 L2 1M
functions used for writing to a file in C.
g) How many passes (iterations) are required to sort an
CO5 L2 1M
array of 'n' elements using Bubble Sort?
h) When searching for a contact in a a mobile phone,
CO5 L3 1M
which searching technique is most suitable?
i) Which of the following sorting algorithm uses divide
and conquer strategy?
a) Insertion Sort
CO5 L2 1M
b) Bubble Sort
c) Section Sort
d) Quick Sort
j) What is the size of the following union?
union temp
{
int a; CO3 L3 1M
char b[10];
float c;
};
PART-B (Descriptive Questions)
2 a) Write a C Program to check a given number is Prime or
. not.
CO3 L3 5M
b) Define a recursive function to find the nth term of
Fibonacci series.

3 Implement a C program where a function takes an array as


. input and doubles each element. Show how the array is CO3 L3 5M
modified in the main program.

4 Perform the following operations using pointers.


. i) Performing increment and decrement operation
on a float
CO4 L3 5M
type pointer.
ii) Pointer to an array
iii) Declare and initialize a pointer to a pointer
5 Develop a C Program to perform the following operations
. on Files.
a) Write the character data to a file named “[Link]”. CO4 L3 5M
b) Find the number of words in “[Link]”.
c) Copy the contents of “[Link]” into “[Link]”.

6 Write a C program to sort the array using Selection Sort.


. Show the array after each pass and explain how the
elements are arranged step by step for the given CO5 L3 5M
elements.
{23, 18, 34, 45, 11, 56}
7 Illustrate how Insertion Sort works and implement it in C to
. sort a given set of elements, displaying the array after CO5 L3 5M
sorting.

You might also like