Semester : S1 and S2
Subject : Computer Programming
Year : 2018
Term : JULY
Branch : BIOTECHNOLOGY
Scheme : 2015 Full Time
Course Code : CS 100
Page:1
Reg No.:
Max. Marks: 100
a)
b)
a)
b)
a)
E2110 (ര Pages: 2
Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SECOND SEMESTER B.TECH DEGREE EXAMINATION, JULY 2018
Course Code: CS100
Course Name: COMPUTER PROGRAMMING (CS, IT)
PART A
Answer all questions, each carries 2 or 3 marks
Describe the structure of a C program. List out the features of C Language.
Briefly explain basic data types in ಛಿ,
Write a C program to find the largest among three numbers using conditional
expression ((f
Compare structure and array in C with suitable example.
What does the variable ‘a’ specifies in the following declarations in C?
i) float *a;
ii) int *a[10];
How a pointer to a structure is declared in C? Explain how members of a
structure are accessed through a pointer variable.
List out the main components which comprise a function definition.
Write a C program to find the factorial of a given number using recursion
method.
Describe actual parameter and formal parameter of a function in C program with
examples.
Write a note on storage classes in ಲಿ.
Explain dynamic memory allocation in C. Give in detail two dynamic memory
allocation functions in C.
With example explain any three file opening options in C.
Briefly explain unformatted file in C. Give the format of fwrite function in 0.
Consider the following function declarations:
void display ( int );
int display(int);
Differentiate between the two given declarations.
Briefly explain the syntax rules for switch statement.
PART B
Answer any 4 full questions, each carries 8 marks
Write a C program to solve a quadratic equation taken into account all possible
roots.
Compare while loop and do-while loop in C with an example.
Write a C program to find the transpose of a given matrix.
List out the advantages and disadvantages of union over structure in C.
Write a C program that reads a string from the keyboard and determines whether
Page 1 of 2
3
Duration: 3 Hours
Marks
(3)
(2)
2)
(2)
(2)
(2)
(3)
(2)
(3)
(2)
(3)
(3)
(3)
(3)
(2)
(2)
(6)
(2)
(6)
(2)
(6)