Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    Madanapalle Institute of Technology & Science Department of Computer Science & Engineering

    Uploaded by

    Y CHINMAY SAI
    The document contains a list of important questions for the Design and Analysis of Algorithms course. It includes questions about greedy techniques, the components of greedy methods, differences between 0/1 and fractional knapsack problems, dynamic programming, algorithms like 0/1 and fractional knapsack, Huffman coding, the travelling salesman problem, job sequencing with deadlines, single source shortest paths, minimum spanning trees, Prim's algorithm, Fibonacci sequences, and the longest common subsequence problem.

    Copyright:

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

    You might also like

    Madanapalle Institute of Technology & Science Department of Computer Science & Engineering

    Uploaded by

    Y CHINMAY SAI
    11 views1 page
    The document contains a list of important questions for the Design and Analysis of Algorithms course. It includes questions about greedy techniques, the components of greedy methods, differences between 0/1 and fractional knapsack problems, dynamic programming, algorithms like 0/1 and fractional knapsack, Huffman coding, the travelling salesman problem, job sequencing with deadlines, single source shortest paths, minimum spanning trees, Prim's algorithm, Fibonacci sequences, and the longest common subsequence problem.

    Original Description:

    important questions

    Original Title

    questions

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains a list of important questions for the Design and Analysis of Algorithms course. It includes questions about greedy techniques, the components of greedy methods, differences between 0/1 and fractional knapsack problems, dynamic programming, algorithms like 0/1 and fractional knapsack, Huffman coding, the travelling salesman problem, job sequencing with deadlines, single source shortest paths, minimum spanning trees, Prim's algorithm, Fibonacci sequences, and the longest common subsequence problem.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    11 views1 page

    Madanapalle Institute of Technology & Science Department of Computer Science & Engineering

    Uploaded by

    Y CHINMAY SAI
    The document contains a list of important questions for the Design and Analysis of Algorithms course. It includes questions about greedy techniques, the components of greedy methods, differences between 0/1 and fractional knapsack problems, dynamic programming, algorithms like 0/1 and fractional knapsack, Huffman coding, the travelling salesman problem, job sequencing with deadlines, single source shortest paths, minimum spanning trees, Prim's algorithm, Fibonacci sequences, and the longest common subsequence problem.

    Copyright:

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

    MADANAPALLE INSTITUTE OF TECHNOLOGY & SCIENCE

    Department of Computer Science & Engineering


    Class: II B.Tech II Sem Course: 14CSU109 - Design and Analysis of Algorithms

    Important Questions
    Unit II

    1. Define greedy technique.


    2. What are five components of greedy method?
    3. Differentiate the 0/1 and fractional knapsack problem.
    4. What is dynamic programming?

    1. Explain about 0/1 and fractional knapsack algorithm in detail.


    2. Discuss the Huffman code compression method.

    3. Describe travelling salesman problem using dynamic programming.

    4. Write about jog sequencing with deadlines using greedy method.

    5. Define single source shortest path. Explain with example (Dijkstra).

    6. Define MST. Explain kruskal algorithm using greedy method.

    7. Discuss about prim’s algorithm using greedy method.

    8. Explain about Fibonacci using dynamic programming (D.P). 5 marks

    9. Write pseudo code for LCS.

    You might also like