Scribd
Upload
12 views2 pages

22ES12

This document is an examination paper for the B.Tech. Programming for Problem Solving course at CMR Institute of Technology, Hyderabad, scheduled for January 2024. It consists of two parts: Part A, which is compulsory and contains 10 questions worth 1 mark each, and Part B, which includes 5 units where students must answer one full question from each unit, each worth 10 marks. The questions cover various programming concepts in C, including flowcharts, data structures, loops, and memory management.

Uploaded by

yashwanth2006.school
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
12 views2 pages

22ES12

This document is an examination paper for the B.Tech. Programming for Problem Solving course at CMR Institute of Technology, Hyderabad, scheduled for January 2024. It consists of two parts: Part A, which is compulsory and contains 10 questions worth 1 mark each, and Part B, which includes 5 units where students must answer one full question from each unit, each worth 10 marks. The questions cover various programming concepts in C, including flowcharts, data structures, loops, and memory management.

Uploaded by

yashwanth2006.school
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

Code No.: 22ES12 R22 H.T.No.

R 0

CMR INSTITUTE OF TECHNOLOGY: HYDERABAD


UGC AUTONOMOUS
B.Tech. – I – Semester End Examinations– JAN – 2024
PROGRAMMING FOR PROBLEM SOLVING
(Common to all branches)
[Time: 3 Hours] [Max. Marks: 60]
Note: 1. This question paper contains two parts A and B.
2. Part A is compulsory which carries 10 marks. Answer all questions in Part A.
3. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 10 marks
and may have i, ii, iii as sub questions.
4. Illustrate your answers with NEAT sketches wherever necessary.

PART-A 10 X 1M = 10M

S.No Question Blooms CO PO


Taxonomy
Level

1 Tabulate various symbols used in flowchart with their I 1 1,2,3,12


importance.
2 Write an instruction in C Language to print whether a person is II 1 1,2,3,12
eligible for voting or not using ternary operator.
3 int student[50][5]; II 2 1,2,3,12
In this array rows represent student and column represent marks
in a subject. How to access 43rd student 4th subject marks?
4 What is the use of #define ? Give an example. I 2 1,2,3,12
5 Illustrate pointer to pointer? I 3 1,2,3,12
6 Why do we prefer gets( ) while working with strings instead of II 3 1,2,3,12
scanf( ) ?
7 How is “ typedef ” used in C? II 4 1,2,3,12
8 What is difference between fclose() and fcloseall() ? I 4 1,2,3,12
9 How many passes are required to sort “n” elements in selection I 5 1,2,3,12
sort?
10 Which searching technique is best in linear search and binary II 5 1,2,3,12
search? Why?

PART-B 5 X 10M = 50 M

11.A i. Compare while and do-while loops with appropriate examples. II 1 1,2,3,
12
ii. Explain about Logical operators, increment and decrement
operators in C
OR
11.B i. Read the marks of eight subjects and calculate the percentage. II 1 1,2,3,
The program should output following grades based on percentage 12
obtained in eight subjects.
Percentage 80 - 100 70 - 79 60 - 69 50 -59 Less than 50
Grade O A B C F

ii. Describe the structure of C Program.

12.A i. Write a C Program to print transpose of a given matrix. III 2 1,2,3,


12
ii. Distinguish between call by value and call by reference.
OR
12.B i. Write a C Program to find factorial of a given integer using III 2 1,2,3,
recursion. 12
ii. Explain about auto and static storage classes.

13.A i. Describe the usage of following string manipulation functions III 3 1,2,3,
with examples. 12
a) strcat( ) b) strcpy( ) c) strcmp( ) d) strlen( ) e) strrev( )
ii. Write a C Program to check whether the given string is
palindrome or not?
OR
13.B i. Describe the usage of following functions related to dynamic III 3 1,2,3,
memory allocation concept with examples. 12
a) malloc( ) b) calloc( ) c) realloc( ) d) free( )
ii. Write a C Program to count vowels in a given string.

14.A i. Compare Structures and Unions. II 4 1,2,3,


12
ii. Write a C program to add two complex numbers using structures.
OR
14.B i. Write a C Program to merge two files into third file. II 4 1,2,3,
12
ii. How to open and close a File? Explain various modes of opening
a File with examples.

15.A i. Write a C Program to implement Linear Search method. III 5 1,2,3,


12
ii. Illustrate Binary Search method.
OR
15.B i. Develop a C Program to implement Bubble sort technique. III 5 1,2,3,
12
ii. Apply Quick sort method to sort the following list of elements.
48, 44, 19, 59, 72, 80, 42, 65, 82, 8, 95, 68
----***----

You might also like