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
FirstRanker.com
A Firstranker's choice
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
--- Content provided by FirstRanker.com ---
MCA II Semester Examinations, April/May - 2019
DATA STRUCTURES AND ALGORITHMS
Time: 3hrs Max.Marks:75
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
--- Content provided by FirstRanker.com ---
consists of 5 Units. Answer any one full question from each unit. Each question carries10 marks and may have a, b, c as sub questions.
PART - A
5 x 5 Marks =25
- a) Explain the operations of Queue with an example. [5]
- b) What are the applications of Heap? [5]
- c) Differentiate between Bubble sort and Insertion sort with an example. [5]
- d) What are the properties of Red-Black tree? [5]
- e) Write the flow chart of KMP. [5]
--- Content provided by FirstRanker.com ---
PART -B
--- Content provided by FirstRanker.com ---
5 x 10 Marks =50- Write an algorithm to find the reverse of a given number and also its complexity of the same. [10]
OR - Write an algorithm to find the number of occurrences of All Elements in a Linked List. [10]
- Explain how to represent the graph in the memory with an example. [10]
OR - a) Explain the realization of a priority Queue using heap.
b) Write an algorithm of DFS. [5+5] - Write an algorithm of Quick Sort. [10]
OR - Insert the following list of elements into the Hash Table by using Quadratic Probing ( Size of Hash table is 10) 44, 15, 60, 24, 66, 30, 21, 18. [10]
- Construct the AVL ā tree of the following list of elements 65, 89, 10, 5, 43, 28, 54. [10]
--- Content provided by FirstRanker.com ---
OR - Write an algorithm to delete an element from the B-tree. [10]
- Consider n = 4 and the identifier set (al,a2,a3,a4) = (do, if, int, while). The values for pās and qās are given as p (1:4) = (3,3,1,1) and q(0:4) = (2,3,1,1,1). Construct the optimal binary search tree. [10]
OR--- Content provided by FirstRanker.com ---
- Apply the all- pairs shortest algorithm to the weighted graph whose adjacency matrix is: [10]
0 2 ā 1 8
6 0 3 2 ā
ā ā 0 4 ā--- Content provided by FirstRanker.com ---
ā ā 2 0 3
[3 ā ā ā 0]
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- 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