uLektz Skills

Learning Path

Non-Linear: Random Order

About the Course

Dear Students

This course is offered under Syllabus Completion program. It will help the students to revise and summarize your core topics for better preparation for semester exam. The course scheduled for 15 to 20 hours to covers the core topics by the faculty those who are currently teaching this course

Schedule for DESIGN AND ANALYSIS OF ALGORITHM

Faculty : Dr. S. SUMITRA

Live teaching from 1^st June 2020 to 9^th June 2020

Registration from on 7th May 2020 to 30^th May 2020

OBJECTIVES

The student should be made to:

§ Learn the algorithm analysis techniques.

§ Become familiar with the different algorithm design techniques.

§ Understand the limitations of Algorithm power.

Topics Focused On

Fundamentals of Algorithmic Problem Solving – Fundamental of the Analysis of Algorithm Efficiency

Analysis Framework-Asymptotic Notation and its Properties-Mathematical analysis of Recursive and Non-recursive algorithms

Brute Force – Closest-Pair and Convex-Hull Problems-Exhaustive Search – Traveling Salesman Problem

Knapsack Problem – Assignment problem.Divide and conquer methodology – Merge sort – Quick sort

Binary search – Multiplication of Large Integers – Strassen‟s Matrix Multiplication-Closest-Pair and Convex-HullProblems

Computing a Binomial Coefficient – Warshall‟s and Floyd‟ algorithm

Optimal Binary Search Trees – Knapsack Problem and Memory functions.

Greedy Technique– Prim‟s algorithm- Kruskal’s Algorithm-

Dijkstra’s Algorithm-Huffman Trees.

The Simplex Method-The Maximum-Flow Problem

Maximm Matching in Bipartite Graphs The Stable marriage Problem.

Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P

NP and NP-Complete Problems–Coping with the Limitations- Backtracking

n-Queens problem -Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem

Knapsack Problem – Traveling Salesman Problem-Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem.

Features

Online live Teaching

Limited Participants Only

Taught by Experts those who are teaching the syllabus Currently

Selected and core Topics will be handled

Lecture Notes will be provided

Question Banks will be provided

For Further Details

Dr.A.Clementking

Director

INTEGRATED INTELLIGENT RESEARCH (IIR)

No 29 E, Sarojammal Complex 1st Floor,Keelkattalai, Chennai - 600117,

Mobile : +91 -9884568399 ;+91 9791163515. Email : iirindia2020@gmail.com

Web : www.iirgroups.org

Course Study Materials

Session 1

Fundamentals of Algorithmic Problem Solving – Fundamental of the Analysis of Algorithm Efficiency on 1st June 2020 Mon 3 PM- 4 PM

Session 2

Analysis Framework-Asymptotic Notation and its Properties-Mathematical analysis of Recursive and Non-recursive algorithms on 1st June 2020 Mon 5 PM -6 PM

Session 3

Brute Force – Closest-Pair and Convex-Hull Problems-Exhaustive Search – Traveling Salesman Problem on 2nd June 2020 Tue 3 PM- 4 PM

Session 4

Knapsack Problem – Assignment problem.Divide and conquer methodology – Merge sort – Quick sort on 2nd June 2020 Tue 5 PM -6 PM

Session 5

Binary search – Multiplication of Large Integers – Strassen‟s Matrix Multiplication-Closest-Pair and Convex-HullProblems on 3rd June 2020 Wed 3 PM- 4 PM

Session 6

Computing a Binomial Coefficient – Warshall‟s and Floyd‟ algorithm on 3rd June 2020 Wed 5 PM -6 PM

Session 7

Optimal Binary Search Trees – Knapsack Problem and Memory functions. on 4th June 2020 Thu 3 PM- 4 PM

Session 8

Greedy Technique– Prim‟s algorithm- Kruskal’s Algorithm- on 4th June 2020 Thu 5 PM -6 PM

Session 9

Dijkstra’s Algorithm-Huffman Trees. on 5th June 2020 Fri 3 PM- 4 PM

Session 10

The Simplex Method-The Maximum-Flow Problem on 5th June 2020 Fri 5 PM -6 PM

Session 11

Maximm Matching in Bipartite Graphs The Stable marriage Problem. on 6th June 2020 Sat 3 PM- 4 PM

Session 12

Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P on 6th June 2020 Sat 5 PM -6 PM

Session 13

NP and NP-Complete Problems–Coping with the Limitations- Backtracking on 8th June 2020 Mon 3 PM- 4PM

Session 14

n-Queens problem -Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem on 8th June 2020 Mon 5 PM -6 PM

Session 15

Knapsack Problem – Traveling Salesman Problem-Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem. on 9th June 2020 Tue 3 PM- 4PM

The certificate issued for the Course will have

Student's Name
Photograph
Course Title
Certificate Number
Date of Course Completion
Name(s) and Logo(s) of the Certifying Bodies

Only the e-certificate will be made available. No Hard copies. The certificates issued by Integrated Intelligent Research . can be e-verifiable at www.ulektzskills.com/verify.

Students will be assessed both at the end of each module and at the end of the Course.
Students scoring a minimum of 50% in the assessments are considered for Certifications