Professional Documents
Culture Documents
Programming For Problem Solving KCS 101T 1 PDF
Programming For Problem Solving KCS 101T 1 PDF
BTECH
(SEM I) THEORY EXAMINATION 2021-22
PROGRAMMING FOR PROBLEM SOLVING
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1
e. Show the usage of break statement. 2 3
13
0
f. Differentiate between scope and lifetime of variable. 2 3
29
2.
g. Write limitations of subscript operator in an array. 2 4
2_
24
h. Compare linear and binary search in terms of complexity. 2 4
2P
5.
i. Find the output of the following code: 2 5
.5
void main()
P2
17
{
Q
int a ,*p;
|1
scanf(“%d”, p);
04
printf(“%d”,a);
}
:
09
SECTION B
-2
brief.
|2
1 | P a g e
QP22P2_290 | 28-Mar-2022 09:04:57 | 117.55.242.131
Printed Page: 2 of 2
Subject Code: KCS101T
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
BTECH
(SEM I) THEORY EXAMINATION 2021-22
PROGRAMMING FOR PROBLEM SOLVING
SECTION C
3. Attempt any one part of the following: 1x10=10
Qno. Question Marks CO
a. Define flowchart and draw a flowchart to find largest among three 10 1
numbers.
b. Explain in detail about all storage classes with proper example. 10 1
1
13
0
Qno. Question Marks CO
29
2.
2_
recursion.
24
b. Differentiate between call by value and call by reference with proper 10 3
2P
5.
example.
.5
P2
17
Q
sequence:
04
any file and display the number of lines and words in that file.
|2
2 | P a g e
QP22P2_290 | 28-Mar-2022 09:04:57 | 117.55.242.131