Download JNTUH MCA 2nd Sem R17 2020 November 842AA Data Structures And Algorithms Question Paper

FirstRanker.com

Code No: 842AA R17

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

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

MCA I Semester Examinations, October/ November - 2020

DATA STRUCTURES AND ALGORITHMS

Time: 2 Hours Max.Marks:75

Answer any five questions

All questions carry equal marks

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

1. a) Write an algorithm to implement Merge sort applying Divide and Conquer method.
   b) Apply Merge Sort to sort the following elements in the ascending order.
   20, 12, 14, 85, 94, 45, 74, 33, 25, 67. [7+8]
2. Write an algorithm for Prim’s algorithm to find minimum cost spanning tree. [15]
3. a) Write the General method for Backtracking design method.
   

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

   b) Write an algorithm to N-Queens problem and explain with an example of considering
   4*4 chess board. [7+8]
4. a) Write an algorithm for Insertion sort technique and apply it for arranging the following
   elements in ascending order
   25,77, 88, 54, 96, 32, 14, 59, 64.
   

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

   b) Write algorithms to implement Skip lists operations: insertion and deletion. [7+8]
5. a) Define a Binary Tree and write the applications of binary trees.
   b) Write an algorithm for Depth First Search (DFS) traversal of a graph and give an
   example. [7+8]
6. a) Explain Strassen’s matrix multiplication.
   

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

   b) Write an algorithm for Binary search. Give its time complexity analysis. [7+8]
7. Let n=5, (p1.....p5) = (20, 15, 10, 5, 1) and (d1...d5) = (2, 2, 1, 3, 3). Find out an optimal
   solution for given job sequence with deadlines problem using Greedy method. [15]
8. a) Write the General method for Dynamic programming.
   b) Let n=4 and {a1, a2, a3, a4} = {do, if, int, while}. Let p[1...4]={3, 3, 1, 1} and
   

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

   q[0..4]={2,3,1,1,1} construct the optimal binary search tree. [7+8]

FirstRanker.com