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 R15 2018 January 821AF Data Structures And Algorithms Question Paper

Download JNTUH (Jawaharlal nehru technological university) MCA (Master of Computer Applications) 2nd Sem (Second Semester) Regulation-R15 2018 January 821AF 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: 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

  1. What are the applications of stacks and queues? [5]
  2. Discuss about Union and Find Algorithms. [5]
  3. --- Content provided by FirstRanker.com ---

  4. Write down the differences between linear searching and binary searching. [5]
  5. What are the advantages and disadvantages of Splay Trees? [5]
  6. Formulate Job Sequencing with Deadlines problem and explain briefly. [5]

PART -B

5 x 10 Marks = 50

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

  1. 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.
  2. Explain various operations of stack data structure with relative example. [5+5]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. --- 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 ---