Download JNTUH MCA 2nd Sem R13 2019 December 812AF Data Structures And Algorithms Question Paper

FirstRanker.com

Code No: 812AF

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

--- Content provided by​ FirstRanker.com ---

MCA I Semester Examinations, December - 2019

DATA STRUCTURES AND ALGORITHMS

Time: 3 Hours Max. Marks: 60

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 20 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks and may have a, b, c as sub questions.

--- Content provided by FirstRanker.com ---

PART - A 5 x 4 marks =20

1. a) Define a single linked list, Write the structure of the linked list with neat sketch. [4]
2. b) Explain the representations of graphs. [4]
3. c) Write a program to sort an array of integers using selection sort. [4]
4. d) Insert 02,36,09,06,14,27,28 into BST. [4]

--- Content provided by​ FirstRanker.com ---

5. e) What is dynamic programming? When to apply it. [4]

PART -B 5 x 8 marks =40

1. Explain the Operations on Doubly Linked Lists. [8]

   OR

2. a) List and explain the applications of stack ADT. b) Write an algorithm to find the sum of n-numbers and also analyze its time complexity. [4+4]

--- Content provided by‍ FirstRanker.com ---

3. Differentiate between BFS and DFS traversals. Take an example graph and implement the BFS traversal. [8]

   OR

4. a) Define tree and what are the properties of trees? b) Explain the different types tree traversals. [4+4]
5. a) Explain the worst-case time complexity in the quick sort. b) Explain the different types of Hash functions are used in hashing. [4+4]

   OR

--- Content provided by‍ FirstRanker.com ---

6. Perform heap sort algorithm for (10 15 6 2 25 18 16 2 20 4). [8]
7. Define AVL trees. Explain the rotations involved in balancing an unbalanced AVL tree. [8]

   OR

8. a) Write the insertion algorithm of red-black tree. Also analyze its time complexity [8] b) What are properties of B-Tree.
9. Compare the Standard Tries and Compressed Tries with an example. [8]

   OR

   --- Content provided by FirstRanker.com ---

10. State and explain the Knuth-Morris-Pratt algorithm with an example. [8]

---00000---