Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • BCS401

    Uploaded by

    pramodpramodcdhotarad
    38 views2 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    38 views2 pages

    BCS401

    Uploaded by

    pramodpramodcdhotarad

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    BCS401

    Model Question Paper with effect from 2023-24 (CBCS Scheme)

    USN

    Fourth Semester B.E. Degree Examination


    Analysis and Designs of Algorithms

    TIME: 03 Hours Max. Marks: 100

    Note: 01. Answer any FIVE full questions, choosing at least ONE question from each MODULE.

    Module -1 BL Marks
    Q.01 a Define algorithm. Explain asymptotic notations Big Oh, Big Omega and Big Theta L2 08
    notations
    b Explain the general plan for analyzing the efficiency of a recursive algorithm. Suggest L2 08
    a recursive algorithm to find factorial of number. Derive its efficiency
    c If t1(n) ∈ O(g1(n)) and t2(n) ∈ O(g2(n)), then show that t1(n) + t2(n) ∈ O(max{g1(n), L2 04
    g2(n)}).
    OR
    Q.02 a With neat diagram explain different steps in designing and analyzing an algorithm L2 08
    b Explain the general plan for analyzing the efficiency of a non-recursive algorithm. L2 08
    Suggest a non-recursive algorithm to find maximum element in the list of n numbers.
    Derive its efficiency
    c With the algorithm derive the worst case efficiency for Bubble sort L2 04
    Module-2
    Q. 03 a Explain the concept of divide and conquer. Design an algorithm for merge sort and L2 10
    derive its time complexity
    b Design an insertion sort algorithm and obtain its time complexity. Apply insertion sort L3 10
    on these elements. 25,75,40,10,20,
    OR
    Q.04 a Explain Strassen’s matrix multiplication and derive its time complexity L2 10
    b Design an algorithm for quick sort algorithm. Apply quick sort on these elements. L3 10
    25,75,40,10,20,05,15
    Module-3
    Q. 05 a Define AVL Trees. Explain its four rotation types L2 10
    b Construct bottom up heap for the list 2,9,7,6,5,8. Obtain its time complexity L3 10
    OR
    Q. 06 a Define heap. Explain the properties of heap along with its representation. L2 10
    b Design Horspools algorithm for string matching. Apply Horspools algorithm to find L3 10
    the pattern BARBER in the text: JIM_SAW_ME_IN_A_BARBERSHOP
    Module-4
    Q. 07 a Construct minimum cost spanning tree using Kruskals algorithm for the following L3 10
    graph.

    b What are Huffman Trees? Construct the Huffman tree for the following data. L3 10
    Character A B C D E -
    Probability 0.5 0.35 0.5 0.1 0.4 0.2
    Encode DAD-CBE using Huffman Encoding.

    Page 01 of 02
    BCS401
    OR
    Q. 08 a Apply Dijkstra’s algorithm to find single source shortest path for the given graph by L3 10
    considering S as the source vertex.

    b Define transitive closure of a graph. Apply Warshalls algorithm to compute transitive L3 10


    closure of a directed graph

    Module-5
    Q. 09 a Explain the following with examples L2 10
    i) P problem
    ii) NP Problem
    iii) NP- Complete problem
    iv) NP – Hard Problems
    b What is backtracking? Apply backtracking to solve the below instance of sum of subset L3 10
    problem S={5,10,12,13,15,18} d=30
    OR
    Q. 10 a Illustrate N queen’s problem using backtracking to solve 4-Queens problem L2 10
    b Using Branch and Bound technique solve the below instance of knapsack problem. L3 10
    Item Weight Value
    1 2 12
    2 1 10
    3 3 20
    4 2 5

    Capacity 5

    Page 02 of 02

    You might also like