Question 1 Show step-by step how to partition the array 11,5,6,12,1,10,9,13,8,10,7
about the value in the middle using the partitioning algorithm described in class.
Question 2 Write the adjacency matrix and adjacency lists of the following
digraph:
0
1
5
#include <iostream>
#include <cstdlib>
using namespace std;
class List
cfw_
private:
int *a;
int n;
int last;
int Find (int val);
bool ValidInsertPos (int pos);
bool ValidRemovePos (int pos);
public:
List (int someSize = 100);
~List();
bool Insert (int va
Statistics Lab Week 4
Name: Trevor Ashley
MATH221
Statistical Concepts:
Probability
Binomial Probability Distribution
Calculating Binomial Probabilities
Open a new MINITAB worksheet.
We are interested in a binomial experiment with 10 trials. First, we
Statistics Lab #6
Name: Trevor Ashley
Statistical Concepts:
Data Simulation
Discrete Probability Distribution
Confidence Intervals
Calculations for a set of variables
Open the class survey results that were entered into the MINITAB worksheet.
We want
Determine the strongly connected components of the digraph G below using
the algorithm described in class. Make sure you:
(1) Use color to indicate the tree edges of the DFS forest of G.
(2) Label each vertex of G with the discovery/finish time.
(3) Do DF
Problem 1 List all the divisors of 48.
Problem 2 What is the remainder of -37 divided by 5?
Problem 3 Show step-by-step how to find the gcd(37, 14).
Problem 4 Does the multiplicative inverse of 37 modulo 14 exist? If it does,
what is it? How did you deter