Scribd Logo
Upload

Welcome to Scribd!

  • DSA 2013 Syllabus

    Uploaded by

    jgyg
    5 views1 page
    This syllabus covers the key topics in data structures and algorithms including data structures like arrays, stacks, queues, lists, trees, and graphs. It outlines algorithms for searching like binary search, and sorting like selection sort, insertion sort, mergesort and quicksort. Additional algorithms covered include hashing, string matching, minimum spanning trees, shortest paths, and graph traversals. It lists required textbooks and references, as well as programming tools and languages used which are the C programming language, Linux operating system, and visualization tools like graphviz and gnuplot. Labs are included to reinforce topics like linked lists, queues, binary search trees, and graph algorithms.

    Original Description:

    Original Title

    DSA-2013-Syllabus

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This syllabus covers the key topics in data structures and algorithms including data structures like arrays, stacks, queues, lists, trees, and graphs. It outlines algorithms for searching like binary search, and sorting like selection sort, insertion sort, mergesort and quicksort. Additional algorithms covered include hashing, string matching, minimum spanning trees, shortest paths, and graph traversals. It lists required textbooks and references, as well as programming tools and languages used which are the C programming language, Linux operating system, and visualization tools like graphviz and gnuplot. Labs are included to reinforce topics like linked lists, queues, binary search trees, and graph algorithms.

    Copyright:

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

    DSA 2013 Syllabus

    Uploaded by

    jgyg
    This syllabus covers the key topics in data structures and algorithms including data structures like arrays, stacks, queues, lists, trees, and graphs. It outlines algorithms for searching like binary search, and sorting like selection sort, insertion sort, mergesort and quicksort. Additional algorithms covered include hashing, string matching, minimum spanning trees, shortest paths, and graph traversals. It lists required textbooks and references, as well as programming tools and languages used which are the C programming language, Linux operating system, and visualization tools like graphviz and gnuplot. Labs are included to reinforce topics like linked lists, queues, binary search trees, and graph algorithms.

    Copyright:

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

    Syllabus for Data Structures and Algorithms (DSA)

    Algorithm Hashing
    Data Structure def, classification, ADT Hashing by chaining (Lab 12)
    Algorithm representation and Perfect hashing function
    complexity
    Pointers, strings, arrays (1-D and n-D) String algorithms
    Elapsed time Simple string manipulations
    malloc, realloc, calloc Pattern search with Rabin-Karp
    approach
    Stacks
    Stacks (Lab 1) Tools
    Pre-, in-, post-fix conversions Operating system: GNU/Linux
    Evaluations of expressions Langauges: ANSI C (C89)
    Graph visualization tool: graphviz
    Lists and Queues Data and function plotter: gnuplot
    Linked lists (Lab 2)
    Queues (Lab 3) Books
    Circular queues 1. Introduction to Algorithms by
    Thomas H. Cormen, Charles E.
    Recursion Leiserson, Ronald L. Rivest, Clifford
    Stein (2Ed) (Text)
    Simple recursion
    Fibonacci numbers 2. Data Structures Using C and C++ by
    Backtracking: 8-queen problem Yedidyah Langsam, Moshe J.
    Augenstein and Aaron M. Tenenbaum
    Searching and Sorting (Text)
    Binary search (Lab 4)
    Selection sort 3. The C Programming Language (2nd
    Insertion sort Edition) by Brian W. Kernighan and
    Mergesort Dennis Ritchie (Ref)
    Quicksort (Lab 5)
    4. Expert C Programming by Peter van
    Quickselect
    der Linden (Ref)
    Graph Theory 5. C Traps and Pitfalls by Andrew
    Graphs Koenig (Ref)
    Simple trees
    Heaps, heapsort (Lab 6)
    Priority queues
    Binary trees, n-ary trees
    Binary search trees (Lab 7)
    Traversals
    Trie tree (Lab 8)
    Kruskal’s MST using disjoint sets
    Dijkstra's Algorithm
    Disjoint sets (Lab 9)
    Floyd-Warshall's algorithm (Lab 10)
    BFS and DFS searches (Lab 11)
    AVL trees, B-trees
    Threaded trees

    You might also like