IGNOU BCA CS-62: 'C' PROGRAMMING & DATA STRUCTURE - JUNE 2010 QUESTION PAPER

________________________________________

BACHELOR IN COMPUTER APPLICATIONS

Term-End Examination

June, 2010CS-62: 'C' PROGRAMMING & DATA STRUCTURE

Time : 2 Hours

Max. Marks : 60

________________________________________

Note : Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' language.

________________________________________

1. (a) Write an algorithm to implement bubble sort, and sort the following list in descending order by using the algorithm.

15, 12, 4, 16, 9, 10, 94

What is the average run-time complexity of the bubble sort? [10]

(b) What do you mean by traversal of a tree? Explain the difference between preorder and post order with the help of illustrations. [10]

(c) Show how a polynomial can be represented using linked list. Write an algorithm to add two polynomials containing minimum of four terms. [10]

2. (a) Write an algorithm which accepts a stack as input and reverses the element of the stack using one additional queue. [6]

(b) Write at least two differences between a structure and a union in ‘C’ language. Give an example of each. [4]

3. (a) Find the minimum coast spanning tree of the following graph using PRIM’s algorithm. Graph Will Be Available Soon At WWW.MYIGNOUBCA.BLOGSPOT.COM [5]

(b) Explain indexed sequential file organisation. Name the data structure most appropriate for this file organisation. [5]

4. (a) Write an algorithm for implementation of Breadth First Search (BFS). [5]

(b) What is binary search tree? List its advantages. [5]

5. Given two sorted lists L1 and L2, write an algorithm to compute L1 U L2. [10]

By Vicky J

## No comments:

Post a Comment