Friday, May 29, 2015

Sathyabama University Nov 2010 BE 412304-511304-512304-6C0043 Data Structures & Algorithms

Register Number







                               
SATHYABAMA UNIVERSITY
(Established under section 3 of UGC Act, 1956)

Course & Branch: B.E/B.Tech-CSE/DCS/IT
Title of the Paper: Data Structures & Algorithms Max. Marks: 80
Sub. Code: 412304-511304-512304-6C0043         Time: 3 Hours
Date: 26/11/2010                                                    Session: FN
______________________________________________________________________________________________________________________

PART - A                (10 X 2 = 20)
Answer ALL the Questions

1.     What is dynamic memory allocation?
 
2.     Write any two applications of doubly linked list.

3.     Define heap structure.
                                                 
4.     What is biconnected component of a graph?

5.     What is an external sorting? Give an example.

6.     What is a sequential file?

7.     What is meant by minimum spanning tree?

8.     Write basic idea behind the divide and conquer problem.

9.     State the principle of dynamic programming.

10.   What is knapsack problem?



  PART – B                     (5 x 12 = 60)
Answer All the Questions

11.   Explain the insertion and deletion operations of singly linked list.
(or)
12.   (a) Explain how queues can be implemented using arrays.
(b) List the applications of stack.

13.   (a) Explain the different tree traversals.
(b) Write an algorithm to find an element from binary search tree.
(or)
14.   Explain the different representations of a graph with an example.

15.   Explain the quick sort algorithm with suitable example.
(or)
16.   (a) Write the algorithm for binary search.
(b) Write a short note on pattern matching in strings.

17.   (a) Explain the various asymptotic notations of an algorithm.
(b) Write a short note on greedy method.
(or)
18.   Explain the merge sort algorithm with suitable example.

19.   State the 8-queen’s problem. Design an algorithm to find a solution to this problem using backtracking method.
(or)
20.   Explain the traveling salesman problem using branch and bound.


Share This
Previous Post
Next Post

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as www.IndianUniversityQuestionPapers.com . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!

0 comments:

Pen down your valuable important comments below

Search Everything Here