Tag: Programming

The scenario you will read is not uncommon and it underscores the dilemma faced in the workplace when emotions and values collide with confidentiality protocols established in the workplace. 

You are hired by TGH to produce adhoc reports.  This requires matching an existing file of patient visits with patient master records.  In reviewing the data, a name stands out on the report and you quickly realize it is someone you know — your best  friend’s father.  The son and father relationship has been strained and neither has spoken to each other in almost a year.     Your friend has no clue his father is dying and now you have the report in your hands that confirms this  grim reality.   What do you do?

You know the consequences of violating the company’s patient confidentiality policy but this is your best friend’s father! Should you tell your friend?  Should you ignore it?   When does your loyalty to your friend take precedence over your employer’s strict patient confidentiality policy?  How would you handle the conflict? 

I have completed the paper but I need the red highlighted portion to be changed/ rewritten. I am swamped with other papers and I am overwhelmed at this point.

IT Consulting Proposal

For this assignment, assume you have been hired by Kris Corporation as an Information Technology consultant. Kris Corporation manufacturers parts for the automotive industry. Your job is to submit a proposal that meets their criteria (listed below) based on information provided. You may fill in any gaps in the specifications provided by making assumptions. All assumptions should be clearly identified.

Current Implementation and Concerns:

• Parent domain (kris.local) and child domain (corp.kris.local) for the organization’s AD infrastructure are running on Server 2012. The upgrade to AD is Server 2016. The following are concerns related to AD: (1) Kris Corporation is concerned about running multiple domain, and (2) automobile manufacturers are asking Kris Corporation to use single identity to procure orders in real time.
• The company has five locations: Atlanta (GA), Baltimore (MD), Chicago (IL), Seattle (WA) and San Diego (CA). The manufacturing plants are in Atlanta and Seattle.
• Disaster recovery is a big concern.
• Physical space for servers is an issue at the Atlanta location.
• Most of the IT staff is in Atlanta, which is the company’s headquarters, but other locations have significant IT personnel as well. Business personnel are similarly distributed across the company’s locations.
• Since all locations are independently connected to the internet, file sharing is difficult among sites.

Your document should integrate the content presented in the course. The outline below provides required points to cover. You are free to add other related information.

Describe the technical and business reasons for each choice, citing other resources as appropriate. The Windows Server 2012 operating system should be used for all aspects of the solution. Each choice should be explained with technical and business reasoning. Solutions should be reasonably detailed.

Your solution should cover the following five numbered areas and associated bulleted items listed under each.

1. Active Directory

• Why and how should the company migrate to 2016 AD?
• Should the company remain at multi-domain model or migrate to single domain?
• What technology can provide single sign on? How will it be configured?

1. DNS

• Where should DNS servers reside?
• What kind of DNS security can the DNS servers leverage?

1. DHCP

• Will a form of DHCP fault tolerance be implemented?
• How can DHCP addresses be tracked?

1. Hyper-V

• Evaluate the pros and cons of implanting Hyper-V. Would it need clustering?
• What features of Hyper-V can Kris Corporation leverage?

1. Routing/Security

• How can Kris Corporation improve its networking capabilities in terms of file sharing and security?

Submission Requirements:

• The final submission should provide 8-10 pages in length (not counting title page, images, diagrams, tables, or quotations).
• Support your proposed solution by citing and integrating at least one credible source that is not uCertify and not Wikipedia. Recommended sources include a best practice guide or reference from Microsoft, or an experienced provider of Microsoft solutions.
• At least one diagram must be included (not counted toward the minimum length described above). You may include more.
• Use terms, evidence, and concepts from class readings.
• Your paper must be formatted according to CSU Global Writing Center (Links to an external site.).

CSS:

1) What best describes the difference between these two selectors: #myElement & .myElement *

A)The first selector is an ID and the second is a class

B)The second should only be used once

C)#myElement & .myElement do the same thing

D)The second selector is not a css selector

2) Which is an example of grouped selectors?

A)div .myClass

B)h1, h2, p

C)div > .myClass

D)div > div > #myId

3)What is true of an element with the CSS property display set to inline? *

A)An inline element only takes up as much width as necessary

B)An inline element starts on a new line

C)An inline element takes up as much width as possbile

D)An inline element must be displayed inside of another inline element

4)Which of these options correctly describes the behavior of the CSS properties margin & padding? *

A)padding is inside the border & margin is outside the border

B)margin is above & below the element, while padding is to the left and right of the element

