Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Design and Analysis of Algorithm (Prorgam List)

    Uploaded by

    Ankur Gupta
    This document outlines programming assignments for a course on design and analysis of algorithms. It includes assignments to implement various sorting algorithms like quick sort, merge sort, and heap sort in C. It also includes assignments for problems like the knapsack problem, directed graphs, shortest paths, the 8 queens problem, binary search trees, minimal spanning trees, pattern matching, and operations on red-black trees.

    Copyright:

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

    You might also like

    Design and Analysis of Algorithm (Prorgam List)

    Uploaded by

    Ankur Gupta
    14 views1 page
    This document outlines programming assignments for a course on design and analysis of algorithms. It includes assignments to implement various sorting algorithms like quick sort, merge sort, and heap sort in C. It also includes assignments for problems like the knapsack problem, directed graphs, shortest paths, the 8 queens problem, binary search trees, minimal spanning trees, pattern matching, and operations on red-black trees.

    Original Description:

    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?

    Report this Document
    This document outlines programming assignments for a course on design and analysis of algorithms. It includes assignments to implement various sorting algorithms like quick sort, merge sort, and heap sort in C. It also includes assignments for problems like the knapsack problem, directed graphs, shortest paths, the 8 queens problem, binary search trees, minimal spanning trees, pattern matching, and operations on red-black trees.

    Copyright:

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

    Design and Analysis of Algorithm (Prorgam List)

    Uploaded by

    Ankur Gupta
    This document outlines programming assignments for a course on design and analysis of algorithms. It includes assignments to implement various sorting algorithms like quick sort, merge sort, and heap sort in C. It also includes assignments for problems like the knapsack problem, directed graphs, shortest paths, the 8 queens problem, binary search trees, minimal spanning trees, pattern matching, and operations on red-black trees.

    Copyright:

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

    DESIGN AND ANALYSIS OF ALGORITHM

    (DAA)CS-552
    (1)WAP in C to implement Quick Sort.
    (2)WAP in C to implement Merge Sort.
    (3)WAP in C to implement Heap Sort.
    (4)WAP in C to implement Knapsack Problem.
    (5)WAP in C to implement Directed Graph.
    (6)WAP in C to implement Shortest path by Dijkstra
    Algorithm.
    (7)WAP in C to implement 8-Queen problem.
    (8)WAP in C to implement Binary Search Tree.
    (9)WAP in C to implement minimal spanning Tree by
    (a) Kruskal’s Algorithm
    (b) Prim’s Algorithm
    (10)WAP in C to implementPattern Matching.
    (11)WAP in C to Rotate a Red Black Tree and insert a
    element in RED Black Tree.

    You might also like