Scribd Logo
Upload

Welcome to Scribd!

  • DESIGN+AND+ANALYSIS+OF+ALGORITHMS Seme1 2006

    Uploaded by

    api-26171521
    25 views1 page
    The document is an exam for the MCSE Design and Analysis of Algorithms course. It contains 7 questions worth a total of 100 marks. The questions cover topics like finding the kth smallest element, randomized quicksort, the knapsack problem, job sequencing, dynamic programming, backtracking for the 8 Queens problem, least cost search for the 15 puzzle, and an algorithm for Huffman coding. Students must answer any 5 of the 7 questions.

    Original Description:

    Original Title

    DESIGN+AND+ANALYSIS+OF+ALGORITHMS_Seme1_2006

    Copyright

    © Attribution Non-Commercial (BY-NC)

    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 an exam for the MCSE Design and Analysis of Algorithms course. It contains 7 questions worth a total of 100 marks. The questions cover topics like finding the kth smallest element, randomized quicksort, the knapsack problem, job sequencing, dynamic programming, backtracking for the 8 Queens problem, least cost search for the 15 puzzle, and an algorithm for Huffman coding. Students must answer any 5 of the 7 questions.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    25 views1 page

    DESIGN+AND+ANALYSIS+OF+ALGORITHMS Seme1 2006

    Uploaded by

    api-26171521
    The document is an exam for the MCSE Design and Analysis of Algorithms course. It contains 7 questions worth a total of 100 marks. The questions cover topics like finding the kth smallest element, randomized quicksort, the knapsack problem, job sequencing, dynamic programming, backtracking for the 8 Queens problem, least cost search for the 15 puzzle, and an algorithm for Huffman coding. Students must answer any 5 of the 7 questions.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    MCSE/4257/35/2006

    M. C. S. E. Examination 2006
    (1st Semester)

    DESIGN AND ANALYSIS OF ALGORITHMS


    Time: Three hours Full Marks: 100

    Answer any five questions

    1. Write an algorithm to find the kth -smallest element out of n and argue for its
    efficiency.
    20
    2. Explain the randomized quicksort algorithm and discuss its efficiency.
    20

    3. a) Define the knapsack problem and solve it.


    b) Explain the job sequencing problem and devise an optimal solution.
    10+10

    4. What is the principle of optimality? Does it always hold? Formulate a k-stage graph
    problem as a dynamic programming problem and outline a solution.
    5+5+10
    5. Explain the 8-Queens problem and provide an efficient backtracking solution.
    20
    6. Use least cost search for the 15-puzzle problem and state the condition for the solution.
    20
    7. Write an algorithm for Huffman code and prove its correctness
    20

    You might also like