C)padding is outside the border & margin is inside the border

D)padding is above & below the element, while margin is to the left and right of the element

5)Which selector correctly selects all p tags inside of a div tag?

A)div p

B)div > p

C)div + p

D)div ~ p

F)div .p

E)div .all p

HTML

6)Which element(s) can exist inside of a block level element? Select all that apply *

A)<div></div>

B)<article></article>

C)<dialog></dialog>

D)<mark></mark>

E)<summary></summary>

7)Which option best answers the following? valid attribute for any element *

A)id

B)class

C)title

D)data-*

E)all of the above

8)What is the valid way of commenting out this line of HTML code? <div></div> *

A)<!– <div></div> –>

B)/** <div></div> **/

C)“` <div></div>

D)// <div></div>

E) none of the above

9)Which elements are block level elements? Choose all that are correct *

A)<div></div>

B)<a></a>

C)<p></p>

D)<span></span>

E)<h1></h1>

10)Which statement(s) are true about forms & form elements? *

A)Radio buttons let a user select ONE of a limited number of choices

B)<input type=”text”> defines a one-line input field for text input

C)<input type=”submit”> defines a button for submitting a form to a form-handler

D)When a form is submitted, each input element’s value will be associated with its id attribute

E)The <li> element defines a drop-down list

APPLY:

GET A DATA SET OF MIXED CATEGORICAL AND NUMERIC ATTRIBUTES

MISSING DATA HANDLING METHODS

APPLY CATEGORICAL ENCODING TECHNIQUES

APPLY NORMALIZATION

APPLY REGULARIZATION

APPLY REGRESSION OR CLASSIFICATION FOR PREDICTION[DEPENDS ON YOUR DATSET]

SUBMIT DOC OR PDF FILE, INCLUDE 3 PAGES OF EXPLANATION WHAT YOU DID THROUGHOUT THIS WORK.

I’m working on a programming question and need an explanation and answer to help me learn.

Disaster Recovery Plan

You have been hired to prepare a disaster recovery plan (DRP) for an organization located in the United States. This company is midsized and has good local redundancy but no cloud presence yet. Discuss some steps IT administrators can take to achieve fault tolerance taking into consideration any layout concerns and potential threats. Also, discuss one to two mitigation strategies for these potential issues.

Implement Dijkstra’s algorithm to find a minimum weight path between two vertices in a graph. Specifications of the program:

Input: The input graph is given in a file in the following format: the first line contains just the number of vertices (which are assumed to be labeled with the numbers 1 up to the number of vertices), the second line contains two vertices between which we want to find a minimum weight path (from the first to the second!), and then the edges are listed by specifying the two endpoints and the corresponding weight of the edge (each line contains info about one edge, you may assume that the graph has no loops or multiple edges).

Output: The program should print into a file the vertices in the order they are explored (starting with the first vertex). At the end, it should print the path of minimum weight it found between the two vertices or state that there is no such path (if the two vertices lie in different components)

Make a source code of the program as a simple text file and the resulting outputs for the given sample inputs. In addition, e-mail me documentation of the program (this may partially be in the source code), explaining the data structures and the main variables.

In this project, you will develop algorithms that find road routes through the bridges to travel between islands.

The input is a text file containing data about the given map. Each file begins with the number of rows and columns in the map considered as maximum latitudes and maximum longitudes respectively on the map. The character “X” in the file represents the water that means if a cell contains “X” then the traveler is not allowed to occupy that cell as this car is not drivable on water. The character “0” in the file represents the road connected island. That means if a cell contains “0” then the traveler is allowed to occupy that cell as this car can drive on roads.

The traveler starts at the island located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper left corner, and the goal is to drive to the island located at (MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal move from an island is to move left, right, up, or down to an immediately adjacent cell that has road connectivity which means a cell that contains “0”. Moving off any edge of the map is not allowed.

Input: The map files

Output: Print paths as explicitly specified for all the functions in Part A, Part B, and extra credit on the console.

You should have single main function that calls all the required functions for Part A, Part B, and extra credit for all the 3 given input map files one by one.

Coded graph.h file for your reference and provided it for you to refer to and download on canvas. You do not have to use this file mandatory, but if you are struggling to even start the project then this should definitely make your life much easier.

Part A

Consider the following class map,

{

public:

map(ifstream &fin);

void print(int,int,int,int);

bool isLegal(int i, int j);

void setMap(int i, int j, int n);

int getMap(int i, int j) const;

int getReverseMapI(int n) const;

int getReverseMapJ(int n) const;

void mapToGraph(graph &g);

bool findPathRecursive(graph &g, stack<int> &moves);

bool findPathNonRecursive1(graph &g, stack<int> &moves);

bool findPathNonRecursive2(graph &g, queue<int> &moves);

bool findShortestPath1(graph &g, stack<int> &bestMoves);

bool findShortestPath2(graph &, vector<int> &bestMoves);

void map::printPath(stack<int> &s);

int numRows(){return rows;};

int numCols(){return cols;};

private:

int rows; // number of latitudes/rows in the map

int cols; // number of longitudes/columns in the map

matrix<bool> value;

matrix<int> mapping; // Mapping from latitude and longitude co-ordinates (i,j) values to node index values

vector<int> reverseMapI; // Mapping from node index values to map latitude i value

vector<int> reverseMapJ; // Mapping from node index values to map longitude j value

};

1. Using the above class map, write function void map::mapToGraph(graph &g){…} to create a graph g that represents the legal moves in the map m. Each vertex should represent a cell, and each edge should represent a legal move between adjacent cells.

2. Write a recursive function findPathRecursive(graph &g, stack<int> &moves) that looks for a path from the start island to the destination island. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, “No path exists”. If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. The map::print() function prints out a map visualization, with the goal and current position of the car in the map at each move, marked to show the progress. Hint: consider recursive-DFS.

3. Write a function findPathNonRecursive1(graph &g, stack<int> &moves) that does the same thing as in 2, but by using stack and without using recursion. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, “No path exists”. If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. The map::print() function prints out a map visualization, with the goal and current position of the car in the map at each move, marked to show the progress. Hint: consider stack-based DFS.

4. Write a function findPathNonRecursive2(graph &g, queue<int> &moves) that does the same thing as in 2, but by using queue and without using recursion. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, “No path exists”. If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. The map::print() function prints out a map visualization, with the goal and current position of the car in the map at each move, marked to show the progress. Hint: consider queue-based BFS.

The code you submit should apply all three findPath functions to each map, one after the other.

The map input files named map1.txt, map2.txt, and map3.txt can be downloaded from the canvas. Example of a map input file:

7
10
Start – 0XXXXXXXXX
00000000XX
0X0X0X0XXX
0X0X0X0000
XX0XXX0XXX
X0000000XX
XXXXXXX000Z – Destination

Part B

The shortest path on a map is a path from the start to the destination with the smallest number of intermediate islands, that is the path with the least number of intermediate “0”.

1. Write two functions findShortestPath1(graph &g, stack<int> &bestMoves) and findShortestPath2(graph &g, stack<int> &bestMoves) that each finds the shortest path on a map if a path from the start to the destination exists. The first algorithm should use Dijkstra algorithm and the second algorithm should use Bellman-Ford algorithm to find the shortest paths. In each case, if a solution exists the solver should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, “No path exists”. If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. The map::print() function prints out a map visualization, with the goal and current position of the car in the map at each move, marked to show the progress. Each function should return true if any paths are found, and false otherwise.

Note: The use of the additional functions of class map is optional but highly recommended.

Extra Credit

1. Optimize Bellman-Ford algorithm to reduce the number of iterations and compare the runtime of the unmodified and modified algorithm for three given input maps. Your optimized Bellman-Ford algorithm should call map::print() function. It should also print the runtime of the unoptimized and optimized versions.

Thus, You should submit a single zip folder within which you need to have 4 files including, 1) a single “.cpp” code file that includes all the above-required functions called from a single main function, 2) a single “.h” header file, 3) README file with the compile and execution instructions, and 4) your pre-compiled “.exe” executable file. On top of your .cpp code file, .h header file, and README file, you need to mention your name as comments. You may have an additional PDF file if you want to narrate your additional observations about running the functions of this project, e.g., drawing the graph to compare the runtime and explain the results. All submitted code files must be named as “<your-name>.cpp”. For example, it will be “jankibhimani.cpp”, “jankibhimani_graph.h”, and “jankibhimani.exe”. The zip folder containing all the files should be named as “<your-name>_code.zip”. For example, it will be “jankibhimani_code.zip”. Please follow the “Guidelines for Software Engineering Techniques.pdf” and “Assignments and Project Style and Documentation Guidelines.pdf” made available to you in your Student Resources module for other document editing and code format guidelines.

Some header files you may need are following, that can be found in you header files zip folder available to you to download on Canvas.

#include <limits.h>

#include “d_except.h”

#include <list>

#include <fstream>

#include “d_matrix.h”

#include <queue>

#include <vector>

/**

* Lab Test problem on binary search trees.

*

*/

public class BinarySearchTreeLabTest {

/** Provides an example. */

public static void main(String[] args) {

BinarySearchTree<Integer> iBst = new BinarySearchTree<>();

iBst.add(10);

iBst.add(12);

iBst.add(8);

iBst.add(2);

iBst.add(6);

iBst.add(4);

int depth = iBst.depth(7);

// The following statement should print -1.

System.out.println(depth);

depth = iBst.depth(10);

// The following statement should print 1.

System.out.println(depth);

depth = iBst.depth(6);

// The following statement should print 4.

System.out.println(depth);

BinarySearchTree<String> sBst = new BinarySearchTree<>();

sBst.add(“W”);

sBst.add(“A”);

sBst.add(“R”);

sBst.add(“E”);

sBst.add(“A”);

sBst.add(“G”);

sBst.add(“L”);

sBst.add(“E”);

depth = sBst.depth(“W”);

// The following statement should print 1.

System.out.println(depth);

depth = sBst.depth(“A”);

// The following statement should print 2.

System.out.println(depth);

depth = sBst.depth(“G”);

// The following statement should print 5.

System.out.println(depth);

}

/** Defines a binary search tree. */

static class BinarySearchTree<T extends Comparable<T>> {

// the root of this binary search tree

private Node root;

// the number of nodes in this binary search tree

private int size;

/** Defines the node structure for this binary search tree. */

private class Node {

T element;

Node left;

Node right;

/** Constructs a node containing the given element. */

public Node(T elem) {

element = elem;

left = null;

right = null;

}

}

/* >>>>>>>>>>>>>>>>>> YOUR WORK STARTS HERE <<<<<<<<<<<<<<<< */

///////////////////////////////////////////////////////////////////////////////

// I M P L E M E N T T H E D E P T H M E T H O D B E L O W //

///////////////////////////////////////////////////////////////////////////////

/**

* Returns the depth of the node containing value

* or -1 if value not present.

*/

public int depth(T value) {

}

/* >>>>>>>>>>>>>>>>>> YOUR WORK ENDS HERE <<<<<<<<<<<<<<<< */

////////////////////////////////////////////////////////////////////

// D O N O T M O D I F Y B E L O W T H I S P O I N T //

////////////////////////////////////////////////////////////////////

////////////////////

// M E T R I C S //

////////////////////

/**

* Returns the number of elements in this bst.

*/

public int size() {

return size;

}

/**

* Returns true if this bst is empty, false otherwise.

*/

public boolean isEmpty() {

return size == 0;

}

/**

* Returns the height of this bst.

*/

public int height() {

return height(root);

}

/**

* Returns the height of node n in this bst.

*/

private int height(Node n) {

if (n == null) {

return 0;

}

int leftHeight = height(n.left);

int rightHeight = height(n.right);

return 1 + Math.max(leftHeight, rightHeight);

}

////////////////////////////////////

// A D D I N G E L E M E N T S //

////////////////////////////////////

/**

* Ensures this bst contains the specified element. Uses an iterative implementation.

*/

public void add(T element) {

// special case if empty

if (root == null) {

root = new Node(element);

size++;

return;

}

// find where this element should be in the tree

Node n = root;

Node parent = null;

int cmp = 0;

while (n != null) {

parent = n;

cmp = element.compareTo(parent.element);

if (cmp == 0) {

// don’t add a duplicate

return;

} else if (cmp < 0) {

n = n.left;

} else {

n = n.right;

}

}

// add element to the appropriate empty subtree of parent

if (cmp < 0) {

parent.left = new Node(element);

} else {

parent.right = new Node(element);

}

size++;

}

}

}

INSTRUCTIONS:

1. Read through all the provided source code to make sure that you understand the context. A class named BinarySearchTree with an add method plus various utility methods is provided for you. You must not change any provided method with a body that is already complete. Note that linked nodes are used to implement the BinarySearchTree class. Note also that the data type allowed in the BinarySearchTree is constrained to be a class that implements the Comparable interface and thus has a natural total order defined.
2. The depth method of the BinarySearchTree class currently has no body. You must provide a correct body for the depth method.
3. A sample main method is provided to illustrate building a simple binary search tree and then using the depth method for particular values.