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 R13 2020 November 812AF Data Structures And Algorithms Question Paper

Download JNTUH (Jawaharlal nehru technological university) MCA (Master of Computer Applications) 2nd Sem (Second Semester) Regulation-R132020 November 812AF 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's choice

Code No: 812AF R13

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

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

MCA 1I Semester Examinations, October/ November - 2020

DATA STRUCTURES AND ALGORITHMS

Time: 2 Hours Max. Marks: 60

Answer any five questions

All questions carry equal marks

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

  1. a) Write ADT of Stack procedures for insert and deletion operations.
  2. a) Write a C++ program for converting the given infix expression into its prefix form using Stack. [12]
  3. b) Discuss the asymptotic notations used in algorithm with examples.
  4. Write a C++ program for Insert and deletion operations of an element in the singly Linked list. [12]
  5. What is Heap? How to implement the priority Queues with heap Explain. [12]
  6. --- Content provided by FirstRanker.com ---

  7. Write a recursive procedure for Preorder and Post order traversal of binary tree.
  8. Explain the different ways of representing graphs in memory with suitable example. [12]
  9. Explain how divide conquer can-be used to binary search. Express the time complexity by solving the corresponding recurrence relation. [12]
  10. Explain with example the chaining method of resolving collisions in Hashing. [12]
  11. Explain AVL trees with example. [12]
  12. --- Content provided by FirstRanker.com ---

  13. Construct an optimal binary search tree for the following data n=4, (al,a2,a3,a4) = (do,if,int,while), p(1:4)=(3,3,1,1) and q(0:4)=(2,3,1,1,1). [12]

---00000---

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