Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    DAA Syllabus

    Uploaded by

    bhaimodel20
    The document outlines the course 'Design and Analysis of Algorithms' for B.Tech CSE students, detailing prerequisites, objectives, and outcomes. It covers various algorithmic strategies such as divide and conquer, greedy methods, dynamic programming, backtracking, and branch and bound, along with NP-Hard and NP-Complete problems. The document also lists recommended textbooks and reference materials for further study.

    Copyright:

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

    DAA Syllabus

    Uploaded by

    bhaimodel20
    2 views2 pages
    The document outlines the course 'Design and Analysis of Algorithms' for B.Tech CSE students, detailing prerequisites, objectives, and outcomes. It covers various algorithmic strategies such as divide and conquer, greedy methods, dynamic programming, backtracking, and branch and bound, along with NP-Hard and NP-Complete problems. The document also lists recommended textbooks and reference materials for further study.

    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 course 'Design and Analysis of Algorithms' for B.Tech CSE students, detailing prerequisites, objectives, and outcomes. It covers various algorithmic strategies such as divide and conquer, greedy methods, dynamic programming, backtracking, and branch and bound, along with NP-Hard and NP-Complete problems. The document also lists recommended textbooks and reference materials for further study.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2 views2 pages

    DAA Syllabus

    Uploaded by

    bhaimodel20
    The document outlines the course 'Design and Analysis of Algorithms' for B.Tech CSE students, detailing prerequisites, objectives, and outcomes. It covers various algorithmic strategies such as divide and conquer, greedy methods, dynamic programming, backtracking, and branch and bound, along with NP-Hard and NP-Complete problems. The document also lists recommended textbooks and reference materials for further study.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    B.

    Tech CSE AR22

    GEETHANJALI COLLEGE OF ENGINEERING AND TECHNOLOGY


    (UGC Autonomous)
    Cheeryal (V), Keesara (M), Medchal Dist., Telangana-501301

    20CS22001-DESIGN AND ANALYSIS OF ALGORITHMS


    B.Tech. CSE - II Year, II Sem.
    L T P/D C
    Prerequisite(s): 3 - -/- 3
     20CS12002-DISCRETE MATHEMATICS
     20CS21001-DATA STRUCTURES

    Course Objectives
    Develop ability to
    1. Learn the asymptotic notations and understand the performance of algorithms.
    2. Learn the behavior of Greedy strategy, Divide and Conquer approach, Dynamic
    3. Programming and branch and bound theory and apply them for several problem
    solving techniques.
    4. Explore various data structures and algorithm design methods together impacts the
    performance of programs.
    5. Distinguish between deterministic and non-deterministic algorithms and their
    computational efficiency.

    Course Outcomes (COs)


    After completion of the course, student would be able to
    CO1. Analyze time and space complexity of a given algorithm and use asymptotic
    notation to represent the complexities.
    CO2. Apply divide and conquer, greedy, dynamic programming, backtracking and
    branch and bound algorithmic approaches to a given problem.
    CO3. Prove that a given problem is NP-Complete by using the concepts of NP-
    Completeness.

    UNIT-I
    INTRODUCTION: Algorithm, Pseudo code for expressing algorithms, Performance
    analysis, Time complexity and space complexity, Asymptotic Notations: O notation, Omega
    notation, theta notation, and little o notation.
    DIVIDE AND CONQUER: General method, applications – binary search, merge sort, quick
    sort, Strassen‟s matrix multiplication.

    UNIT-II
    SEARCHING AND TRAVERSAL TECHNIQUES : Efficient non-recursive binary tree
    traversal algorithms, spanning trees, graph traversals- BFS and DFS, Connected components,
    bi-Connected components.
    Disjoint sets: operations, union and find algorithms.

    UNIT-III
    GREEDY-METHOD: General method, Applications-Job sequencing with deadlines, 0/1
    knapsack problem, minimum cost spanning tree, single source shortest path problem.
    DYNAMIC PROGRAMMING: General method, applications-multistage graphs, matrix
    chain multiplication, optimal binary search trees, 0 /1 knapsack problem, travelling sales
    person problem, reliability design problem.

    Department of Computer Science and Engineering 97


    B.Tech CSE AR22

    UNIT-IV
    BACK TRACKING: General method, applications: n-queens problem, sum of sub set
    problem, graph colouring problem, Hamiltonian cycles.
    BRANCH and BOUND: General method, applications: Job Sequencing with deadlines,
    travelling sales person problem, 0 /1 knapsack problem, LC branch and bound, FIFO branch
    and bound solution.

    UNIT-V
    NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP-
    hard and NP- complete classes, NP- Hard problems, Cook‟s theorem.

    TEXT BOOK(S)
    1. Fundamentals of Computer Algorithms Ellis Horowitz, Satraj Sahni and Sanguthevar
    Rajasekharan, 2 nd Edition, Universities Press, 2009 Reprint.
    2. Introduction to Algorithms, secondediton, T.H.Cormen, C.E.Leiserson, R.L.Rivest,
    and C.Stein, PHI Pvt.Ltd/Person Education.

    REFERENCE BOOK(S)
    1. Design and Analysis of Algorithms, Aho, Ullman and Hopcroft, Pearson education,
    Reprint 2004.
    2. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee,
    S.S.Tseng, R.C.Chang and T.Tsai, Mc.Graw Hill
    3. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Perason
    education
    4. Algorithms-Richard Johnson baugh and Marcus Schaefer, Pearson Education
    5. Design and Analysis Algorithms-Parag Himanshu Dave, Himanshu Bhalachndra
    Dave Publisher: Person
    6. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and
    R.Tomassia, John wiley and sons.

    Department of Computer Science and Engineering 98

    You might also like