How To Exam?

a knowledge trading engine...


Rajasthan Technical University 2010-3rd Sem B.Tech Computer Science and Engineering : ( - ) Data Structures & Algorithms - Question Paper

Friday, 24 May 2013 11:30Web

B.tech III Semester (Main) Examination, February 2010
(Common for Comp. Engg. & IT)
Data Structures & Algorithms


Unit I

1. describe the Computer Algorithm? elaborate different characteristics of Algorithm? Why it is difficult to estimate the execution time of Algorithm? How execution time is calculated?

2. a) What do you understand by Asymptotic Notations? discuss the notation big 'O' Theta and Omega with suitable example.
b) describe the storage element array. elaborate the different operation performed on array? discuss with example.


Unit II

3. a) What do you understand by polynomial algorithm? discuss with example.
b) Write an algorithm multiplication of sparse matrices.

4. a) Write an algorithm for de-queue and circular queue.
b) How is stack useful in function Car and Return? Write an algorithm for Recursion.

Unit III

5. What do you mean by searching? Differentiate ranging from sequential search and binary search with suitable example.

6. Write an algorithm to implement stack. queue and de-queue by using linked list data structure and also write how insertion and deletion will take place.

Unit IV

7. a) What is a threaded and threaded binary tree data structure? How they are represented in memory? discuss with example.
b) What do you mean by AVL tree? Insert the subsequent list of data in an AVL tree:
50,63,65,69,71,72,200,0,7 and 63.

8. a) How is B-tree are various from B+ tree? elaborate their merits and demerits?
b) describe the tree. elaborate their characteristics? elaborate the application of tree?

Unit V

9. a) describe minimum spanning tree algorithm? Write Kruskal Algorithm with suitable exampleand discuss.
b) What do you understand by Heap? discuss with suitable example.

10 a) describe the graph traversal. Which graph Traversal is better? discuss depth 1st search traversal.
b) Which is the better sorting method among Radix, Bubble, Quick , Insertion and Why?


( 1 Vote )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Rajasthan Technical University 2010-3rd Sem B.Tech Computer Science and Engineering : ( - ) Data Structures & Algorithms - Question Paper