×
Create CV Books Summaries Online Courses Blog Communities

Login

Sign up
MindLuster Logo
Categories
Recent

Design and analysis of algorithms

Track :

Computer Science
Course Presenter :

Trouble Free

Lessons no : 37

For Free Certificate After Complete The Course

To Register in Course you have to watch at least 30 Second of any lesson

Join The Course Go To Community Download Course Content

What will you learn in this course?
  • Master how to design efficient algorithms for sorting, searching, and graph problems using core computer science principles.
  • Analyze algorithm complexity and optimize performance for real-world applications in software development and data analysis.
  • Apply dynamic programming and advanced computational techniques to solve complex problems effectively and efficiently.
  • Evaluate and select appropriate algorithms to improve system performance and solve computational challenges in various tech roles.

How to Get The Certificate

  • You must have an account Register
  • Watch All Lessons
  • Watch at least 50% of Lesson Duration
  • you can follow your course progress From Your Profile
  • You can Register With Any Course For Free
  • The Certificate is free !
Lessons | 37
1 Algorithms Introduction Performance Analysis DAA
00:06:11

1 Algorithms Introduction Performance Analysis DAA
2 Time Complexity Of Algorithms with Example Best Worst Average Case Time Complexities DAA
00:06:07

2 Time Complexity Of Algorithms with Example Best Worst Average Case Time Complexities DAA
3 Space Complexity Of Algorithms with Example Calculating Space Complexity DAA
00:07:51

3 Space Complexity Of Algorithms with Example Calculating Space Complexity DAA
4 Asymptotic Notations Big Oh Omega Theta Little Oh Notation DAA
00:14:42

4 Asymptotic Notations Big Oh Omega Theta Little Oh Notation DAA
Divide and Conquer Algorithm General Method Lec 5 DAA
00:05:23

Divide and Conquer Algorithm General Method Lec 5 DAA
Binary Search Algorithm Concept Code Example Time Complexity L 6 DAA
00:18:24

Binary Search Algorithm Concept Code Example Time Complexity L 6 DAA
Quick Sort Algorithm Concept Code Example Time Complexity L 7 DAA
00:17:11

Quick Sort Algorithm Concept Code Example Time Complexity L 7 DAA
Merge Sort Algorithm Concept Code Example Time Complexity L 8 DAA
00:17:45

Merge Sort Algorithm Concept Code Example Time Complexity L 8 DAA
Strassen s Matrix Multiplication Concept Algorithm Time Complexity L 9 DAA
00:09:04

Strassen s Matrix Multiplication Concept Algorithm Time Complexity L 9 DAA
Disjoint Set Operations Simple Union Find Algorithms L 10 DAA
00:10:15

Disjoint Set Operations Simple Union Find Algorithms L 10 DAA
Back Tracking General Method Example Applications L 11 DAA
00:05:48

Back Tracking General Method Example Applications L 11 DAA
N Queens Problem in Back Tracking Method Example L 12 DAA
00:10:58

N Queens Problem in Back Tracking Method Example L 12 DAA
Sum Of Subsets Problem in Back Tracking Method Example L 13 DAA
00:11:33

Sum Of Subsets Problem in Back Tracking Method Example L 13 DAA
Graph Coloring Problem in Back Tracking Method Example L 14 DAA
00:12:31

Graph Coloring Problem in Back Tracking Method Example L 14 DAA
Dynamic Programming General Method Example Applications L 15 DAA
00:10:51

Dynamic Programming General Method Example Applications L 15 DAA
Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 1 L 16 DAA
00:21:11

Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 1 L 16 DAA
Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 2 L 17 DAA
00:22:16

Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 2 L 17 DAA
0 1 Knapsack Algorithm with Example using Dynamic Programming L 18 DAA
00:16:40

0 1 Knapsack Algorithm with Example using Dynamic Programming L 18 DAA
All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 1 L 19 DAA
00:14:21

All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 1 L 19 DAA
All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 2 L 20 DAA
00:09:54

All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 2 L 20 DAA
Travelling Salesperson Problem with Example using Dynamic Programming L 21 DAA
00:20:36

Travelling Salesperson Problem with Example using Dynamic Programming L 21 DAA
Reliability Design with Example using Dynamic Programming L 22 DAA
00:28:40

Reliability Design with Example using Dynamic Programming L 22 DAA
Greedy Method General Method Example Applications L 23 DAA
00:05:01

Greedy Method General Method Example Applications L 23 DAA
Job Sequencing with Deadlines with Example using Greedy Method L 24 DAA
00:09:14

Job Sequencing with Deadlines with Example using Greedy Method L 24 DAA
Knapsack Problem with Example using Greedy Method L 25 DAA
00:11:37

Knapsack Problem with Example using Greedy Method L 25 DAA
Minimum Cost Spanning Tree with Example using Greedy Method L 25 DAA
00:15:25

Minimum Cost Spanning Tree with Example using Greedy Method L 25 DAA
Single Source Shortest Path Problem with Example using Greedy Method L 25 DAA
00:13:21

