Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    What Is Meant by Adjacency Matrix?

    Uploaded by

    Sathish Kumar
    The document discusses several algorithms and data structures: - A spanning tree is a subgraph that connects all vertices of a graph without cycles. Prim's and Kruskal's algorithms can be used to find a minimum spanning tree of a weighted undirected graph. - Dynamic programming breaks problems down into smaller subproblems and stores the results to avoid recomputing them. - An adjacency matrix represents a graph as a 2D array where each row and column represents a vertex and cells indicate connections between vertices. - Quicksort uses divide and conquer to sort a list by picking a pivot element and partitioning the list into sublists based on element values relative to the pivot. Merge sort also uses divide and conquer

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd

    What Is Meant by Adjacency Matrix?

    Uploaded by

    Sathish Kumar
    20 views1 page
    The document discusses several algorithms and data structures: - A spanning tree is a subgraph that connects all vertices of a graph without cycles. Prim's and Kruskal's algorithms can be used to find a minimum spanning tree of a weighted undirected graph. - Dynamic programming breaks problems down into smaller subproblems and stores the results to avoid recomputing them. - An adjacency matrix represents a graph as a 2D array where each row and column represents a vertex and cells indicate connections between vertices. - Quicksort uses divide and conquer to sort a list by picking a pivot element and partitioning the list into sublists based on element values relative to the pivot. Merge sort also uses divide and conquer

    Original Description:

    woow

    Original Title

    rough.docx

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses several algorithms and data structures: - A spanning tree is a subgraph that connects all vertices of a graph without cycles. Prim's and Kruskal's algorithms can be used to find a minimum spanning tree of a weighted undirected graph. - Dynamic programming breaks problems down into smaller subproblems and stores the results to avoid recomputing them. - An adjacency matrix represents a graph as a 2D array where each row and column represents a vertex and cells indicate connections between vertices. - Quicksort uses divide and conquer to sort a list by picking a pivot element and partitioning the list into sublists based on element values relative to the pivot. Merge sort also uses divide and conquer

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    20 views1 page

    What Is Meant by Adjacency Matrix?

    Uploaded by

    Sathish Kumar
    The document discusses several algorithms and data structures: - A spanning tree is a subgraph that connects all vertices of a graph without cycles. Prim's and Kruskal's algorithms can be used to find a minimum spanning tree of a weighted undirected graph. - Dynamic programming breaks problems down into smaller subproblems and stores the results to avoid recomputing them. - An adjacency matrix represents a graph as a 2D array where each row and column represents a vertex and cells indicate connections between vertices. - Quicksort uses divide and conquer to sort a list by picking a pivot element and partitioning the list into sublists based on element values relative to the pivot. Merge sort also uses divide and conquer

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 1

    What is a spanning tree? Define dynamic programming.

    What is meant by adjacency matrix?

    Explain the algorithm of Quicksort by sorting the following set of numbers as an example: 42 47 52 57 62 37 32 27 22 Or (b) Describe divide and conquer technique with the help of mergesort. (16)

    Discuss Prims and Kruskals algorithm for computing the minimal spanning tree weighted undirected graph. (16) 15. (a) (i) Write a C program to implement binary search and compute its complexity. (8) (ii) Compare the worst case and best case time complexity of various sorting techniques. (8) Or (b) Explain the all pairs shortest path algorithm with an example. (16) Describe the shortest path identification using dijkstra's algorithm.

    Describe the concept of Bubble sort & Merge Sort with example.

    You might also like