IEM

CIE352: Design and Analysis of Algorithms syllabus for IEM 2021 regulation (Professional Elective-IV)

Design and Analysis of Algorithms detailed syllabus for Industrial Engineering & Management (IEM) for 2021 regulation curriculum has been taken from the Anna Universities official website and presented for the IEM students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Industrial Engineering & Management 5th Sem scheme and its subjects, do visit IEM 5th Sem 2021 regulation scheme. For Professional Elective-IV scheme and its subjects refer to IEM Professional Elective-IV syllabus scheme. The detailed syllabus of design and analysis of algorithms is as follows.

Course Objectives:

Download the iStudy App for all syllabus and other updates.
Get it on Google Play

Unit I

ANALYSING ALGORITHMS 9
The Role of Algorithms in Computing – Growth of Functions – Recurrences – The Substitution Method – The Recurrence Tree Method – The Master Method – Probabilistic Analysis and Randomized Algorithms – Amortized Analysis – Aggregate Analysis -Accounting Method

Unit II

DIVIDE AND CONQUER & GREEDY DESIGN STRATEGIES 9
Analysis of Quick Sort, Merge Sort – Quick Sort Randomized Version – Sorting in Linear Time – Lower Bounds for Sorting – Selection in Expected Linear Time – Selection in Worst case Linear Time – Greedy Algorithms – Elements of Greedy Strategy – Huffman Code, Dijkstra’s Shortest Path Algorithm.

Unit III

Download the iStudy App for all syllabus and other updates.
Get it on Google Play

Unit IV

FLOW NETWORKS AND STRING MATCHING 9
Flow Networks – Ford Fulkerson Method – String Matching – Naive String Matching Algorithm – Knuth Morris Pratt Algorithm – Analysis.

Unit V

NP PROBLEMS 9
NP-Completeness – Polynomial Time Verification – Theory of Reducibility – Circuit Satisfiability – NP – Completeness Proofs – NP Complete Problems: Vertex Cover, Hamiltonian Cycle and Traveling Salesman Problems – Approximation Algorithms -Approximation Algorithms to Vertex – Cover and Traveling Salesman Problems.

Course Outcomes:

  • Design algorithms for various computing problems.
  • Analyze the time and space complexity of algorithms.
  • Critically analyze the different algorithm design techniques for a given problem.
  • Modify existing algorithms to improve efficiency.
  • Analyze the concepts of NP problems

Reference Books:

Download the iStudy App for all syllabus and other updates.
Get it on Google Play

For detailed syllabus of all the other subjects of Industrial Engineering & Management 5th Sem, visit IEM 5th Sem subject syllabuses for 2021 regulation.

For all Industrial Engineering & Management results, visit Anna University IEM all semester results direct link.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.