Single Source Shortest Path Problem with Example using Greedy Method L 25 DAA
Tree Traversal Techniques Inorder Preorder and Postorder with Example L 26 DAA
00:12:23

Tree Traversal Techniques Inorder Preorder and Postorder with Example L 26 DAA
Graph Traversal Techniques Depth First Search and Breadth First Search with Example L 27 DAA
00:15:05

Graph Traversal Techniques Depth First Search and Breadth First Search with Example L 27 DAA
Branch and Bound Method Example Applications DAA
00:20:16

Branch and Bound Method Example Applications DAA
Travelling Sales Person Branch Bound with Example Part 1 DAA
00:18:01

Travelling Sales Person Branch Bound with Example Part 1 DAA
Travelling Sales Person Branch Bound with Example Part 2 DAA
00:12:42

Travelling Sales Person Branch Bound with Example Part 2 DAA
0 1 Knapsack with Least Cost Branch Bound with Example Part 1 DAA
00:19:09

0 1 Knapsack with Least Cost Branch Bound with Example Part 1 DAA
0 1 Knapsack with Least Cost Branch Bound with Example Part 2 DAA
00:13:40

0 1 Knapsack with Least Cost Branch Bound with Example Part 2 DAA
0 1 Knapsack with FIFO Branch Bound with Example Part 1 DAA
00:20:41

0 1 Knapsack with FIFO Branch Bound with Example Part 1 DAA
0 1 Knapsack with FIFO Branch Bound with Example Part 2 DAA
00:14:58

0 1 Knapsack with FIFO Branch Bound with Example Part 2 DAA
NP Hard and NP Complete Problems Non Deterministic Algorithms DAA
00:10:21

NP Hard and NP Complete Problems Non Deterministic Algorithms DAA

Recommended Courses



Design and Analysis of algorithms DAA
55 Lessons

Design and Analysis of algorithms DAA



We Appreciate Your Feedback

Be the First One Review This Course

Excellent
0 Reviews
Good
0 Reviews
medium
0 Reviews
Acceptable
0 Reviews
Not Good
0 Reviews
0
0 Reviews

Our New Certified Courses Will Reach You in Our Telegram Channel
Join Our Telegram Channels to Get Best Free Courses

Join Now

Related Courses

Linear Algebra for Computer Scientists
7 Lessons

Linear Algebra for Computer Scientists

Insertion Sort
3 Lessons

Insertion Sort

Bubble Sort
4 Lessons

Bubble Sort

GCSE Computer Science
18 Lessons

GCSE Computer Science

Random Access Memory
7 Lessons

Random Access Memory

Binary Trees
4 Lessons

Binary Trees

Bitwise Operators
4 Lessons

Bitwise Operators

Introduction to Stacks Data Structures
17 Lessons

Introduction to Stacks Data Structures

Organization Theory Structure and Design
42 Lessons

Organization Theory Structure and Design

Handling Large Scale Unit Level Data
41 Lessons

Handling Large Scale Unit Level Data

Introduction to Machine Learning
19 Lessons

Introduction to Machine Learning

Applied Linear Algebra Vectors Matrices
54 Lessons

Applied Linear Algebra Vectors Matrices

Artificial Intelligence beginners
1 Lessons

Artificial Intelligence beginners

Machine Learning Autumn 2018
1 Lessons

Machine Learning Autumn 2018

Robotics and Autonomous Systems
15 Lessons

Robotics and Autonomous Systems

Natural Language Understanding
15 Lessons

Natural Language Understanding

Enhance your understanding of core computer science principles with our comprehensive online course on Design and Analysis of Algorithms. This training course is specifically designed to equip learners with the essential skills needed to solve complex computational problems efficiently. Whether you are a student, a professional seeking to advance your career, or an enthusiast aiming to deepen your knowledge in computer science, this course offers valuable insights to elevate your expertise. Throughout this course, you will learn how to develop, analyze, and optimize algorithms for a variety of applications. Gain practical skills in algorithm design techniques, complexity analysis, and problem-solving strategies that are critical in today's technology-driven world. The course covers fundamental topics such as sorting and searching algorithms, graph algorithms, dynamic programming, and advanced computational concepts. By the end of this training, you'll be able to assess algorithm efficiency and apply best practices to real-world challenges. This course is ideal for computer science students, software developers, data analysts, and IT professionals who want to strengthen their professional skills. It provides a solid foundation for those interested in pursuing careers in software engineering, data science, or research and development within the Middle East, including Saudi Arabia and the UAE, where technological innovation is rapidly expanding. Choosing this online platform ensures flexible learning tailored to your schedule. Our certified course offers a recognized certificate of completion, validating your skills and enhancing your professional profile. The training is designed to be engaging and practical, with real-world examples and assessments to reinforce learning. Upon completing this course, you'll be well-positioned for career growth in various tech-driven roles. Opportunities include software developer, algorithm engineer, data scientist, or research analyst, among others. The certification you earn can open doors to new job prospects and career advancement in the competitive Middle East and beyond. Enroll in this Certified Course today to develop your computer science skills, achieve your professional goals, and stay ahead in the fast-evolving technology landscape. Trouble Free