Anna University Syllabus - Anna University ME Syllabus
IL7012 DESIGN AND ANALYSIS OF ALGORITHMS Syllabus | Anna University ME Industrial Engineering Second Semester Syllabus Regulation 2013. Below is the Anna University 2013 Regulation Syllabus for 2nd Semester for ME Industrial engineering, Textbooks, Reference books, Exam portions, Question Bank, Previous year question papers, Model question papers, Class notes, Important 2 marks, 8 marks, 16 marks topics.
It is applicable for all students admitted in the Academic year 2013-2014 onwards for all its Affiliated institutions in Tamil Nadu.
Anna University Chennai Syllabus
IL7012 DESIGN AND ANALYSIS OF ALGORITHMS L T P C 3 0 0 3
UNIT I INTRODUCTION: 5
Algorithms, basic steps in development.
UNIT II REVIEW OF ANY ONE OF THE STRUCTURED LANGUAGES 10
ALGOL, PL/I, Ada, Pascal, XPL
UNIT III BASIC TOOLS: 5
Top down, Structured programming, networks, data structure.
UNIT IV METHODS OF DESIGN: 10
Sub goals, hill climbing and working backward, heuristics, back track programming, Branch and
bound recursion process, program testing, documentation, Meta heuristics.
UNIT V APPLICATION: 15
Development of sorting, searching, algorithms- combinatorial problems, shortest path, probabilistic
algorithms.
TOTAL: 45 PERIODS
REFERENCES
1. John R Hubbard, Fundamentals of Computing with C++, , Tata Mc Graw Hill,2000.
2. Goodman S.F. & Headtruemu, S.T.,Introduction to the design and analysis of algorithms,
Mcgraw Gill, 2000.
3. Elias Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran, Fundamentals of Computer
Algorithms, Galgotia Publications, 2003
4. Dromey, “How to solve in by computers, Prentice Hall, 1982.
5. Panneerselvam.R,Design and Analysis of Algorithms, Prentice Hall of India,2008.
IL7012 DESIGN AND ANALYSIS OF ALGORITHMS L T P C 3 0 0 3
UNIT I INTRODUCTION: 5
Algorithms, basic steps in development.
UNIT II REVIEW OF ANY ONE OF THE STRUCTURED LANGUAGES 10
ALGOL, PL/I, Ada, Pascal, XPL
UNIT III BASIC TOOLS: 5
Top down, Structured programming, networks, data structure.
UNIT IV METHODS OF DESIGN: 10
Sub goals, hill climbing and working backward, heuristics, back track programming, Branch and
bound recursion process, program testing, documentation, Meta heuristics.
UNIT V APPLICATION: 15
Development of sorting, searching, algorithms- combinatorial problems, shortest path, probabilistic
algorithms.
TOTAL: 45 PERIODS
REFERENCES
1. John R Hubbard, Fundamentals of Computing with C++, , Tata Mc Graw Hill,2000.
2. Goodman S.F. & Headtruemu, S.T.,Introduction to the design and analysis of algorithms,
Mcgraw Gill, 2000.
3. Elias Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran, Fundamentals of Computer
Algorithms, Galgotia Publications, 2003
4. Dromey, “How to solve in by computers, Prentice Hall, 1982.
5. Panneerselvam.R,Design and Analysis of Algorithms, Prentice Hall of India,2008.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...