Scribd
Upload
184 views1 page

Programming For Problem Solving KCS 101T

This document is the question paper for the B Tech Programming for Problem Solving theory examination from the 2020-21 academic year. It contains 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each. Section B contains 3 long answer questions worth 10 marks each. Section C contains 2 long answer questions worth 10 marks each. Sections D, E, F and G each contain 2 long answer questions worth 10 marks each from which students must attempt one. The questions cover a range of topics related to programming languages, operators, control structures, arrays, sorting, files and dynamic memory allocation.

Uploaded by

avinas_3mar
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
184 views1 page

Programming For Problem Solving KCS 101T

This document is the question paper for the B Tech Programming for Problem Solving theory examination from the 2020-21 academic year. It contains 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each. Section B contains 3 long answer questions worth 10 marks each. Section C contains 2 long answer questions worth 10 marks each. Sections D, E, F and G each contain 2 long answer questions worth 10 marks each from which students must attempt one. The questions cover a range of topics related to programming languages, operators, control structures, arrays, sorting, files and dynamic memory allocation.

Uploaded by

avinas_3mar
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/ 1

Printed Page: 1 of 1 

Subject Code: KCS101T


0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
B TECH
(SEM-I) THEORY EXAMINATION 2020-21
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. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. Write the fundamental data type in C Programming and its range. 2 1
b. Write the algorithm for addition of two numbers. 2 1
c. Define all Arithmetic operators. 2 2
d. Explain the need of break in switch statement with example. 2 2
e. Write the syntax of continue statement. 2 3
f. What is the difference between while and do-while loop? 2 3
g. Difference between structure and union. 2 4
h. Define Sorting Algorithm with example. 2 4
i. Define preprocessor and its usage in programming. 2 5
j. Write the advantage for the use of Linked list. 2 5
SECTION B
2. Attempt any three of the following:

P
Q no. Question 0Q Marks CO
a. Brief the Generations of the Programming languages with examples. 10 1

1
13
b. What do you mean by Operands? Discuss the operator precedence and associativity of 10 2
29

all the operators.

2.
0E

c. Define recursive function? Write a program to find the factorial of a number with 10 3

24
recursive function.
P2

d. Write the advantage of using array. Write the program for matrix multiplication of two 10 4

5.
matrix elements.
_Q

.5
e. Explain file handling and write a program for copying the content of one file into 17 10 5
another file.
TU

SECTION C
|1

3. Attempt any one part of the following:


AK

Q no. Question Marks CO


4

a. Write the short notes on (i) Compiler (ii) Interpreter (iii) Linker (iv) Loader 10 1
:5

b. Brief the storage classes in C with proper example. 10 1


05

4. Attempt any one part of the following:


:
09

a. Write a program to find out the greatest number out of three numbers. 10 2
b. Explain different type of control statements used in c programming with example. 10 2
1

5. Attempt any one part of the following:


02

a. Write a program to print the pattern: 10 3


-2

**** 
***
ar

**
M

*
7-

b. Write a Program to find the entered number is Palindrome number or not. 10 3


|1

6. Attempt any one part of the following:


a. Write a program two find out the odd and even number from the array elements and 10 4
its count.
b. Explain the Selection sort with example. 10 4
7. Attempt any one part of the following:
a. Explain dynamic memory allocation concept with proper example. 10 5
b. Explain the different type of modes and I/O function in file handling. 10 5

1 | P a g e  
 
AKTU_QP20E290QP | 17-Mar-2021 09:05:54 | 117.55.242.131

You might also like