Search result for Problem analysis Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 638 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Linear Circuits 1: DC Analysis
by Dr. Bonnie H. Ferri , Dr. Joyelle Harris , Dr Mary Ann Weitnauer- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 85 hours to complete
Problem 2-1-1 Problem 2-1-2 Problem 2-1-3 Problem 2-2-1 Problem 2-2-2 Problem 2-2-3 Problem 2-3-1 Problem 2-3-2 Problem 2-3-3 Problem 2-3-4 Problem 2-4-1 Problem 2-4-2 Problem 2-4-3 Problem 2-4-4 Problem 2-4-5 Problem 2-5-1 Problem 2-5-2 Problem 2-5-3 Problem 2-6-1 Problem 2-6-2 Problem 2-6-3 Sample Problem: Mesh Analysis (Super Mesh) Sample Problem: Mesh Analysis (Depend Sources) 1...
Linear Circuits 2: AC Analysis
by Dr. Bonnie H. Ferri , Dr. Joyelle Harris- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 28 hours to complete
Module 1: AC Circuit Analysis 4 Circuit Analysis with AC Impedances 5 AC Circuit Analysis Example Problem 1-1-1 Problem 1-2-1 Problem 1-3-1 Problem 1-3-2 Problem 1-3-3 Problem 1-3-4 Problem 1-4-1 Problem 1-4-2 Problem 1-4-3 Problem 4-2-1 Problem 4-2-2 Problem 4-3-1 Problem 4-3-2 Problem 4-4-1 Problem 4-4-2 Problem 4-4-3 Problem 5-3-1 Problem 5-4-1...
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
Merge Sort: Analysis Problem Set #1 Problem Set #2 Analysis I: A Decomposition Principle Analysis II: The Key Insight Analysis III: Final Calculations Problem Set #3 Randomized Selection - Analysis Deterministic Selection - Analysis I [Advanced - Optional] Deterministic Selection - Analysis II [Advanced - Optional] Analysis of Contraction Algorithm Problem Set #4...
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
MST Problem Definition Problem Set #1 Analysis of Union-by-Rank [Advanced - Optional] Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional] Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional] Path Compression: Tarjan's Analysis I [Advanced - Optional] Path Compression: Tarjan's Analysis II [Advanced - Optional] Problem Set #2 Problem Definition...
Excel Data Analysis and Problem Solving
by Mofeed Abouseafa- 0.0
-
![]()
![]()
![]()
![]()
![]()
4.5 hours on-demand video
- Create pivot table and use it in data analysis - Use the analysis ToolPak such as ANOVA test, descriptive statistics and histogram chart...
$12.99
Problem Solving with Advanced Analytics
by Patrick Nussbaumer- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 2 weeks
lesson 1 The Analytical Problem Solving Framework Learn a framework for structured problem solving. lesson 3 Linear Regression Apply the Problem Solving Framework to a business problem....
Free
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
Problem Definition Problem Set #1 The Vertex Cover Problem The Traveling Salesman Problem Problem Set #2 Analysis of a Greedy Knapsack Heuristic I Analysis of a Greedy Knapsack Heuristic II Problem Set #3 The Maximum Cut Problem I The Maximum Cut Problem II The 2-SAT Problem Analysis of Papadimitriou's Algorithm Problem Set #4...
Related searches
Power and Sample Size for Multilevel and Longitudinal Study Designs
by Albert Ritzhaupt- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 24 hours to complete
Power or sample size analysis problem 1 Power or sample size analysis problem 2 Power or sample size analysis problem 3 Power or sample size analysis problem 4 Power or sample size analysis quiz 4 Week 5: Ethics and Using Power and Sample Size Analysis to Get Funded Power or sample size analysis problem 5...
Approximation Algorithms
by Mark de Berg- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
If you think you found an error, report a problem by clicking the square flag at the bottom of the lecture or quiz where you found the error. The Load Balancing problem Analysis of the greedy-algorithm The load balancing problem The vertex-cover problem Knapsack Problem Analysis of the PTAS for knapsack: approximation ratio...
Root Cause Analysis
by Management Study Guide- 3.9
-
![]()
![]()
![]()
![]()
![]()
1 hour on-demand video
Root Cause Analysis is a method that is used to deal with a problem, error or failure by finding the ‘origin of problem. This course is designed to help the employees to find out the root cause of any problems and fix it so that the problem does not repeat....
$9.99
