(SEM I) THEORY EXAMINATION 2021-22 PROGRAMMING FOR PROBLEM SOLVING

This document contains the official B.Tech (1st Semester) Question Paper for Programming for Problem Solving (Subject Code: KCS101T) from the AKTU Theory Examination 2021–22. It includes the full 3-hour, 100-marks question paper divided into Section A, Section B, and Section C, following the standard AKTU pattern. This question paper is highly useful for students preparing for end-semester exams, sessionals, internals, and for understanding the complete exam structure for C programming fundamentals.

The paper focuses on assessing a student’s understanding of algorithms, C programming syntax, debugging, arrays, functions, pointers, recursion, searching & sorting, file handling, and core computer science concepts. It is a complete, university-approved reference for anyone studying C language in their first semester of B.Tech.

Detailed Breakdown of the Question Paper

SECTION A – Short & Conceptual Questions (20 Marks)

This section contains 10 questions of 2 marks each, helping students revise essential concepts quickly. Topics include:

Algorithm vs. pseudocode

Header files and their importance

Output prediction of C programs

Limitations of the switch case

Break statement usage

Scope vs. lifetime of variables

Limitations of array subscript operator

Linear vs. binary search (complexity)

Pointer input-output behavior in C

Significance of EOF (End of File)

These objective-style questions strengthen a student’s foundation and improve accuracy in theory.

SECTION B – Short Answer / Program-Based Questions (30 Marks)

Students must attempt 3 out of 5 questions. This part includes descriptive answers and programming-based questions such as:

Block diagram of a computer with explanation

Type conversion vs. typecasting + program to extract leftmost digit of integral part

Program to find sum of factorial series using functions

Program to find transpose of a matrix

Purpose of preprocessor & explanation of any two preprocessor directives

Each question carries 10 marks, and they help students practice medium-level programming and explanations.

SECTION C – Long Answer / High-Weightage Questions (40 Marks)

This section contains 4 questions, each offering two alternatives. Students must attempt one part from each question. Topics include:

Question 3

Flowchart for largest of three numbers

Storage classes in C with examples

Question 4

Logical, unary, and bitwise operators (full explanation)

If–else–if ladder vs. switch case + menu-driven calculator program

Question 5

Recursion definition + program for Fibonacci sum using recursion

Call by value vs. call by reference with examples

Question 6

Bubble sort on sequence: 34, 78, 12, 5, 3, 98, 101, 15

Searching definition + linear search program

Question 7

Dynamic memory allocation, malloc vs calloc

File opening modes + program to count lines and words in a file

This section helps students prepare for long descriptive answers and marks-heavy programming questions.