Tamil Nadu Open University (TNOU) 2009-1st Year B.C.A Computer Application .>>‘C’ PROGRAMMING AND DATA STRUCTURES>>E .>> - Question Paper

B.C.A. DEGREE EXAMINATION
JUNE 2009.

First Year

C PROGRAMMING AND DATA STRUCTURES

Time : 3 hours Maximum marks : 60/75

PART A (4 5 = 20 / 5 5 = 25 marks)

Candidates with enrolment number starting with A4BCA and C5BCA should answer any FOUR
from Qn. 1 to 6 and all others should answer any FIVE from Qn. 1 to 7 in Part A.

1.         Explain Bitwise Operators.

2.         Briefly explain the Library functions.

3.         List out the rules for naming variables.

4.         With suitable example, explain the use of conditional operator.

5.         Explain Linear search briefly.

6.         Discuss on representation of arrays.

7.         What is an AVL tree? Give example.

PART B (4 10 = 40 / 5 10 = 50 marks)

Candidates with enrolment number starting with A4BCA and C5BCA should answer any FOUR
from Qn. 8 to 13 and all others should answer any FIVE from Qn. 8 to 14 in Part B.

8.         List the priority and associativity of various operators in C.

9.         Explain call by value and call by reference with suitable examples.

10.       Write a program to find the length of the given character string without using library functions.

11.       Explain the pointers expression with suitable example.

12.       Explain the procedure for implementing Queue operations.

13.       Briefly explain symbol table with an example.

14.       Explain file organisation in detail.