This document contains the complete B.Tech (Semester II) Theory Examination Question Paper for Programming for Problem Solving, Subject Code BCS201, for the academic session 2023–24. The examination is designed to evaluate a student’s understanding of fundamental programming concepts, C language syntax, algorithmic thinking, data handling, memory management, and basic data structures.
BCS201-PROGRAMMING-FOR-PROBLEM-…
The question paper is divided into three well-structured sections, each assessing different levels of technical ability—from quick conceptual recall to detailed coding logic and analytical program development.
SECTION A – Short Answer Questions (2 marks each)
This section contains seven concise questions that test basic programming knowledge, including:
Computer memory units (e.g., nibble to bytes)
Conditional/ternary operator evaluation
Explicit type conversion
Basic C programs for loops and number printing
Pointer-to-pointer definitions
Output prediction from code snippets
Block diagram of doubly linked lists
These questions assess rapid recall and fundamental understanding.
SECTION B – Medium-Length Questions (7 marks each)
Students must attempt any three questions. This section evaluates intermediate programming and problem-solving skills, with questions involving:
Drawing flowcharts and checking Buzz numbers
Importance of operator precedence and associativity
Bitwise and ternary operator explanation
Matrix multiplication and transpose programs
Implementing selection sort
File handling with feof() to detect end-of-file
This section focuses on real-world problem-solving using C.
SECTION C – Long & Applied Questions (7 marks each)
This part includes questions requiring deeper logic, algorithmic understanding, and C program implementation. Topics include:
User-defined data types, primitive data type ranges, memory size & format specifiers
Difference between algorithm and flowchart
Solving programming tasks using loops, conditionals, functions, and recursion
Character validation (vowel/consonant)
Electricity bill calculation using conditional logic
Pattern printing and series summation
Use of unions for storing student records
Binary search implementation
Functions in C & recursion
Dynamic memory allocation using malloc() and realloc()
File handling functions and vowel-count program
Sample Questions (1–2 from the paper)
Here are sample questions to illustrate the type and level of questions included:
“1 Nibble = ……… Bytes.”
— Tests basic computer memory knowledge from Section A.
BCS201-PROGRAMMING-FOR-PROBLEM-…
“Write a C program to multiply two matrices of order n × n and print the resulting matrix along with its transpose.”
— Represents medium-level C programming and array handling.
BCS201-PROGRAMMING-FOR-PROBLEM-…
These reflect the mix of conceptual, logical, and coding-based questions throughout the exam.
Coverage of the Question Paper
Apart from the sample questions, the paper includes many similar questions related to:
Looping & decision-making
Functions, recursion, and modular programming
Arrays, strings, pointers, and dynamic memory
C operators and type conversions
File handling, structure & union usage
Sorting, searching, and algorithm design
Basic data structures (linked lists)
This provides a balanced assessment of both theoretical concepts and practical C programming skills.
Purpose of the Document
This question paper serves as a comprehensive academic resource for students preparing for Programming for Problem Solving. It helps students understand:
Exam pattern
Types of questions expected
Difficulty level
Important topics from the syllabus
Coding standards and logical problem-solving approach
Additional related questions are provided in the accompanying notes for advanced practice and revision.
