Page 48 - B.Tech IT Curriculum and Syllabus R2017 - REC
P. 48

Department of IT, REC


               String  Matching:  Naive  String  Matching  -  Rabin  Karp  -  Knuth  Morris  Pratt    -  NP  Hard  and  NP
               Complete  Problems:  Basic  Concepts  -  Non  Deterministic  Algorithms  -  Class  of  NP  Hard  and  NP
               Complete - Approximation for NP Hard Problems: Travelling Salesman problem.

                                                                                    TOTAL: 45 PERIODS

               OUTCOMES:
               At the end of the course, the student should be able to:
                   1.  Prove the correctness and analyze the running time of   the basic algorithms for those classic
                       problems in various domains.
                   2.  Analyze the time and space complexity of  various algorithms.
                   3.  Ability to compare algorithms with respect to complexities.
                   4.  Apply design strategies and Synthesize algorithms for various computing problems.
                   5.  Modify existing algorithms to improve efficiency.

               TEXT BOOKS:
                   1.  Ellis Horowitz, Shani, SanguthevarRajasekaran, "Computer Algorithms / C++" Universities
                       Press, Second Edition 2008.
                   2.  AnanyLevitin,  ―Introduction  to  the  Design  and  Analysis  of  Algorithms‖,  Third  Edition,
                       Pearson Education, 2012.

               REFERENCES:
                   1.  Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, ―Introduction
                       to Algorithms‖, Third Edition, PHI Learning Private Limited, 2012.
                   2.  Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, ―Data Structures and Algorithms‖,
                       Pearson Education, Reprint 2006.
                   3.  Donald E. Knuth, ―The Art of Computer Programming‖, Volumes 1& 3 Pearson Education,
                       2009.
                   4.  Sara  Baase  Allen  Van  Gelder,  "Computer  Algorithms  -  Introduction  to  Analysis"  Pearson
                       Education Asia, 2010
                   5.  Michael  T.  Goodrich  ,  Roberto  Tamassia ,  Michael  H.  Goldwasser,  ―Data  Structures  and
                       Algorithms in Python‖,  John Wiley & Sons,2013.

               CY17251 ENVIRONMENTAL SCIENCE AND ENGINEERING                  L T P  C
                                                                                                3  0  0   3
               OBJECTIVES:

                     To  find  the  scientific,  technological,  economic  and  political  solutions  to  environmental
                       problems.
                     To study the interrelationship between living organism and environment.
                     To study the importance of environment by assessing its impact on the human world.
                     To  study  the  dynamic  processes  and  understand  the  features  of  the  earth‘s  interior  and
                       surface.
                     To  study  the  integrated  themes  and  biodiversity,  natural  resources,  pollution  control  and
                       waste management.



               UNIT I     ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY                                      12

               Definition, scope and importance of Risk and hazards; Chemical hazards, Physical hazards, Biological
               hazards  in  the  environment  –  concept  of  an  ecosystem  –  ecological  succession  processes  –
               Introduction, types, characteristic features, structure and function of the forest ecosystem - grassland

               Curriculum and Syllabus | B.Tech. Information Technology | R2017                Page 48
   43   44   45   46   47   48   49   50   51   52   53