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

Download JNTUH (Jawaharlal nehru technological university) MCA (Master of Computer Applications) 2nd Sem (Second Semester) Regulation-R132018 January 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.com

Code No: 812AF

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

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

MCA II Semester Examinations, January - 2018

DATA STRUCTURES AND ALGORITHMS

Time: 3 Hours Max. Marks: 60

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 20 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks and may have a, b, c as sub questions.

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

PART - A 5 x 4 Marks = 20

  1. a) Define Performance Analysis? Explain the Techniques. [4]
  2. b) Write about Disjoint Sets. [4]
  3. c) Explain Linear Search with an example. [4]
  4. d) Explain Splay Trees with an example. [4]
  5. --- Content provided by FirstRanker.com ---

  6. e) Write short note on Pattern matching. [4]

PART - B 5 x 8 Marks = 40

  1. Define Algorithm and Write the Algorithm to implement Queue Operations and also analyze its complexity. [8]
    OR
    Define ADT and write the procedure to convert infix to postfix expression. [8]
  2. --- Content provided by FirstRanker.com ---

  3. a) Write the procedure for Depth First Search.
    b) Explain Binary Tree Representation methods. [4+4]
    OR
    Explain about Graph Representation methods with an example. [8]
  4. a) What is Hashing? Explain in detail.

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

    b) Write about Radix Sort with an example. [4+4]
  5. a) Define Divide and Conquer method. Explain Quick Sort.
    b) Discuss in detail about merge sort with an example. [4+4]
  6. What is B-Tree? Explain about B-Tree with an example. [8]
  7. Define BST. Discuss about Binary Search Tree operations with examples. [8]
  8. --- Content provided by FirstRanker.com ---

  9. a) Write the procedure to implement KMP algorithm.
    b) Write about Minimum Cost Spanning Tree. [4+4]
    OR
    a) Explain Tries with examples.
    b) Write about Kruskal’s Algorithm. [4+4]
  10. --- 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 ---