Scribd Logo
Upload

Welcome to Scribd!

  • Algo Final

    Uploaded by

    Syed Wyle Mustafa
    6 views1 page
    This document discusses complexity measures, algorithms, and computational complexity classes. It compares and contrasts divide and conquer and dynamic programming algorithms. It also defines spanning trees, minimum spanning trees (MST), and the complexity classes P and NP. Key points covered include: complexity measures time and space required by algorithms, divide and conquer combines subproblem solutions while dynamic programming stores overlapping subproblem results, and the classes P and NP distinguish between problems that can be solved and verified efficiently versus those that currently require exponential time to solve.

    Original Description:

    Original Title

    AlgoFinal

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses complexity measures, algorithms, and computational complexity classes. It compares and contrasts divide and conquer and dynamic programming algorithms. It also defines spanning trees, minimum spanning trees (MST), and the complexity classes P and NP. Key points covered include: complexity measures time and space required by algorithms, divide and conquer combines subproblem solutions while dynamic programming stores overlapping subproblem results, and the classes P and NP distinguish between problems that can be solved and verified efficiently versus those that currently require exponential time to solve.

    Copyright:

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

    Algo Final

    Uploaded by

    Syed Wyle Mustafa
    This document discusses complexity measures, algorithms, and computational complexity classes. It compares and contrasts divide and conquer and dynamic programming algorithms. It also defines spanning trees, minimum spanning trees (MST), and the complexity classes P and NP. Key points covered include: complexity measures time and space required by algorithms, divide and conquer combines subproblem solutions while dynamic programming stores overlapping subproblem results, and the classes P and NP distinguish between problems that can be solved and verified efficiently versus those that currently require exponential time to solve.

    Copyright:

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

    Complexity is a measure of the amount of time and/or space required by an algorithm

    for an input of a given size.


    Divide and Conquer (recursive) combines the solutions of sub-problems to obtain the
    solution of the main problem.
    Dynamic Programming (non-recursive) uses the result of the sub-problems to find
    optimal solution of the main problem.
    Sub Problems are independent in divide and conquer while interdependent in Dynamic
    Programming.

    In DP results of overlapping sub-problems are stored and not recomputed while in


    divide and conquer this is not the case.

    Spanning Tree
    =============
    1) Should contain all vertices.
    2) Should have |V|-1 edges.

    Number of possible STs = n^(n-2).

    We create MSTs to avoid problems like deadlock, or for finding the lowest cost.

    MST = 1) Prim's 2) Kruskal's

    Running time for both: |E|lg|V|

    NP
    ==
    P means problems that can be verified and solved in polynomial time.
    NP means problems that can only be verified in polynomial time but will take
    exponential time or more to solve.

    P = NP means that problems that can be verified

    You might also like