Scribd Logo
Upload

Welcome to Scribd!

  • Get Syllabus PDF

    Uploaded by

    Sujit Kathade
    11 views1 page
    This document provides a syllabus for a course on data structures and algorithms. It lists prerequisites including programming languages, stacks, queues, linked lists, trees, and basic sorting algorithms. The syllabus then covers various data structures like heaps, trees, and graphs. It also covers algorithms like greedy algorithms, divide and conquer techniques, dynamic programming, and graph algorithms. Finally, it mentions NP-completeness and concepts like complexity, asymptotic notations, and algorithm analysis.

    Original Description:

    Original Title

    get_syllabus_pdf

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides a syllabus for a course on data structures and algorithms. It lists prerequisites including programming languages, stacks, queues, linked lists, trees, and basic sorting algorithms. The syllabus then covers various data structures like heaps, trees, and graphs. It also covers algorithms like greedy algorithms, divide and conquer techniques, dynamic programming, and graph algorithms. Finally, it mentions NP-completeness and concepts like complexity, asymptotic notations, and algorithm analysis.

    Copyright:

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

    Get Syllabus PDF

    Uploaded by

    Sujit Kathade
    This document provides a syllabus for a course on data structures and algorithms. It lists prerequisites including programming languages, stacks, queues, linked lists, trees, and basic sorting algorithms. The syllabus then covers various data structures like heaps, trees, and graphs. It also covers algorithms like greedy algorithms, divide and conquer techniques, dynamic programming, and graph algorithms. Finally, it mentions NP-completeness and concepts like complexity, asymptotic notations, and algorithm analysis.

    Copyright:

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

    SUBJECT NO-MA60002, SUBJECT NAME- DATA STRUCTURE AND ALGORITHM

    LTP- 3-1-0,CRD- 4
    SYLLABUS :-
    Prerequisite: Programming LanguagesStack and queues, Linked list, Direct
    address tables, Indexing, hash tables, open addressing, trees, Binary search
    tree, height balanced tree, Red-black tree, B-tree. Basic concepts of
    algorithms, Complexity, Asymptotic notations, Trees: Binary tree, Binary Search
    Tree, Tree traversals. Heap as data structure. Basic sorting algorithms:
    selection sort, insertion sort. Greedy algorithms: Coin change problem,
    activity selection, Minimum Spanning Tree, Single source shortest path,
    knapsack problem. Divide â and â Conquer technique: Merge sort, quick sort.
    Solving Recurrence relations. Dynamic programming: matrix chain multiplication,
    all pair shortest path algorithm. Graph algorithms: Warshall s algorithm, Depth
    First Search, Breadth First Search. Branch and Bound technique, Backtracking.
    NP completeness.

    You might also like