(SEM II) THEORY EXAMINATION 2017-18 COMPUTER SYSTEM & PROGRAMMING IN C

This document contains the complete Computer System & Programming in C (RCS201) Theory Examination Paper for B.Tech Semester II, conducted in the academic year 2017–18. The exam carries 70 marks and has a duration of 3 hours. It is designed to test a student’s understanding of C programming fundamentals, problem-solving skills, file handling, operators, algorithms, and basic computer system concepts.
 

COMPUTER-SYSTEM-.-PROGRAMMING-I…

The paper is divided into three structured sections—A, B, and C—to evaluate conceptual clarity, coding ability, and analytical thinking.

SECTION A – Short Conceptual Questions (14 Marks)

This section includes seven brief questions, each carrying 2 marks, covering essential C programming fundamentals:

Meaning of tokens in C

Formatted output functions with examples

Use and syntax of fseek()

Output prediction of a C code snippet

Concept of function prototypes

Subscripts in arrays

Use of putchar() and getchar()

These questions test quick recall and foundational knowledge.
 

COMPUTER-SYSTEM-.-PROGRAMMING-I…

SECTION B – Descriptive & Programming Questions (21 Marks)

Students must attempt any three questions, which assess applied knowledge of C programming:

Program to find the largest element in a 4×4 matrix

Explanation of preprocessor directives (#ifdef, #undef, #pragma, #include)

Short notes on top-down development and difference between structure vs array

Recursive program to print the Fibonacci series

Definition of algorithm, steps in algorithm development, and algorithm to find sum of digits

This section checks practical coding skills and understanding of structured programming.
 

COMPUTER-SYSTEM-.-PROGRAMMING-I…

SECTION C – Analytical, Conversion & Advanced Programming (35 Marks)

This section contains five long-answer questions, each with two options:

Part 1 – System Software & Number System Conversions

Difference between compiler, interpreter, and assembler

Conversion of numbers between binary, octal, decimal, and hexadecimal

Part 2 – Bitwise Operators & Type Conversion

Explanation of bitwise operators with examples

Concept of type conversion, implicit and explicit

Part 3 – Pattern Programming & Logic Building

Program to find Armstrong numbers (1–100)

Program to print decreasing numeric pattern (12345, 1234, …)

Part 4 – Matrices & Student Database

Program to add two 3×3 matrices

Program to create a student database and search by name

Part 5 – Pointers & File Handling Functions

Program to reverse a string using pointers

Explanation of file functions: getw(), putw(), fscanf(), fprintf()

This section evaluates advanced logic, memory concepts, file operations, and multi-step programming.