CSF 2
Either draw a graph with the given specifications or explain why no such graph exists:
A tree with twelve vertices and eleven edges.
(300 words)
CSF 1
What are some of the requirements and techniques for virtualization?
(300 words)
CSF 2
Either draw a graph with the given specifications or explain why no such graph exists:
A tree with twelve vertices and eleven edges.
(300 words)
CSF 1
What are some of the requirements and techniques for virtualization?
(300 words)
Do some research on the history of ethical hacking. Find at least two credible resources. To help you begin, try searching on Clifford Stoll, who has written on the topic.
Based on your research, write a 2-page descriptive essay on the following:
Explain the history of ethical hacking, including the role hacking played in the inception of Apple Computers, John Draper, and Phone Phreaks. Include how the term “hacker” came to be and its various meanings. Speculate on what the future has in store for ethical hacking, including the impact of the cloud, ubiquitous data, and quantum computing.
Link to video to react to: https://www.nfb.ca/film/ryan/
Consider and explain how animation creates meaning in this piece. The use of 3-D animation expresses a specific aspect of this narrative that isn’t told through words. Also consider color and texture in this context
Most of the animation takes place in a mirrored space (you will notice this if you pay attention to the backgrounds). Why do you think this is? How does this formal choice create meaning?
3 pages please double spaced
Summarize what you have learned over the last 9 weeks. Has it changed your opinion about technology? Do you believe technology will continue to evolve? What businesses should concerned about being “phased” out due to new technology?
You have been asked to conduct research on a past forensic case to analyze how digital data was used to solve the case. Choose one of the following digital forensic cases:
Use the Stayer University Library and/or the Internet to search for the case notes and reports.
Write a 6–8 page term paper in which you analyze how digital data was used to solve your selected case. Specifically, you are to:
This course requires the use of Strayer Writing Standards. For assistance and information, please refer to the Strayer Writing Standards link in the left-hand menu of your course. Check with your professor for any additional instructions. Note the following:
The specific course learning outcome associated with this assignment is:
I need a simple and Intresting android mobile application
DISCUSS THE NOTION THAT FIRMS SHOULD STOP DOING BUSINESS WITH CUSTOMERS WHO CONSTANTLY GENERATE LOSSES VERSUS THE NOTION THAT THE CUSTOMER IS ALWAYS RIGHT
For this assignment, you are to assume that all involved have moral convictions (not political or economic) associated with their side of the ethical debate. Your job is to look at both sides as objectively as possible to make an evidence-based judgment.
For this assignment, you are asked to present your judgment on the current ethical debate related to human cloning. You can present the current state of the debate, pro and con arguments, and your judgment using your choice of media. For example, you could choose to create an essay, a PowerPoint presentation without audio, or use Prezi. Please do not create a video recording for this presentation.
Your completed presentation must include:
Be sure to use appropriate sources for the external references required for this assignment.
instructions attached below
#include
#include
using namespace std;
const int ROWS = 8;
const int COLS = 9;
//P(sense obstacle | obstacle) = 0.8
float probSenseObstacle = 0.8;
//P(senses no obstacle | obstacle) = 1 – 0.8 = 0.2
float probFalseNoObstacle = 0.2;
//P(sense obstacle | no obstacle) = 0.15
float probFalseObstacle = 0.15;
//P(senses no obstacle | no obstacle) = 1 – 0.15 = 0.85
float probSenseNoObstacle = 0.85;
//Puzzle including a border around the edge
int maze[ROWS][COLS] =
{ {1,1,1,1,1,1,1,1,1},
{1,0,0,0,0,0,0,0,1},
{1,0,1,0,0,1,0,0,1},
{1,0,0,0,0,0,0,0,1},
{1,0,1,0,0,1,0,0,1},
{1,0,0,0,0,0,0,0,1},
{1,0,0,0,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1},
};
//Matrix of probabilities
float probs[ROWS][COLS];
//Temporary matrix
float motionPuzzle[ROWS][COLS];
float sensingCalculation(int evidence[4], int row, int col)
{
float result = 1.0;
//If obstacle sensed to the west
if (evidence[0] == 1)
{
//If obstacle to the west in maze
if (maze[row][col – 1] == 1)
result *= probSenseObstacle;
//If no obstacle to the west in maze
else
result *= probFalseObstacle;
}
//If no obstacle sensed to the west
else
{
//If obstacle to the west in maze
if (maze[row][col – 1] == 1)
{
result *= probFalseNoObstacle;
}
//If no obstacle to the west in maze
else
{
result *= probSenseNoObstacle;
}
}
//If obstacle sensed to the north
if (evidence[1] == 1)
{
//If obstacle to the north in maze
if (maze[row – 1][col] == 1)
result *= probSenseObstacle;
//If no obstacle to the north in maze
else
result *= probFalseObstacle;
}
//If no obstacle sensed to the north
else
{
//If obstacle to the north in maze
if (maze[row – 1][col] == 1)
{
result *= probFalseNoObstacle;
}
//If no obstacle to the north in maze
else
{
result *= probSenseNoObstacle;
}
}
//If obstacle sensed to the east
if (evidence[2] == 1)
{
//If obstacle to the east in maze
if (maze[row][col + 1] == 1)
result *= probSenseObstacle;
//If no obstacle to the east in maze
else
result *= probFalseObstacle;
}
//If no obstacle sensed to the east
else
{
//If obstacle to the east in maze
if (maze[row][col + 1] == 1)
{
result *= probFalseNoObstacle;
}
//If no obstacle to the east in maze
else
{
result *= probSenseNoObstacle;
}
}
//If obstacle sensed to the south
if (evidence[3] == 1)
{
//If obstacle to the south in maze
if (maze[row + 1][col] == 1)
result *= probSenseObstacle;
//If no obstacle to the south in maze
else
result *= probFalseObstacle;
}
//If no obstacle sensed to the south
else
{
//If obstacle to the south in maze
if (maze[row + 1][col] == 1)
{
result *= probFalseNoObstacle;
}
//If no obstacle to the south in maze
else
{
result *= probSenseNoObstacle;
}
}
return result;
}
//Use evidence conditional probability P(Zt|St)
void sensing(int evidence[4])
{
float denominator = 0;
//Calculates denominator
for (int r = 0; r < ROWS; r++)
{
for (int c = 0; c < COLS; c++)
{
if (maze[r][c] != 1)
{
denominator += sensingCalculation(evidence, r, c) * probs[r][c];
}
}
}
for (int row = 0; row < ROWS; row++)
{
for (int col = 0; col < COLS; col++)
{
//If the current space isn’t an obstacle
if (maze[row][col] != 1)
{
float currentProbabilty = probs[row][col];
float numerator = sensingCalculation(evidence, row, col) * currentProbabilty;
float result = numerator / denominator;
probs[row][col] = result;
}
}
}
}
//Use transition probability P(St|St-1)
void motion(int direction)
{
for (int row = 0; row < ROWS; row++)
{
for (int col = 0; col < COLS; col++)
{
if (maze[row][col] != 1)
{
float total = 0.0;
//north
if (direction == 1)
{
//checking west
if (maze[row][col – 1] != 1)
{
total += probs[row][col – 1] * 0.1;
}
else
{
total += probs[row][col] * 0.1;
}
//checking north
if (maze[row – 1][col] != 1)
{
total += probs[row – 1][col] * 0;
}
else
{
total += probs[row][col] * 0.8;
}
//checking east
if (maze[row][col + 1] != 1)
{
total += probs[row][col + 1] * 0.1;
}
else
{
total += probs[row][col] * 0.1;
}
//checking south
if (maze[row + 1][col] != 1)
{
total += probs[row + 1][col] * 0.8;
}
else
{
total += probs[row][col] * 0;
}
}
//west
else if (direction == 0)
{
//checking west
if (maze[row][col – 1] != 1)
{
total += probs[row][col – 1] * 0;
}
else
{
total += probs[row][col] * 0.8;
}
//checking north
if (maze[row – 1][col] != 1)
{
total += probs[row – 1][col] * 0.1;
}
else
{
total += probs[row][col] * 0.1;
}
//checking east
if (maze[row][col + 1] != 1)
{
total += probs[row][col + 1] * 0.8;
}
else
{
total += probs[row][col] * 0;
}
//checking south
if (maze[row + 1][col] != 1)
{
total += probs[row + 1][col] * 0.1;
}
else
{
total += probs[row][col] * 0.1;
}
}
motionPuzzle[row][col] = total;
}
else
{
motionPuzzle[row][col] = -1;
}
}
}
for (int r = 0; r < ROWS; r++)
{
for (int c = 0; c < COLS; c++)
{
probs[r][c] = motionPuzzle[r][c];
}
}
}
void printPuzzle(float puzzle[ROWS][COLS])
{
for (int row = 0; row < ROWS; row++)
{
for (int col = 0; col < COLS; col++)
{
if (puzzle[row][col] == -1)
cout << "##### ";
else
cout << setprecision(2) << fixed << puzzle[row][col] * 100.0 << " ";
}
cout << endl;
}
}
int main()
{
//Initial probability matrix
for (int row = 0; row < ROWS; row++)
{
for (int col = 0; col < COLS; col++)
{
if (maze[row][col] == 0)
{
probs[row][col] = (1.0 / 38);
}
else
{
probs[row][col] = -1;
}
}
}
printPuzzle(probs);
cout << endl;
int s1[4] = { 0, 0, 0, 0 };
sensing(s1);
printPuzzle(probs);
cout << endl;
//1 = north
motion(1);
printPuzzle(probs);
cout << endl;
int s2[4] = { 1,0,0,0 };
sensing(s2);
printPuzzle(probs);
cout << endl;
//1 = north
motion(1);
printPuzzle(probs);
cout << endl;
int s3[4] = { 0,0,0,0 };
sensing(s3);
printPuzzle(probs);
cout << endl;
//0 = west
motion(0);
printPuzzle(probs);
cout << endl;
int s4[4] = { 0,1,0,1 };
sensing(s4);
printPuzzle(probs);
cout << endl;
//0 = west
motion(0);
printPuzzle(probs);
cout << endl;
int s5[4] = { 1,0,0,0 };
sensing(s5);
printPuzzle(probs);
cout << endl;
return 0;
}
Among one of many reasons to target the Android platform, first and foremost is cost. On average you can get an Android smartphone for a fraction of the cost of an iPhone. They may not have commensurate features, but thrift is a major component for new smartphone buyers. Next is flexibility. Developers can often find on cheap and imported Android devices a version of Google Play that is maintained by the manufacturer. Developers should develop as if they expect their app to be available to all Android devices.