Design and Analysis of Algorithm (ADA)

Algorithms afford fundamental and advanced ideas of Algorithms.

  • 4.5 (2 Reviews) , 14 students enrolled

Course Overview

Algorithms afford fundamental and advanced ideas of Algorithms. Our algorithms are designed for novices and professionals. Algorithms are a way to store and arrange facts so that it can be used efficiently. Our Algorithms consist of all subjects of Algorithms such as greedy Algorithms, Divide and Conquer, Tree, Searching, Sorting, Programs, etc.

What are the requirements?

  • • The primary syntax of C or C++
  • • Basic perception of one programming language

What am I going to get from this course?

  • • Deeply recognize fundamental Algorithms concepts
  • • Apply Algorithms to new problems
  • • Analyse Algorithms efficiency
  • • Find efficient Algorithms
  • • Solve Algorithms problems

What is the target audience?

  • • Computer science professionals

About the Author

We at SkillRary strive to provide simple yet powerful training or tuition on all domains. This organization has started with a mindset to share the knowledge that the internet or an individual has in a progressive manner. SkillRary is an online training programme, trying to get the best content for all on a very low cost and thereby helping everyone with a digital schooling and online education.  

SkillRary provides computer based training (CBT), distance learning or e-learning, that takes place completely on the internet. The courses involve a variety of multimedia elements, including graphics, audio, video, and web-links which can be accessed to the enrolled clients.

In addition to presenting course materials and content, SkillRary gives the students the opportunity for live interactions and real-time feedback in the form of quizzes and tests. Interactions between the instructor and students are also conducted via chat, e-mail or other web-based communication. Unlike any other, we here also let the students know which module has to be gone through first. All the modules are placed according to the lesson plans so that students will know what to refer first.

SkillRary is self-paced and customizable to suit an individual's specific learning needs. Therefore it can be conducted at any time and place, provided there is a computer or smartphone with high-speed internet access. This makes it very convenient to the users who can modify their training to fit into their day-to-day schedule. All our users will be able to use our eLearning system to its full capacity.

Course Curriculum

Chapter 1 : Introduction to Algorithms
9 Video Lectures | 01:05:38

  • Introduction
    00:18:17
     
  • Analysis Of Algorithms
    00:03:38
     
  • Insertion Sort
    00:04:37
     
  • Analysis of Insertion Sort
    00:13:49
     
  • Asymptotic Analysis
    00:02:04
     
  • Asymptotic Notation
    00:09:45
     
  • Example of Asymptotic Analysis
    00:03:04
     
  • Better Algorithm
    00:07:39
     
  • Comparison of Running Time
    00:02:45
     

Chapter 2 : Divide and Conqure
6 Video Lectures | 00:45:30

  • Divide and Conqure
    00:04:53
     
  • Recurrence Equation Analysis
    00:03:41
     
  • Guess And Test Method
    00:09:54
     
  • Master Method
    00:02:13
     
  • Tree
    00:14:33
     
  • Example of Master Method
    00:10:16
     

Chapter 3 : Sorting Algorithms
3 Video Lectures | 00:37:10

  • Sorting algorithms
    00:17:49
     
  • Insertion Sort
    00:12:34
     
  • Selection Sort
    00:06:47
     

Recursive Algorithms
6 Video Lectures | 01:04:22

  • Recursive Algorithms
    00:06:16
     
  • Analysis of Recursive Algorithms
    00:02:20
     
  • Quick Sort
    00:17:50
     
  • Merge Sort
    00:15:40
     
  • Merge Step Fuction
    00:04:50
     
  • Heap Sort
    00:17:26
     

Chapter 5 : Searching Algorithms
3 Video Lectures | 00:16:35

  • Searching Algorithms
    00:01:17
     
  • Linear Search
    00:07:01
     
  • Binary Search
    00:08:17
     

Chapter 6 : Graph
3 Video Lectures | 00:32:48

  • Graph
    00:08:31
     
  • breadth first traversal
    00:07:36
     
  • depth first traversal
    00:16:41
     

Chapter 7 : Dijkstra' Algorithm
3 Video Lectures | 00:43:22

  • single source shortest path
    00:12:25
     
  • Dijkstra's algorithm Example 1
    00:16:31
     
  • Dijkstra's Algorithm Example 2
    00:14:26
     

Chapter 8 : Spanning Trees
5 Video Lectures | 01:01:03

  • Spanning Trees
    00:04:20
     
  • Minimum spanning tree
    00:08:03
     
  • Kruskal's Algorithms
    00:15:15
     
  • Analysis of Kruskal's Algorithms
    00:01:45
     
  • Prim's Algorithms
    00:31:40
     

reviews

  • Satish D
    The course was a great learning experience, very easy and well explained.
    5 months ago
  • Varun M
    The course was good. It contained some practical problems along the way to test what I had learnt along the way.
    5 months ago