# Pondicherry University 2009 B.C.A Computer Application ,Data structure - Question Paper

Monday, 28 January 2013 12:30Web

B.C.A DEGREE EXAMINATION, MAY 2009

Second semester

info TECHNOLOGY

FUNDAMENTALS OF DATA STRUCTURES

**PART-A**(10*2=20 MARKS)

1. Distinguish ranging from sorting and searching.

**2.**describe hashing.

**3.**What is queue? provide examples.

**4.**List the advantages of binary search.

**5.**How to implement the list operations?

**6.**describe linked list.

**7.**What is a traversal?

**8.**What is a spanning tree?

**9.**explain the different representations of graphs.

**10.**How data structure is supporting for garbage collection?

**PART-B**(5*6=30 MARKS)

ans ANY 5 ques..

11 . discuss linear search with an example.

12 explain an algorithm to generate a 2-way merge tree.

13 Write procedures to ADD an element into a stack and DELETE an element from a stack.

14 . What is priority queue? How is it implemented?

15 Explain doubly linked list algorithm with adding and deleting an element.

16 . discuss binary search trees with its properties.

17 Discuss Kurskal’s algorithm for constructing minimum spanning tree.

18 . discuss polynomial addition.

**PART-C**(5*10=50 MARKS)

ans ALL ques.

**1**

**9.****(**discuss merge sort algorithm with example.

**a)**Or

**(**discuss hashing and hash functions.

**b)**20.

**(**discuss the algorithm for insertion and deletion operation of queue.

**a)**Or

**(**Translate every of the subsequent prefix expression into infix, postfix and then evaluate it.

**b)**(i) * - nine + two three – seven 1

(ii) * + - nine two three – seven 1

(iii) / + * three eight four + six – three 2

(iv) / + four * three eight + - three two 6

**2**

**1.****(**write the algorithm which is used to delete the node N with a provided ITEM of info from the single linked list. provide an example.

**a)**Or

**(**discuss in detail about threaded binary tree with suitable examples.

**b)**22.

**(**discuss traversal techniques with suitable examples.

**a)**Or

**(**discuss Dijkstra’s shortest path algorithm.

**b)**----------------

Earning: Approval pending. |