Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Lecture Plan: Text and Reference Books

    Uploaded by

    Rohan Agrawal
    The document outlines the lecture plan for an Advanced Data Structures and Algorithms course. It includes 11 topics that will be covered over 39 contact hours throughout the semester. Some of the key topics are algorithms for graphs, dynamic programming, matrices, computational geometry, advanced data structures like binomial and Fibonacci heaps, string matching algorithms, and approximation and randomized algorithms. There will be 4 quizzes throughout the semester and an end-term examination covering all topics.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Lecture Plan: Text and Reference Books

    Uploaded by

    Rohan Agrawal
    22 views1 page
    The document outlines the lecture plan for an Advanced Data Structures and Algorithms course. It includes 11 topics that will be covered over 39 contact hours throughout the semester. Some of the key topics are algorithms for graphs, dynamic programming, matrices, computational geometry, advanced data structures like binomial and Fibonacci heaps, string matching algorithms, and approximation and randomized algorithms. There will be 4 quizzes throughout the semester and an end-term examination covering all topics.

    Original Title

    Lecture_Plan_159876768719141035655f4b424782c79.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document outlines the lecture plan for an Advanced Data Structures and Algorithms course. It includes 11 topics that will be covered over 39 contact hours throughout the semester. Some of the key topics are algorithms for graphs, dynamic programming, matrices, computational geometry, advanced data structures like binomial and Fibonacci heaps, string matching algorithms, and approximation and randomized algorithms. There will be 4 quizzes throughout the semester and an end-term examination covering all topics.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    22 views1 page

    Lecture Plan: Text and Reference Books

    Uploaded by

    Rohan Agrawal
    The document outlines the lecture plan for an Advanced Data Structures and Algorithms course. It includes 11 topics that will be covered over 39 contact hours throughout the semester. Some of the key topics are algorithms for graphs, dynamic programming, matrices, computational geometry, advanced data structures like binomial and Fibonacci heaps, string matching algorithms, and approximation and randomized algorithms. There will be 4 quizzes throughout the semester and an end-term examination covering all topics.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Lecture Plan

    Course Name (Code) : Advanced Data Structures and Algorithms (CSC 501)
    Class : I Sem MTech (CSE), MTech (CSE-IS) & PhD (CSE)
    Contact Hours : 3–0–0
    Session : 2020−2021 (Monsoon Semester)
    Sl No. Topic No. of
    Hours
    1 Introduction: Notions of Algorithms, Algorithm Paradigms, Complexity Analysis, 3
    Asymptotic Notations, Mathematical Problems.
    2 Amortized Analysis: Aggregate Analysis, Accounting Method, Potential Method. 2
    3 Graph Algorithms: Topological Sorting, Strongly Connected Components, Single Source 5
    Shortest Paths in DAG, Johnson’s Algorithm.
    Q1 Quiz-I (Syllabus : Sl No. 1-3) 1
    4 Dynamic Programming: Matrix Chain Multiplication, Assembly Line Scheduling. 2
    5 Matrix Algorithms: Solving Systems of Linear equations, LU Decomposition, LUP 3
    Decomposition, Matrix Inversion.
    6 Computational Geometric Algorithms: Convex Hull Algorithms (Naïve Method, 4
    Incremental Method, Gift Wrapping Method), Line Segments Intersection Problem.
    Q2 Quiz-II (Syllabus : Sl No. 4-6) 1
    7 Advanced Data Structures: Binomial Heap, Fibonacci Heap, kd-Tree. 6
    Q3 Quiz-III (Syllabus : Sl No. 7) 1
    8 Polynomials and FFT: Representation, DFT, FFT (Recursive and Iterative). 3
    9 String Matching Algorithms: Naïve Approach, Rabin-Karp Algorithm, Finite Automata 3
    Approach, Knuth-Morris-Pratt Algorithm.
    10 Approximation Algorithms: Vertex Cover Problem, Travelling Salesman Problem, Set 2
    Covering Problem.
    11 Randomized Algorithms: Randomized Quicksort, Parallel Algorithms. 2
    Q4 Quiz-IV (Syllabus : Sl No. 8-11) 1
    End Semester Examination (Syllabus : Sl No. 1- 11)
    Total 39

    Text and Reference Books:


    1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, “Introduction to Algorithms”, Prentice Hall of India.
    2. E. Horowitz, S. Sahni, and S. Rajasekaran, “Fundamentals of Computer Algorithms”, Universities Press.
    3. M. T. Goodrich and R. Tamassia, “Algorithm Design”, Wiley Student Edition.
    4. Mark de Berg et al., Computational Geometry: Algorithms and Application, Springer.

    Soumen Bag
    Assistant Prof./CSE

    You might also like