Scribd Logo
Upload

Welcome to Scribd!

  • 33 views

    Algorithms Previous QP

    Uploaded by

    NazimAhmed
    This document provides the topics and questions for an Advanced Algorithms exam, including: 1) Recurrence relation solving methods and amortized analysis. 2) String matching automation construction and Chinese remainder theorem. 3) Finite groups, Abelian groups, and modular exponentiation. 4) Polynomial multiplication, prefix codes, and Huffman coding tree construction. 5) Directed acyclic graphs, shortest paths, and flow networks. 6) Polynomial time reduction and approximate vertex cover. 7) Carry lookahead addition and parallel algorithm constraints. 8) Short notes on Robin Karp algorithm, integer factorization, Bellman Ford algorithm, and sum of subsets problem

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Algorithms Previous QP

    Uploaded by

    NazimAhmed
    33 views1 page
    This document provides the topics and questions for an Advanced Algorithms exam, including: 1) Recurrence relation solving methods and amortized analysis. 2) String matching automation construction and Chinese remainder theorem. 3) Finite groups, Abelian groups, and modular exponentiation. 4) Polynomial multiplication, prefix codes, and Huffman coding tree construction. 5) Directed acyclic graphs, shortest paths, and flow networks. 6) Polynomial time reduction and approximate vertex cover. 7) Carry lookahead addition and parallel algorithm constraints. 8) Short notes on Robin Karp algorithm, integer factorization, Bellman Ford algorithm, and sum of subsets problem

    Original Description:

    Algorithms Previous QP jntu hyderabad

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides the topics and questions for an Advanced Algorithms exam, including: 1) Recurrence relation solving methods and amortized analysis. 2) String matching automation construction and Chinese remainder theorem. 3) Finite groups, Abelian groups, and modular exponentiation. 4) Polynomial multiplication, prefix codes, and Huffman coding tree construction. 5) Directed acyclic graphs, shortest paths, and flow networks. 6) Polynomial time reduction and approximate vertex cover. 7) Carry lookahead addition and parallel algorithm constraints. 8) Short notes on Robin Karp algorithm, integer factorization, Bellman Ford algorithm, and sum of subsets problem

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    33 views1 page

    Algorithms Previous QP

    Uploaded by

    NazimAhmed
    This document provides the topics and questions for an Advanced Algorithms exam, including: 1) Recurrence relation solving methods and amortized analysis. 2) String matching automation construction and Chinese remainder theorem. 3) Finite groups, Abelian groups, and modular exponentiation. 4) Polynomial multiplication, prefix codes, and Huffman coding tree construction. 5) Directed acyclic graphs, shortest paths, and flow networks. 6) Polynomial time reduction and approximate vertex cover. 7) Carry lookahead addition and parallel algorithm constraints. 8) Short notes on Robin Karp algorithm, integer factorization, Bellman Ford algorithm, and sum of subsets problem

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    USN

    IS835
    Eighth Semester B.E. Degree Examination, May / June 08
    Advanced Algorithms

    Time: 3 hrs. Max. Marks:100


    Note : Answer any FIVE full questions.
    1 a. Explain different methods of solving recurrence relation. ( 10 Marks)
    b. Discuss the aggregate analysis method for amortized analysis method. (10 Marks)
    2 a. Write the state transition diagram for string matching automation that accepts all strings
    ending in string ababaca. Write down the corresponding transition function and pattern
    P = ababaca and operation of automation on text T = abababacaba. ( 10 Marks)
    b. Write pseudo code for transition function. ( 05 Marks)
    c. Explain Chinese remainder theorem. ( 05 Marks)
    3 a. Define finite groups and Abelian group. Prove that the system (z,,, + n) is Abelian Group.
    Also show that (Z6, + 6) is Abelian Group. ( 12 Marks)
    b. Explain with pseudo code the concept of modular exponentiation. ( 08 Marks)
    4 a. Discuss efficient polynomial multiplication process by means of figure. ( 08 Marks)
    b. What is prefix code? Show that constructing optimal prefix code has optimal substructure
    property.
    ( 07 Marks)

    c. Construct Huffman code tree for the following . ( 05 Marks)


    A
    B A
    C
    DE
    0.4 0.2 0.15 0.15 0.10
    5 a. Explain Directed acyclic graph with example. Write the pseudo code to find the shortest
    path and solve the following problem. ( 10 Marks)

    b. Explain Flow networks. Given f flow in a flow network G with source s and sink t, and let
    (S,T) be a cut of G, then prove that net flow across (S,T) = ifI . (10 Marks)
    6 a. Discuss by means of diagrams the polynomial time reduction from one language to another
    through reduction function. ( 10 Marks)
    b. Explain Approximate Vertex Cover with neat diagrams. Explain its operation through
    pseudo
    code.
    ( 10 Marks)
    7 a. Describe the Carry Look ahead addition and prefix computation. ( 10 Marks)
    b. List and discuss at least four major constraints to be taken care of while designing a
    parallel algorithm. ( 10 Marks)
    8 Write short notes on:

    a. Robin Karp algorithm


    b. Integer factorization
    c. Bellman Ford Algorithm
    d. Sum of subset problem. ( 20 Marks)

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy