BTS-I&[-04.19- 0401 Reg.No.

B.Tech. Degree I & II Semester (Combined) Examination

April 2019
TT/C S/C E/SEIIVIE tEE IE,B IEC NIIF T
108 COMPUTERPROGMG
(2006 Scheme)

Time : 3 Hours Maximum Marks : 100

PART A
(Answer,{ZI questions)

(8x 5 = 40)
I. (a) Describe the structure of a C program.
(b) Distinguish between break and continue.
(c) What are 'union' in C? Explain with example.
(d) Describe the term recursion. Write its advantages.
(e) What is a data structure? Why an array is called a data structure?
(0 Compare stnrcture and unions.
(g) What are pointers? Explain with example.
(h) Write a note on pre-processor directive.

PART B

f[. Write a C program to find the prime numbers between I and 100.
OR
m- (a) Describe the various operators available in C language. Also explain its (8)
operator precedence and associativity.
(b) Write a note on (i) Type conversion (ii) Formatted VO. (7)

fv. Write a C program to convert a decimal number to octal. (ls)

OR
V. Explain automatic, extemal and static variable storage classes. Also write (1s)
multi-function programs to illustrate each of them.

VI. Write an algorithm and a C prograln to sort a list of names entered from the (ls)
keyboard.
OR
Vil. Write an algorithm and a program that reads a string from the key board (ls)
and determines whether the string is a palindrome or not.

VIII. Write an algorithm and a C program to transpose a matrix of order m x n. (ls)

OR
IX. (a) Desoribe typical applications of pointers in developing programs. (7)
(b) Write short note on : (i) type def (ii) enum (8)

,F**