M.C.A-M.C.A C AND DATA STRUCTURE(Alagappa University - Directorate of Distance Education-2011)

DISTANCE EDUCATION

M.C.A. (Non-Semester) DEGREE EXAMINATION, DECEMBER 2011.

C AND DATA STRUCTURE

(2001 onwards)

Time : Three hours Maximum : 100 marks

Answer any FIVE questions.

All questions carry equal marks. (5 × 20 = 100)

1. (a) Explain the usage of structures in C. (10)

(b) Explain the feature of unions in C. (10)

2. (a) How arrays are used in C? (10)

(b) Explain the concept of array as functions argument. (10)

3.(a) Explain the structure of ‘C’ program with example. (10)

(b) Explain the formatted I/O operations in details. (10)

4.(a) Write the algorithm for push and pop operations on stack. (10)

(b) Explain the various operations performed on doubly linked list. (10)

5. (a) Explain binary search with an algorithm. (10)

(b) Write the algorithm for addition and deletion operations on queue. (10)

6. (a) Explain various characters I/O functions available with example. (10)

(b) Explain the evaluation of postfix expansion using stack and evaluate the following (10)

(i) 10 5 + 30 20 –1

(ii) 20 10 5 50 – +

7. (a) List out some of the sorting techniques. Explain how bubble sort is applied to sort a given list. (10)

(b) Explain about trees and their applications. (10) 

8. (a) Explain the features of pointers and arrays with example. (10)

(b) Explain the functions of loop control structures with example. (10)

Earning:  ₹ 3.25/-