Statistik
0 Probleme
61 Lösungen
RANG
N/A
of 301.552
REPUTATION
N/A
BEITRÄGE
0 Fragen
0 Antworten
ANTWORTZUSTIMMUNG
0.00%
ERHALTENE STIMMEN
0
RANG
of 21.321
REPUTATION
N/A
DURCHSCHNITTLICHE BEWERTUNG
0.00
BEITRÄGE
0 Dateien
DOWNLOADS
0
ALL TIME DOWNLOADS
0
BEITRÄGE
0 Beiträge
BEITRÄGE
0 Öffentlich Kanäle
DURCHSCHNITTLICHE BEWERTUNG
BEITRÄGE
0 Discussions
DURCHSCHNITTLICHE ANZAHL DER LIKES
Feeds
Gelöst
3D Plots and Colorbars
Use the matrices X, Y, and Z provided in the function template to create a surface plot. Add a colorbar to the surface plot and ...
etwa 7 Stunden vor
Gelöst
Plot Line Specifications
Create a line plot for function cos(x) where x is a vector of linearly spaced values going from 0 to input N with an increment o...
etwa 7 Stunden vor
Gelöst
Power Outages Histogram
Create a function that takes power outage data as an input and creates a histogram of the number of outages as a function of Reg...
etwa 7 Stunden vor
Gelöst
Plotting Practice
Plot cos(x) vs x as shown in the figure below. Include the appropriate title, x-label, and y-label. Note, it is case sensitive. ...
3 Tage vor
Gelöst
Sieve of Eratosthenes - 02
"Sift the Two's and Sift the Three's, The Sieve of Eratosthenes. When the multiples sublime, The numbers that remain a...
3 Tage vor
Gelöst
Travelling Salesman Problem (TSP)
Find a short way through given points. This is the travelling salesman problem. But the solution should be a fast and small func...
3 Tage vor
Gelöst
Parcel Routing
Given a matrix that represent the distance along highways between major cities numbered 1 to _N_, provide the path and shortest ...
3 Tage vor
Gelöst
Graph Algorithms 3: Number of Connected Components
Given an adjacency matrix of a simple undirected graph, find the number of connected components.
3 Tage vor
Gelöst
FloydWarshall
Our task is to find shortest paths between every pair of nodes. Floyd-Warshall is a graph algorithm for finding shortest paths i...
3 Tage vor
Gelöst
Count the Number of Directed Cycles in a Graph
Given an asymmetric adjacency matrix, determine the number of unique directed cycles. For example, the graph represented by adj...
3 Tage vor
Gelöst
Determine connected components of a graph
Adjacency matrix of an undirected graph is given. Return the number of connected components in the graph.
3 Tage vor
Gelöst
Is A the inverse of B?
Given a matrix A and a matrix B, is A the inverse of B? >>A=[2,4;3,5]; >>B=[-2.5,2;1.5,-1]; >>isInverse...
3 Tage vor
Gelöst
Square root
Given x (a matrix), give back another matrix, where all the elements are the square roots of x's elements.
3 Tage vor
Gelöst
Calculate the average value of the elements in the array
Calculate the average value of the elements in the array
3 Tage vor
Gelöst
the average value of the elements
Calculate the average value of the elements in the array
3 Tage vor
Gelöst
Create a figure and plot data
Given two data vectors (x,y), open a new figure and plot the data. Return the figure handle.
3 Tage vor
Gelöst
Given n, create n random numbers such that their standard deviation is also n.
Given n, create n random numbers such that their standard deviation is also n.
3 Tage vor
Gelöst
Chess probability
The difference in the ratings between two players serves as a predictor of the outcome of a match (the <http://en.wikipedia.org/...
4 Tage vor
Gelöst
Roll the Dice!
Description Return two random integers between 1 and 6, inclusive, to simulate rolling 2 dice. Example [x1,x2] = rollDice(...
4 Tage vor
Gelöst
Solve a System of Linear Equations
Example: If a system of linear equations in x₁ and x₂ is: 2x₁ + x₂ = 2 x₁ - 4 x₂ = 3 Then the coefficient matrix (A) is: 2 ...
4 Tage vor
Gelöst
Calculate Amount of Cake Frosting
Given two input variables r and h, which stand for the radius and height of a cake, calculate the surface area of the cake you n...
4 Tage vor
Gelöst
Vector creation
Create a vector using square brackets going from 1 to the given value x in steps on 1. Hint: use increment.
4 Tage vor
Gelöst
Doubling elements in a vector
Given the vector A, return B in which all numbers in A are doubling. So for: A = [ 1 5 8 ] then B = [ 1 1 5 ...
4 Tage vor
