Algorithms and Software Engineering for Professionals

Name: Algorithms and Software Engineering for Professionals
Brand: Eduonix Technologies
Price: 17.00 USD
Availability: Discontinued

7.5 Hours

$17.00$40.00

You save 57%

101 Lessons (7.5h)

Introduction
Introduction4:23
Iterations and Transformations on Sequence’s
Iterations4:31
Iterations Lab 1 Count Condition Loops with Java 8 Streams2:30
Iterations with Java Collections .4:18
Iterations Lab 2 LinkedList Unsafe iteration on Queues2:24
Iterations with Java Maps and Streams4:36
Iterations Lab 3 Matching Pattern Sequences with iterations Part A0:01
Iterations Lab 3 Matching Pattern Sequences with iterations Part B4:18
Time Complexity
Time Complexity4:08
Big O specific calculation3:11
Time Complexity Lab 1 Practical Obtain Sequence Introduction4:31
Time Complexity Lab 1 Practical Task Obtain Sequence Solutions3:48
Array Operations 1 Equilibrium Index4:25
Array Operations 2 Optimal Index3:51
Sorting Arrays4:13
Time Complexity Lab 2 Array task with Expected Worst case time complexity O(n)3:26
Space complexity4:08
Sorting Algorithms Time and Space complexity3:45
Common Sorting Algorithms best and worst case3:58
Time Complexity Lab 3 Sorting Algorithm efficiency4:44
Counting and Optimisation
Counting Concepts3:13
Sliding window maxima and minima4:53
Counting and Optimisation Lab 1 Application of a Sliding window3:11
Counting and Optimisation Lab 1 Application of a Sliding window Part B4:22
Counting Patterns3:37
Count Combinations4:18
Count Permutations4:23
"Counting and Optimisation Lab 2 Application of Counting to Permutations "4:29
Counting Theorem for Algorithms3:39
Counting Sort4:35
Pigeonhole Sort4:33
Counting and Optimisation Lab 3 Application of the Counting Theorem4:15
Sorting
Sorting Concepts4:44
Implement Insertion Sort with comparator4:07
Sorting Lab 1 Introduction3:54
Sorting Lab 1 Compute the number of distinct values in array of N integers.3:27
Breaking the Quadratic time barrier4:55
Implement Heap Sort4:36
Recursive Sorting Algorithms4:36
Implement MergeSort4:33
Sorting Lab 2 Practical Optimise subsequences4:31
Implement Radix sort Part A3:44
Implement Radix sort Part B3:25
Sorting Lab 3 Practical Radix Sort on String Arrays4:26
Stacks and Queues
Stack Concepts4:24
Implement a basic Stack with a Linked List4:40
Perform simple stack algorithm with Reverse Polish notation3:43
Stacks and Queues Lab 1 Application of a Stack3:27
Queue Concepts4:20
Implement a basic Queue with a Linked List3:33
Practical Application of a Queue4:25
Stacks and Queues Lab 2 Practical Application of a Queue4:16
Parsing Concepts4:43
Implement a simple AST parser4:25
Stacks and Queues Lab 3 Test for Well Formed Expressions4:15
Divisibility Operations and Primes
Slice Operations4:54
Implement Kadane's algorithm4:51
Implement a double-slice operation3:46
Slice Operations Lab 1 Application of a slice operation Part A4:06
Slice Operations Lab 1 Application of a slice operation Part B4:29
Divisibility Operations4:42
Implement Euclidean algorithm (common factors)4:04
Implement a test for a prime number4:59
Slice Operations Lab 2 Simple Peak detection3:06
Slice Operations Lab 2 Simple Peak detection Part B4:54
Divisibility Operations and Primes4:53
Sieving (finding prime numbers)4:36
Slice Operations Lab 3 Probabilistic Tests for Large Primes Part A4:44
Slice Operations Lab 3 Probabilistic Tests for Large Primes Part B4:42
Tree Based Algorithms
Search Algorithms4:41
Implement a Binary search4:45
Implement a Hash table4:45
Tree Based Algorithms Lab 1 Binary search algorithm optimisation4:47
Binary Trees4:35
Implement a Binary Search Tree4:41
Binary Tree recursion3:50
Tree Based Algorithm Lab 2 Extend the Binary Tree API4:03
Avl Trees4:22
Implement a Avl Tree4:52
Sub Trees and Paths3:40
Tree Based Algorithm Lab 3 Tree Traversal (Paths)4:34
Graph Algorithms
Graphs Concepts4:56
Implement a Graph as a Abstract Data Type (ADT)4:43
Implement a Depth-first search4:42
Graph Algorithms Lab 1 Path Search with dfs3:44
Implement a Directed Graph as a Abstract Data Type (ADT)4:02
Implement a Breadth-first search4:40
Graph Algorithms Lab 2 Breadth First Search4:24
Topological Sort4:45
Implement a Topological sort4:46
Graph Algorithms Lab 3 Shortest Path Optimisation4:32
Algorithm Design
Greedy Programming Concepts4:43
Implement a Greedy Solution4:22
Algorithm Design Lab 1 Overlapping Segment Application3:40
Dynamic Programming Concepts4:46
Implement a Dynamic Solution4:55
Algorithm Design Lab 2 Optimise Stock Trades Part A3:35
Algorithm Design Lab 2 Optimise Stock Trades Part B3:41
Divide-and-Conquer Concepts4:05
Implement a Divide-and-Conquer Solution4:52
Algorithm Design Lab 3 Count the Unique Inversions4:09

DescriptionInstructorImportant DetailsRelated Products

Nail Down the Theory Behind Software Engineering to Become the Best You Can Be

Eduonix TechnologiesEduonix creates and distributes high-quality technology training content. Their team of industry professionals has been training manpower for more than a decade. They aim to teach technology the way it is used in the industry and professional world. They have a professional team of trainers for technologies ranging from Mobility, Web and Enterprise, and Database and Server Administration.

Description

Data structures and algorithms are the basic building blocks of any software engineering. As with most things, understanding the conceptual cornerstones are vital to becoming the best software engineer you can be. This comprehensive course takes a holistic approach to data structures and algorithms, allowing you to separate yourself from the job-searching pack.

Access 101 lectures & 7.5 hours of content 24/7
Learn the five major categories of algorithms: cryptography, compiler theory, signal processing, data analysis, & graph databases
Understand recursion & its relationship to concurrency & ADTs
Explore the relationship between trees & rotation operations used in balancing
Examine data structure & algorithms through practical examples
Discover Fermat's theorem, parsing grammars w/ stacks & queues, & related tools like AST based parsers

Specs

Details & Requirements

Length of time users can access this course: lifetime
Access options: web streaming, mobile streaming
Certification of completion not included
Redemption deadline: redeem your code within 30 days of purchase
Experience level required: all levels

Terms

Unredeemed licenses can be returned for store credit within 30 days of purchase. Once your license is redeemed, all sales are final.

Your Cart

Your cart is empty. Continue Shopping!

Processing order...