Scribd Logo
Upload

Welcome to Scribd!

  • Be - Computer Engineering - Semester 6 - 2020 - March - Design and Analysis of Algorithms Daa Pattern 2015

    Uploaded by

    Garja
    3 views1 page
    The document is a 6 question exam on algorithms with the following key points: 1) The first question asks about improving algorithm efficiency and the need for correctness with loop invariants. 2) The second question defines algorithms and discusses iterative design issues. 3) The third question involves a linear time fractional knapsack algorithm and importance of tail recursion. 4) The fourth question explains imperative models and obtaining Huffman codes from frequencies. 5) The fifth question discusses evolutionary computing, genetic algorithms, and divide and conquer multiplication. 6) The sixth question finds the longest common subsequence using dynamic programming and explains branch and bound.

    Original Description:

    Original Title

    be_computer-engineering_semester-6_2020_march_design-and-analysis-of-algorithms-daa-pattern-2015

    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
    The document is a 6 question exam on algorithms with the following key points: 1) The first question asks about improving algorithm efficiency and the need for correctness with loop invariants. 2) The second question defines algorithms and discusses iterative design issues. 3) The third question involves a linear time fractional knapsack algorithm and importance of tail recursion. 4) The fourth question explains imperative models and obtaining Huffman codes from frequencies. 5) The fifth question discusses evolutionary computing, genetic algorithms, and divide and conquer multiplication. 6) The sixth question finds the longest common subsequence using dynamic programming and explains branch and bound.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Be - Computer Engineering - Semester 6 - 2020 - March - Design and Analysis of Algorithms Daa Pattern 2015

    Uploaded by

    Garja
    The document is a 6 question exam on algorithms with the following key points: 1) The first question asks about improving algorithm efficiency and the need for correctness with loop invariants. 2) The second question defines algorithms and discusses iterative design issues. 3) The third question involves a linear time fractional knapsack algorithm and importance of tail recursion. 4) The fourth question explains imperative models and obtaining Huffman codes from frequencies. 5) The fifth question discusses evolutionary computing, genetic algorithms, and divide and conquer multiplication. 6) The sixth question finds the longest common subsequence using dynamic programming and explains branch and bound.

    Copyright:

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

    Total No. of Questions : 6] SEAT No.

    8
    23
    P44 [Total No. of Pages : 1

    ic-
    tat
    TE/INSEM/APR-49

    4s
    T.E. (Computer)

    0:4
    310250 : DESIGN & ANALYSIS OF ALGORITHMS

    02 91
    0:4
    (2015 Pattern) (Semester - II)

    0
    01
    2/0 13
    0
    Time : 1 Hour] 3/2 [Max. Marks : 30
    .23 GP

    Instructions to the candidates:


    1) Figures to the right indicate full marks.
    E
    80

    8
    2) Assume suitable data, if necessary.
    C

    23
    ic-
    Q1) a) Explain means of improving efficiency of Algorithm. [5]
    16

    tat
    b) What is need of correctness of algorithm? What is loop invariant property?
    8.2

    4s
    [5]
    .24

    0:4
    91
    OR
    49

    0:4
    Q2) a) What are Algorithms? Explain algorithm as technology with example. [5]
    30
    01

    b) Discuss issues related to iterative algorithm design. [5]


    01
    02
    3/2
    GP

    Q3) a) Give a linear time algorithm for fractional knapsack problem. Analyze
    2/0

    the same. [5]


    CE
    80

    8
    b) Explain the importance of Tail recursion with a suitable example? [5]

    23
    .23

    ic-
    OR
    16

    tat
    Q4) a) Explain imperative model in detail. [5]
    8.2

    4s

    b) Obtain set of optimal Huffman codes for set of characters S= (a, b, c, d, e, f)


    .24

    0:4

    with following frequency of occurrences P = (5, 25, 7, 15, 4, 12). Draw


    91
    49

    0:4

    the decode tree for this set of codes. [5]


    30
    01
    01

    Q5) a) Write a short note on Evolutionary Computing and Genetic Algorithm.[5]


    02
    3/2

    b) Solve multiplication using Divide and Conquer strategy 1234*2139. [5]


    GP
    2/0

    OR
    CE

    Q6) a) What is LCS for following using Dynamic Programming, [5]


    80

    String 1 = "ABCDGH" and String 2 - "AEDFHR".


    .23

    b) Explain branch-n-bound approach. [5]


    16
    8.2
    .24
    49

    You might also like