Analysis and Design of Algorithms (2150703)   Old Code : 150703

6
Credit
4 + 0 + 2
Lect + Tuto + Pract
Teaching Scheme
70 + 20 + 10
ESE + PA + ALA
Theory Marks
20 + 10 + 20
ESE + OEP + PA
Practical Marks
ESE - End Semester Examination, PA - Progress Assessment, ALA - Active Learning Assignments, OEP -Open Ended Problem


Prerequisite
Programming (C or C++) , Data and file structure
Rationale
Obtaining efficient algorithms is very important in mo dern computer engineering as the world wants applications to be time and space and energy efficient. This course enables to understand and analyze efficient algorithms for various applications.
Course Outcome
After learning the course the students should be able to:
  1. Analyze the asymptotic performance of algorithms.
  2. Derive and solve recurrences describing the performance of divide - and - conquer algorithms.
  3. Find optimal solution by applying variou s methods.
  4. Apply pattern matching algorithms to find particular pattern.
  5. Differentiate polynomial and nonpolynomial problems.
  6. Explain the major graph algorithms and their analyses. Employ graphs to model engineering problems, when appropriate.

Active Learning
Preparation of power - point slides, which include videos, animations, pictures, graphics for better understanding theory and practical work – The facul ty will allocate chapters/ parts of chapters to groups of students so that the entire syllabus to be covered. The power - point slides should be put up on the web - site of the College/ Institute, along with the names of the students of the group, the name of the faculty, Department and College on the first slide. The best three works should submit to GTU.