Download JNTUH MCA 2nd Sem R15 2019 December 821AF Data Structures And Algorithms Question Paper

FirstRanker.com

Code No: 821AF R15

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

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

FirstRanker.com

MCA I Semester Examinations, December - 2019

DATA STRUCTURES AND ALGORITHMS

Time: 3hrs Max.Marks:75

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

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

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

PART - A

5 x 5 Marks = 25

1. a) Write an algorithm to insert an element in a single linked list [5]
2. b) List and explain the applications of non linear data structures [5]

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

3. c) Give a brief note on collision resolution methods. [5]
4. d) Define a binary search tree and what are the properties of binary search tree. [5]
5. e) What do you mean by a spanning tree. [5]

PART -B

5 x 10 Marks = 50

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

1. Explain the Sequential and Linked allocation. Compare and contrast exponential time complexity with polynomial time complexity [5+5]
   OR
   Analyze the best, average and worst-case time complexities of linear search with an example list of size n. [10]
2. Write algorithm to implement depth-first search and explain with example. [10]
   OR
   

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

   Explain the threaded binary trees:
3. Write disjoint set union and find algorithms. [5+5]
4. Search for the element-3 in the array that contain 1,3,5,2,4,6,8 using binary search. [10]
   OR
   Explain hash tables and hash functions. [10]

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

5. Construct binary search tree for given data and write the different traversals of tree. (100 150 125 25 12 50 135 75 62 175). [10]
   OR
   Explain insertion and deletion operations on a B-Tree. [10]
6. Device an algorithm to find the optimal order of multiplying n matrices using dynamic programming technique. Give a brief note on Suffix tries. [5+5]
   OR
   

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

   Find the shortest tour of traveling salesperson for the following cost matrix using Dynamic Programming [10]

 0 12 15 11 ∞ 13 

FirstRanker.com

---00000---