IE3002 Computational Methods and Algorithms Syllabus:
IE3002 Computational Methods and Algorithms Syllabus – Anna University Regulation 2021
OBJECTIVES
• Able to understand the concept of object oriented programming.
• Understand the the basic concepts of algorithms various algorithm design techniques for developing algorithms
• Discuss about various advanced topics on algorithms.
• Understand the complexity of Algorithms
• Understand various searching, sorting and optimisation algorithms
UNIT I REVIEW OF A LANGUAGE
Review of C/C++- writing and debugging large programs – Controlling numerical errors.
UNIT II ALGORITHM DESIGN METHODS
Greedy–Divide and conquer–Backtracking–Branch & bound–Heuristics-Metaheuristics
UNIT III BASIC TOOLS
Structuredapproach–Networks–Trees–Datastructures
UNIT IV COMPUTATIONALPERFORMANCE
Timecomplexity–Spacecomplexity– Algorithmcomplexity
UNIT V APPLICATIONS
Sorting–Searching-Networks–Scheduling–Optimizationmodels–IEapplications
TOTAL: 45 PERIODS
OUTCOME:
CO1: Use the benefits of object oriented design and understand when it is an appropriate methodology to use.
CO2: Design object oriented solutions for small systems involving multiple objects.
CO3: To apply knowledge of computing and mathematics to algorithm design
CO4: To analyze a problem and identify the computing requirements appropriate for its solution
CO5: To design, implement, and evaluate an algorithm to meet desired needs
TEXT BOOK:
1. Panneerselvam.R,” Designand AnalysisofAlgorithms”,Prentice Hallof India,2008
REFERENCES:
1. GoodmanS F and HeadtruemuST , “Introduction to design of algorithms”, McGraw 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