uLektz Skills

Learning Path

Non-Linear: Random Order

About the Course

Course Description

This course provides students with concepts of Pseudo code for expressing algorithms, Asymptotic Notation, Probabilistic analysis, Amortized analysis, Divide and conquer: General method, Greedy method General method and Single source shortest path problem

Objectives

1.Will familiarize about Optimal binary search trees

2.Will demonstrate All pairs shortest path problem

3.Will develop knowledge in Travelling sales person problem

Prerequisite

There is no particular prerequisite to learn Design and Analysis of Algorithms, you will be able to do very well, if you have these basic skills:

1. Basic Programming Skills

2. Good Understanding Skills

3. Good Communication Skills

Course Study Materials

Module 1: Introduction to algorithms

1.1 Introduction
1.2 Pseudo code for expressing algorithms
1.3 Asymptotic Notation
1.4 Probabilistic analysis, Amortized analysis
Introduction to algorithms 8 Questions

Module 2: Divide and conquer algorithm

2.1 Divide and conquer: General method
2.2 Quick sort
2.3 Merge sort
Divide and conquer algorithm 6 Questions

Module 3: Greedy method

3.1 Greedy method: General method
3.2 knapsack problem
3.3 Single source shortest path problem
Greedy method 6 Questions

Module 4: Dynamic Programming

4.1 Dynamic Programming: General method
4.2 Optimal binary search trees
4.3 All pairs shortest path problem
Dynamic Programming 6 Questions

Module 5: Backtracking

5.1 Backtracking: General method
5.2 Graph coloring
Backtracking 6 Questions

Module 6: Branch and Bound

6.1 Branch and Bound: General method
6.2 Applications
6.3 Travelling sales person problem
6.4 LC Branch and Bound solution
Branch and Bound 6 Questions

Final Assessment

Final Assessment 20 Questions

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 The Academic Council of uLektz. 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