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


