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's choice
Code No: 821AF R15
--- Content provided by FirstRanker.com ---
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
--- Content provided by FirstRanker.com ---
MCA II Semester Examinations, January - 2018
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
- What are the applications of stacks and queues? [5]
- Discuss about Union and Find Algorithms. [5]
- Write down the differences between linear searching and binary searching. [5]
- What are the advantages and disadvantages of Splay Trees? [5]
- Formulate Job Sequencing with Deadlines problem and explain briefly. [5]
--- Content provided by FirstRanker.com ---
PART -B
5 x 10 Marks = 50
--- Content provided by FirstRanker.com ---
- Find the upper bound of the recurrence relation: T(n) = T(n/2) + T(2n/3) + 1. Write the pseudocode which inserts the element at the right end of an array representation of a linear list and give an example. [5+5]
OR
Explain the single linked list operations with appropriate algorithms. - Explain various operations of stack data structure with relative example. [5+5]
- What is a priority queue? State the applications of priority queue.
--- Content provided by FirstRanker.com ---
Show the result at each pass of inserting the following elements in to an empty min heap: 1,2,3,4,5,6,7,8,9,10, 11, 12, 13, 14, 15. [4+6]
OR
Write down the algorithm for DFS graph traversal technique and explain with an example. [10] - What is collision in Hashing? Explain various methods to resolve the collision. [10]
OR--- Content provided by FirstRanker.com ---
Sort the following numbers using Radix sort: 100, 300, 95, 60, 10, 900, 800 showing positions of various buckets.
Mention the advantages and disadvantages of Radix sort. [6+4] - Suppose the following list of numbers is inserted in order into an empty binary search tree: 45, 32,90, 34, 68, 72, 15, 24, 30, 66, 11, 50, 10.
a) Construct the binary search tree.
b) Find the in-order, pre-order and post-order traversal of BST created. [4+6]--- Content provided by FirstRanker.com ---
OR
Explain insertion and deletion operations of an AVL Tree. [10] - Explain the problem of optimal binary search Tree construction and give the solution method by the dynamic programming formulation. [10]
OR
Discuss the Knuth-Morris-Pratt pattern matching algorithm with an example. [10]
--- 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 ---