IM3009 COMPUTATIONAL METHODS & ALGORITHMS SYLLABUS | ANNA UNIVERSITY BE INDUSTRIAL ENGINEERING AND MANAGEMENT 8TH SEMESTER SYLLABUS REGULATION 2008 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY 8TH SEMESTER B.E INDUSTRIAL ENGINEERING AND MANAGEMENT DEPARTMENT SYLLABUS, 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 YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI, TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
IM3009 COMPUTATIONAL METHODS & ALGORITHMS L T P C
3 0 0 3
OBJECTIVE
A brief introduction to algorithmic design tools with some applications
UNIT I INTRODUCTION 5
Review of C/C++ - writing and debugging large programs-controlling numerical errors
UNIT II ALGORITHM DESIGN METHODS 12
Greedy – divide and conquer – backtracking – branch & bound – heuristics- Meta
heuristics
UNIT III BASIC TOOLS 12
Structured approach – networks – trees – data structures
UNIT IV COMPUTATIONAL PERFORMANCE 6
Time complexity – space complexity – algorithm complexity
UNIT V APPLICATIONS 10
Sorting – searching - net works – scheduling – optimisation models – IE applications
TOTAL : 45 PERIODS
REFERENCES:
1. Goodman S F & Headtruemu ST , Introduction to design of algorithms, McGra w
Hill,2002
2. Sahni, Data Structures, algorithms and applications in C++, McGraw Hill, 2003
3. Dromey,R.G.,How to solve it with computers?,PHI,2002
4. Alfred V. Aho , Jeffrey D. Ullman and John E. Hopcroft,Data Structures and
Algorithms,Addison-Wesley ,1993.
IM3009 COMPUTATIONAL METHODS & ALGORITHMS L T P C
3 0 0 3
OBJECTIVE
A brief introduction to algorithmic design tools with some applications
UNIT I INTRODUCTION 5
Review of C/C++ - writing and debugging large programs-controlling numerical errors
UNIT II ALGORITHM DESIGN METHODS 12
Greedy – divide and conquer – backtracking – branch & bound – heuristics- Meta
heuristics
UNIT III BASIC TOOLS 12
Structured approach – networks – trees – data structures
UNIT IV COMPUTATIONAL PERFORMANCE 6
Time complexity – space complexity – algorithm complexity
UNIT V APPLICATIONS 10
Sorting – searching - net works – scheduling – optimisation models – IE applications
TOTAL : 45 PERIODS
REFERENCES:
1. Goodman S F & Headtruemu ST , Introduction to design of algorithms, McGra w
Hill,2002
2. Sahni, Data Structures, algorithms and applications in C++, McGraw Hill, 2003
3. Dromey,R.G.,How to solve it with computers?,PHI,2002
4. Alfred V. Aho , Jeffrey D. Ullman and John E. Hopcroft,Data Structures and
Algorithms,Addison-Wesley ,1993.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...