FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download JNTUH MCA 2nd Sem R17 2021 July-August 842AA Data Structures And Algorithms Question Paper

Download JNTUH (Jawaharlal nehru technological university) MCA (Master of Computer Applications) 2nd Sem (Second Semester) Regulation-R17 2021 July-August 842AA Data Structures And Algorithms Previous Question Paper

This post was last modified on 17 March 2023

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
Firstranker's choice
Code No: 842AA R17

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

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA II Semester Examinations, July/August - 2021
DATA STRUCTURES AND ALGORITHMS
Time: 3 Hours Max.Marks:75

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

Answer any five questions
All questions carry equal marks

  1. a) Rearrange following numbers using Quick sort: 10, 6, 3, 7, 17, 26, 56, 32, 72.
    b) Give the properties asymptotic notations. [7+8]
  2. Trace the Merge sort algorithm to sort the list A, V, I, S, H, K, R, U, T, H in alphabetical order. [15]
  3. --- Content provided by FirstRanker.com ---

  4. What is the solution generated by function Job Sequencing algorithm when n = 6 (P1,P2,P3,P4,PsPe) = (3, 5, 20, 18, 1, 6 ) and (D1,D2,D3,D4,D5,D6) = (1, 3, 4, 3, 2, 1). [15]
  5. What is a Spanning tree? Explain Prim’s and Krushkal’s algorithm with the following graph. [15]
     AT CMH N 
  6. Draw an Optimal Binary Search Tree for n = 4 identifiers (al,a2,a3,a4) = ( do, if, read, while) P(1:4) = (3,3,1,1) and Q(0:4) = (2,3,1,1,1). [15]
  7. Discuss the 4 — Queen’s problem. Draw the portion of the state space tree for n = 4 Queens using backtracking algorithm. [15]
  8. a) Define Max Heap. Construct Max Heap for the following:

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

    140, 80, 30, 20,10 ,40 ,30 ,60,100,70 ,160 ,50 , 130, 110, 120. [15]
    b) Show that the maximum number of nodes in a Binary tree of height ‘h’ is 2h-1.
  9. Explain in detail about creation of a Binary Search Tree with suitable example. [7+8]

---00000---

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

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 ---