Data Structure & Algorithms S.E./I.T./Sem - III (December 2010)

Data Structure & Algorithms (3 Hours)
S.E./I.T./Sem - III		GT-6309 [Total Marks :- 100]
1	a) What are linear and non-linear data structures? b) Why is it necessary to analyze an algorithm? c) What are Asymptotic notation d) What is an Abstract data type?	20
2.	a) Explain how a stack can be used to execute computation of mathematical expressions. For example consider the expression (a+b) * (b-c) b) Write a program to create single link list and display the list	10 10
3.	a) Explain map abstract data type. b) What are circular and priority queues.	10 10
4.	a) What is binary search tree. Suppose the following list of letters is inserted      in order into an empty BST      J  R  D  G  T  E  M  P  A  F  Q. Find the final tree.	10 10
5.	a) Explain selection sort and write a program to implement selection sort. b) Write an algorithm and explain with an example radix sort method.	10 10
6.	a) Find out the minimum cost spanning tree for below graph using kruskals     and prims method.

b) Write any pattern matching algorithm and explain it with suitable example.

 
10




10


 
7.
Write short notes on any four:-
 b) Red-Black trees
 c) Text Compression
 d) Graph Traversals
 e) Recursion
 f) Comparison of sorting algorithms.
 g) Searching algorithm
20

Also see Data structure & algorithms question papers for December 2012