DATA STRUCTURES AND ALGORITHMS-Btech-MG University-May2013

Question of Data structures and algorithms may 2013

B.TECH. DEGREE EXAMINATION, MAY 2013

Fourth Semester

Branch: Computer Science and Engineering/Information Technology

DATA STRUCTURES AND ALGORITHMS

(Regular-2010 Admissions)

Time: Three Hours Maximum:100 Marks

 

Answer all questions.

Part A

Each question carries 3 marks.

 

1. What is meant by folding?

2. Define a stack?

3. State the advantages and disadvantages of linked lists

4. Define a binary tree and a binary search tree

5. What are the factors to be considered while choosing a sorting technique?

 

Part B

Each question carries 5 marks.

 

6. Explain the system life cycle.

7. Explain in detail the PUSH and POP operation in stack

8. Explain the process of polynomial addition in linked lists

9. State the merits and demerits of linked representation of a binary tree

10. Explain in quick sort algorithm

 

Part C

Each question carries 12 marks.

 

11. Explain in different types of Hashing techniques

or

12. Explain in Collision resolution techniques

 

13. Explain priority queues in detail

or

14. Explain Towers of Hanoi problem in detail

 

15. Explain in brief the traversal of nodes in a circular doubly linked list

or

16. Explain in brief deletion nodes in various positions in a circular singly linked list

 

17. What is meant by binary tree traversal? What are the different traversal techniques

or

18. Discuss a non-recursive algorithm to perform inorder traversal of a binary tree

 

19. Explain the bubble sort and insertion sort algorithm

or

20. What is meant by External sorting?Explain in external sorting technique

 

data-structures-and-algorithms-btech-mg-university-may2013