109 computer

BTECH DEGREE I&II SEMESTER EXAMINATION MAY 2007

COMPUTER PROGRAMMING

Time:3Hrs Max marks:100

PART A

1. 1) Explain the various data types in C clearly describing the size of each& its variation

in a tabular form with eg

2) Discuss about C preprocessors in detail.

3) Explain the static & extern storage class with eg.

4) Distinguish call by value & call by reference.

5) Distinguish array of pointers & array of structures.

6) Explain enumerated data types& typed if structures.

7) Explain the concepts of pointers with eg.

8) Explain the concepts of recursion with an eg clearly showing the various stages.

PART B

2. Write a C program to print all Armstrong no.s b/w 1&100

OR

3. Write a C program to reverse the digits of a no. Also display whether it is a

palindrome no.

4. Write a C program to generate first 10 Fibonacci no.s using recursion.

OR

5. Write a C program to convert a decimal no. to binary no.

6. Write a C program to demonstrate function pointers & function returning pointers.

OR

7. Write a C program to prepare a cricket player data base using array of structures with

fields , player no. ,name, highest score. Write a function to prepare a sorted list of

players according to highest score & search according to player id.

8. Write a C program to perform selection sort & linear search on an array making

suitable assumptions

OR

9. Write a C program using function to perform the following

1) Find pow(a,b) without using library functions.

2) Strcpy(S1,S2) without using library functions.

---------------------------------------