IL4006 Design and Analysis of Algorithms Syllabus:

IL4006 Design and Analysis of Algorithms Syllabus – Anna University PG Syllabus Regulation 2021

OBJECTIVES:

 Understand the basic steps in development of an algorithm
 Learn and apply various syntax used in C++ programming language.
 Develop knowledge about Structured programming and data structure.
 Comprehend and apply methods of designs to algorithms.
 Acquire knowledge in various algorithms.

UNIT I INTRODUCTION

Algorithms, basic steps in development.

UNIT II REVIEW OF THE STRUCTURED LANGUAGES

C++ Basics, Expression, operators, control statements, structures, multi-dimensional array, functions, arguments, overload function.

UNIT III BASIC TOOLS

Top down, Structured programming, networks, data structure.

UNIT IV METHODS OF DESIGN

Sub goals, hill climbing and working backward, heuristics, back track programming, Branch and bound recursion process, program testing, documentation, Meta heuristics.

UNIT V APPLICATION

Development of sorting, searching, algorithms- combinatorial problems, shortest path, probabilistic algorithms.

TOTAL: 45 PERIODS

OUTCOMES:

CO1: Know about the algorithms and basic steps in development of algorithm.
CO2: Acquire knowledge in basic structured languages.
CO3: To write a structured program using appropriate data structure.
CO4: Choose and apply the appropriate methods of design in algorithms or programs.
CO5: To write programs for applications using various algorithms.

REFERENCES:

1. Dromey, “How to solve in by computers, Prentice Hall, 1982.
2. Elias Horowitz, SartajSahani, SanguthevarRajasekaran, Fundamentals of Computer Algorithms, Galgotia Publications, 2003
3. Goodman S.F. &Headtruemu, S.T.,Introduction to the design and analysis of algorithms, Mcgraw Gill, 2000.
4. John R Hubbard, Fundamentals of Computing with C++, Tata Mc Graw Hill, 2000.
5. Panneerselvam.R. “Design and Analysis of Algorithms”, Prentice Hall of India,2008.