Firstranker's choice
Code No: 821AF R15
--- Content provided by FirstRanker.com ---
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA I Semester Examinations, June/July - 2018
DATA STRUCTURES AND ALGORITHMS
Time: 3hrs Max.Marks:75
--- Content provided by FirstRanker.com ---
Note: This question paper contains two parts A and B.
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
- Explain about the Asymptotic notations. [5]
- Write an algorithm for DFS traversal. [5]
- Write an abstract algorithm of Divide and Conquer method. [5]
- What are the properties of Red- Black tree? [5]
- Explain about the Compressed trie with an example. [5]
--- Content provided by FirstRanker.com ---
PART -B 5 x 10 Marks =50
- Explain the operations of Doubly linked list with an example.
- Write an algorithm to find whether the given number is a palindrome or not and also compute the time complexity of the same. [5+5]
OR
Write an algorithm to convert the infix expression to postfix expression and also compute the time complexity of the same. - Differentiate between stack and queue. [5+5]
OR--- Content provided by FirstRanker.com ---
Write a Non — recursive algorithm of tree traversals and also compute the complexity of the same. [10] - Explain about the union and find algorithms with an example and also how to improve the complexity of the same. [10]
OR
Derive the time complexity of Quick sort in an average case. [10] - Insert the following list of elements into the hash table by using Quadratic probing (size of hash table is 10)
--- Content provided by FirstRanker.com ---
45, 67, 30, 89,27, 37, 11, 76
OR
Explain about the Radix sort with an example. [5+5]
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
Firstranker's choice
- Construct the B-tree of order 4 of the following data
12, 40, 69, 34, 90, 22, 45, 89, 78, 56, 47, 36
OR
Write an algorithm to delete an element from the binary search tree. [5+5] - What is Splay tree? Explain the Splaying operations of Splay tree with an example.[10]
OR
Consider the following text T and pattern P
Text: THIS IS AN EXAMPLE
Pattern: AMPLE--- Content provided by FirstRanker.com ---
Apply the KMP algorithm and illustrate the intermediate steps. [10] - Consider 4 elements a1 < a2 < a3 < a4 with q(0) = ½, q(1) = ¼, q(2)=q(3)=q(4) = ?:
p(1)= ½ ,p(2)= ¼ ,p(3)=p(4) = ? Construct the optimal binary search tree. [10]
--- Content provided by FirstRanker.com ---
---00000---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUH MCA 2nd Sem Last 10 Years 2023-2013 Question Papers R20-R09 || Jawaharlal nehru technological university
--- Content provided by FirstRanker.com ---