This document contains the official AKTU B.Tech 1st Semester (2020–21) Theory Examination question paper for Programming for Problem Solving (KCS101T). This is the full 100-mark, 3-hour paper that follows the exact AKTU pattern and covers all major C-language topics essential for first-year engineering students.
Programming for Problem Solving is a foundational subject for all students in CSE, IT, ECE, EE, ME, CE, AI-ML, and other branches, helping them build programming logic, understand core C syntax, and develop problem-solving skills. This question paper is ideal for exam preparation, internal assessment practice, and concept revision.
Detailed Breakdown of the Question Paper
SECTION A – Very Short Answer Questions (10 × 2 = 20 Marks)
This section checks basic understanding of C programming fundamentals. Topics include:
Fundamental data types and their range
Algorithm for addition
Arithmetic operators
Need for ‘break’ in switch
Syntax of continue statement
While vs do-while loop
Structure vs Union
Definition of sorting algorithm
Preprocessor usage
Advantage of linked list
These questions help revise core definitions and small concepts.
SECTION B – Medium-Length Questions (3 × 10 = 30 Marks)
Students must attempt any 3 out of 5 questions. Topics include:
Generations of programming languages
Operand definition, operator precedence & associativity
Recursive function & factorial program
Advantages of arrays + matrix multiplication program
File handling + program to copy contents of one file to another
This section improves a student's ability to write short programs and explain concepts clearly.
SECTION C – Long Answer Questions (5 × 10 = 50 Marks)
Each question has two alternatives; students must attempt ONE part from each.
Q3 – Compiler & Storage Classes
Short notes on compiler, interpreter, linker, loader
OR
Storage classes in C (auto, static, extern, register)
Q4 – Control Statements & Logic Programs
Program to find greatest of three numbers
OR
Types of control statements with examples
Q5 – Loop Patterns & Palindrome Logic
Pattern printing using loops
OR
Program to check palindrome number
Q6 – Arrays & Sorting
Program to find odd/even elements + count
OR
Selection sort explanation with example
Q7 – Dynamic Memory & File Handling
Dynamic memory allocation (malloc, calloc, free)
OR
File handling modes and I/O functions
These questions help students practice high-weightage coding problems and theoretical explanations.
