Deemed University 2011 B.C.A Computer Application University: Lingayas University Term: III Title of the : Data Structures Using C - Question Paper

Roll No. ..

 

Lingayas University

BCA 1^st Year (Term II)

Examination Feb 2011

Data Structures Using C (CA - 1102)

 

[Time: 3 Hours] [Max. Marks: 100]

 

Before answering the question, candidate should ensure that they have been supplied the correct and complete question paper. No complaint in this regard, will be entertained after examination.

 

Note: Attempt five questions in all. All questions carry equal marks. Question no. 1 is compulsory. Select two questions from Section B and two questions from Section C.

Section A

 

Q-1. Answer the following questions:

(a) Explain Priority Queues. [5]

(b) Write the functions for push and pop operations in stack. [5]

(c) What is a data structure? Discuss different types of data structures. [5]

(d) Discuss with example notations for worst-case, best-case and average-case timing analysis. [5]

 

Section B

 

Q-2. Explain with examples various operations on Binary Search Trees. [20]

 

Q-3. Define Link-List. What are its advantages and disadvantages over arrays? Discuss different types of link-lists. [20]

 

Q-4. Discuss different ways of representing graphs with example. [20]

 

Section C

 

Q-5. Write a program to implement simple queue using link-list. [20]

 

Q-6. Explain storage representation of 1-D, 2-D, 3-D and in general N-D arrays. [20]

 

Q-7. (a) Design the code for recursively finding factorial of a given number. [10]

(b) Write the function for merge sort. [10]

 

Q-8. Write algorithm for Quick Sort. [20]