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 AKTU B-Tech 1st Sem 2016-2017 REE 101 Basic Electrical Engineering Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU)) B-Tech 1st Semester (First Semester) 2016-2017 REE 101 Basic Electrical Engineering Question Paper

This post was last modified on 29 January 2020

AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University


ANIL NEERUKONDA INSTITUTE OF TECHNOLOGY & SCIENCES (AUTONOMOUS)

3/4 B. Tech I-Semester Regular Examinations December - 2023

DESIGN AND ANALYSIS OF ALGORITHMS (CSE)

Time: 3 hours

Max. Marks: 70

Answer ONE Question from each unit

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

All Questions Carry Equal Marks

--------------------------------------------------------------------------------------------------------------------------------------------------------

UNIT-I

  1. a) What is an Algorithm? Explain the characteristics of an algorithm.
    b) Explain Asymptotic notations with suitable examples.
    (7M)
    (7M)

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

    (OR)
  2. a) Explain about Divide and Conquer Paradigm.
    b) Write and explain Merge Sort algorithm with example.
    (7M)
    (7M)
  3. --- Content provided by‌ FirstRanker.com ---

UNIT-II

  1. a) Write and explain the algorithm for finding minimum and maximum element using divide and conquer.
    b) Write a short note on Strassen’s matrix multiplication.
    (7M)
    (7M)
    (OR)
  2. --- Content provided by⁠ FirstRanker.com ---

  3. Write and explain Quick Sort algorithm with example. Analyze its time complexity.
    (14M)

UNIT-III

  1. What is a Greedy method? Explain the Prim’s algorithm with example.
    (14M)
    (OR)
  2. --- Content provided by‍ FirstRanker.com ---

  3. What is Dynamic Programming? Explain the matrix chain multiplication with example.
    (14M)

UNIT-IV

  1. Explain the Dijkstra’s algorithm with example.
    (14M)
    (OR)
  2. --- Content provided by FirstRanker.com ---

  3. Write an algorithm for all pairs shortest path problem and explain with example.
    (14M)

UNIT-V

  1. Write short notes on the following:
    (i) Graph traversals
    (ii) Bi-connected components

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

    (7M)
    (7M)
    (OR)
  2. Explain the following:
    (i) NP-Hard

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

    (ii) NP-Complete problems
    (7M)
    (7M)

Get more at: FirstRanker.com


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


This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University