(SEM-I) THEORY EXAMINATION 2022-23 PROGRAMMING FOR PROBLEM SOLVING

This question paper assesses students’ understanding of C programming, algorithms, data types, storage classes, flowcharts, recursion, arrays, sorting, searching, memory allocation, linked lists, file handling, and basic computer system architecture.
Students may answer in English, Hindi, or a mixed language.

The question paper is divided into three sections – A, B, and C with a balance of short, descriptive, and program-based questions.

SECTION A — Short Answer Questions (Attempt All) — 2 × 7 = 14 Marks

This section evaluates basic conceptual clarity.

Topics Covered:

Memory Hierarchy Diagram
(from registers to secondary storage)

Identifiers & Keywords in C
(definition, rules, reserved words)

Implicit vs Explicit Type Conversion
(automatic vs forced typecasting)

Output of a C Program
(infinite for-loop, assignment inside condition)

Linear vs Binary Search
(complexity O(n) vs O(log n))

Node Structure of Linked List
(typical struct node with pointer)

File Opening Modes
(r, w, a, r+, w+, a+, rb, wb, ab, etc.)

These questions test foundational programming language knowledge.

SECTION B — Descriptive Questions (Attempt any 3) — 7 × 3 = 21 Marks

This section tests algorithmic thinking and application-based programming.

Topics Include:

Characteristics of an Algorithm + Algorithm to Find Sum of Digits

Clarity, finiteness, input-output, effectiveness, etc.

Data Types in C

Memory size, format specifier, range for:

int                                                                       double

float                                                                    short

char                                                                     long

Call by Value vs Call by Reference

With example program.

Matrix Multiplication Program

Input sizes, nested loops, final output matrix.

Dynamic Memory Allocation

With functions:

malloc()

calloc()

realloc()

free()

Each with examples and use cases.

**SECTION C — Long Answer / Programming / Flowchart Questions

(One from each part) — 7 × 3 = 21 Marks**

PART 3 — Computer Fundamentals & Algorithms

(a) Block Diagram of Computer System + Functions of OS

Explain:

Input Unit                                                               ALU

Output Unit                                                            CU

Memory Unit                                                          Storage

OS Functions:

Memory management                                           Scheduling

File management                                                   Security

Device management                                              Command interpretation

or

(b) Algorithm + Flowchart for Palindrome Number Detection

PART 4 — C Programming Concepts

(a) Bitwise Operators & Associativity Rules

Operators: AND, OR, XOR, NOT, <<, >>
Explain precedence vs associativity with example.

or

(b) Storage Classes

auto, static, extern, register — with output-based examples.

PART 5 — Pattern Printing & Recursion

(a) C Program to Print Star Pattern

Pyramid with odd number of stars in each row.

or

(b) Recursion + Program to Find GCD

Using Euclid’s algorithm.

PART 6 — Sorting & Structures

(a) Bubble Sort Program

Ascending order using nested loops.

or

(b) Structure for 200 bank customers + Program

Print customers with balance < 100.

PART 7 — Macros & File Handling

(a) Macro as Variable and Function

#define SIZE 10
#define SQR(x) ((x)*(x))

or

(b) File Operations + Program

Read file → count words → count lines.