All posts by : chebby

1h assignment after 10 h about c++ 

Essay on what non-executives need to know regarding technology.  Especially in regard to innovation technology.  Please note some key foundational factors that non-executives need to know and understand regarding technology.  Also, note how non-IT departments interact with IT and how the change in the market will change how business is performed. 

 Your response should be 250-300 words.  

THE PROCESS

1. SELECT a domain area of research (COVID-19 related) *Please chat with me for pre-approval

2.  FORMULATE a problem statement & hypothesis. describe the problem in details you wish to explore.

3. FRAME the question(s) according to your domain

a. Understand A Business

b. Understand A Stakeholders

4. OBTAIN data for your project 

a. Describe the Data: Information about the dataset itself, e.g., the attributes and attribute types, the number of instances, your target variable. 

5. SCRUB the data, this includes cleaning and preparing the data for analytic purposes

6. ANALYZE the data, looking for patterns and insights (EDA & Analytics) *Use Jupyter Notebook

7. SUMMARIZE your findings

A vulnerability refers to a known weakness of an asset (resource) that can be exploited by one or more attackers. In other words, it is a known issue that allows an attack to succeed.

For example, when a team member resigns and you forget to disable their access to external accounts, change logins, or remove their names from company credit cards, this leaves your business open to both intentional and unintentional threats. However, most vulnerabilities are exploited by automated attackers and not a human typing on the other side of the network.

Testing for vulnerabilities is critical to ensuring the continued security of your systems. Identify the weak points.  Discuss at least four questions to ask when determining your security vulnerabilities.  

Graphs (Help! Really challenging assignment. Would appreciate any bit of help!)

Family tree’s and genealogy software has become more and more prevalent in recent years. From the name you might expect that a family tree would be easily represented by a tree structure, but that is not the case! A more appropriate data structure to represent a family tree would be a type of graph. Using the description of the family that accompanies this assignment, you must represent this family using a graph structure. The graph needs to be a weighted graph. The weights will constitute the types of relationships, I recommend using some kind mapping between numbers and strings to represent the relationships. When adding family members to the graph, this can be done programmatically for the provided family members within the description file. Additionally, I also want there to be an interface in which a user can create a new family member and add them to the tree. This can be a simple CLI where the user provides a name, gender, and age to create a person. Then another simple CLI where they select which member of the family they want the original relationship to be with and what kind of relationship it should be. Finally, they can edit the family member using another CLI and selecting the family member they wish to edit, the operation they wish to perform (edit name, edit age, edit relationship), and then add new relationship between family members which can call a function that you create in order to add the original relationship. Remember the DRY philosophy, where code can be modularized or made into a function, it should be if you plan on using the logic again.

Finally, I want you to make data assertions within the FamilyTree class that enforce certain “rules” that exist in a typical human family. An example would be a person should not have any kind of relationship to itself (a person can not marry themselves, a person can not be their own brother, sister, father, mother, etc.). There should be at least 3 data assertions. These should exists as part of the family tree, not as part of the graph.

As a hint, for a successful design: I would recommend using layers of abstraction. Your graph class is the backing structure to the family tree class. Your family tree should implement methods that interface with the graph class, i.e. add_family_member() should call the constructor to create a node and then call a function within the graph class to add a node to the graph. Then using the relationships function parameter, you can add edges to the graph between the new nodes and the existing nodes. The family tree should be what enforces what relationships can exist through the data assertions, the graph does not care about what relationships are made between family members. Your functions that the user would interface with would be greatly reduced compared to the total number of methods within the classes themselves. The user should be able to add, remove, and modify family members and that’s about it. Therefore those should be your function calls.

Submission Goals

(120 pts.) Create a FamilyTree class that will represent a family tree for a given family.
The class should contain several types of relationships that commonly happen within a family (siblings, marriage, offspring, etc.)

(40 pts.) Programmatically add the family members to the graph as described by the accompanying family description file.
(40 pts.) Give data assertions to the FamilyTree class to enforce restrictions for basic family structure (at least 3); i.e A person can not marry themselves.

(40 pts.) Provide a simple CLI the enables users to add, remove, and edit family members.

graph.py

graph = dict()

graph[‘A’] = [‘B’, ‘C’]

graph[‘B’] = [‘E’,’C’, ‘A’]

graph[‘C’] = [‘A’, ‘B’, ‘E’,’F’]

graph[‘E’] = [‘B’, ‘C’]

graph[‘F’] = [‘C’]

matrix_elements = sorted(graph.keys())

cols = rows = len(matrix_elements)  

adjacency_matrix = [[0 for x in range(rows)] for y in range(cols)]

edges_list = []

for key in matrix_elements:

    for neighbor in graph[key]:

       edges_list.append((key,neighbor))

print(edges_list)

for edge in edges_list:

        index_of_first_vertex = matrix_elements.index(edge[0])

        index_of_second_vertex = matrix_elements.index(edge[1])

        adjacency_matrix[index_of_first_vertex][index_of_second_vertex] = 1

println(adjacency_matrix)

WutherHeightsFamilyTree.docx

The Extended Families of Wuther Heights (Modified):

Family 1

Patrick Earnshaw (M) {id: 001}

Hannah Earnshaw (F) {id: 002}

Relationship: Married

Children:

Catherine Earnshaw (F) {id: 003}

Hindley Earnshaw (M) {id: 004}

Family 2

Andrew Linton (M) {id: 005}

Dolores Linton (F) {id: 006}

Relationship: Divorced

Children:

Isabella Linton (F) {id: 007}

Edgar Linton (M) {id: 008}

            Heathcliff Linton (M) [Adopted] {id: 009}

Family 3

            Hindley Earnshaw (M) {id: 004}

            Frances Byler (M) {id: 010}

            Relationship: Married

            Children:

                        Hareton Earnshaw (M) [Adopted] {id: 011}

Family 4

            Catherine Earnshaw (F) {id: 003}

            Edgar Linton (M) {id: 008}

            Relationship: Married

            Children:

                        Cathy Linton (F) {id: 012}

Family 5

            Isabella Linton (F) {id: 007}

            Children:

                        Linton Heathcliff (M) {id: 013}

Family 6

            Heathcliff Linton (M) {id: 009}

            Children:

                        Linton Heathcliff (M) {id: 013}

Family 7

            Hareton Earnshaw (M) {id: 011}

            Cathy Linton (F) {id: 012}

            Relationship: Married

Family 8

            Cathy Linton (F) {id: 012}

            Linton Heathcliff (M) {id: 013}

            Relationship: Divorced

Please follow the steps on the screenshots then write the code in the R file

Question 1: Let G = (V,E) be an undirected graph and s and t be the source and target nodes. Give an efficient algorithm to determine whether the number of minimum s − t cuts in G is at most two. Analyse your algorithm and provide its complexity.

Question 2: Suppose that X is a 2×1 matrix and Y is a 1×2 matrix. Prove that XY is not invertible.

Question 3: Let G = (V,E) be an undirected bipartite graph with parts AandB(V =A∪B,A∩B=∅)andthereisnoedgewithbothendpointsin A or both endpoints in B). Also, let X and Y be two sets of vertices such that X ⊆ A and Y ⊆ B. Suppose that G has two matchings M1 and M2 such that M1 covers all vertices in X and M2 covers all vertices in Y . Prove that G has a matching M such that M covers all vertices in X and Y . (A matching covers a vertex if one of the edges of the matching has that vertex as an endpoint.)

Question 4: Provide a linear program for the following problem:

A factory produces Aluminium plates of a standard width 3meters. But cus- tomers want to buy plates of shorter widths. So, the factory has to cut original 3m plates. One 3m plate can be cut, for instance, into two plates of 93cm width, one plate of width 108cm, and a rest of 6cm (which goes to waste). Suppose that we have the following orders:

• 97 plates of width 135cm • 610 plates of width 108cm

• 395 plates of width 94cm

• 211 plates of width 43cm.

What is the smallest number of 3m plates that have to be cut in order to satisfy this order? how should they be cut? (Hint: there are 12 different ways of cutting a plate into useful subpieces; you’ll need to figure them all out.)

 Discussion #1: Compare the IoT with regular Internet.

 Discussion #2: Discuss the potential impact of autonomous vehicles on our lives. 

 Discussion #3: Research Apple Home Pod. How does it interact with smart home devices?  Alexa is now connected to smart home devices such as thermostats and microwaves. Find examples of other appliances that are connected to Alexa and write a report. 

This assignment provides you an opportunity to practice

• writing programs using Button, FlowPane, Stage and Scene.
• writing programs using Font and Text classes, Text methods, Stage and Scene.
• writing programs using ImageView, Button, Pane, Stage and Scene classes, and how to create and register event handler.

Directions

Please solve three (3) programming problems related to the content presented in Chapters 14 and 15 in your text. You can find the programming problems in the attached file (Module 7 Programming Problems Worksheet.docx (Links to an external site.)). For Programming Problem 3, you will need the card files (card.zip (Links to an external site.)).

• Download the worksheet and save it as Mod7-Worksheet-Programming-Last-First.docx. For example, Mod7-Worksheet-Programming-Smith-John.docx.
• Consider the problem, design an algorithm (or algorithms) that would solve the problem, and then implement the algorithm in Java.
• Create a new folder and name it as Mod7-Java-Programming-Last-First, for example, Mod7-Java-Programming-Smith-John.
• Write the source code for each problem and save them as .java files in the folder you created. There are three programming problems for this module so you should have three .java files. Name your java files as Mod7Problem#.java, for example, Mod7Problem1.java.
• Copy data file(s) used for your program and/or output file into the folder. In this module, make sure to include image files/folder in the folder.
• Please insert the algorithm written in pseudocode as a comment in the beginning of your program.
• Take screenshots of your running program – you can take screenshots using PrintScreen or any tool that you are familiar with, making sure that the console window in which you run the program appears on the screen.
• Copy the screenshots in the worksheet. If your program has different outcomes, take screenshots of each variation.

Submission

• Compress the folder that saves all of your java files as .zip file. Please note don’t save the worksheet in the same folder as they need to be submitted seperately.
• Submit the following two files as attachments by clicking the Submit Assignment button above.
  • Mod7-Java-Programming-Last-First.zip (including .java files, data files, and image files/folder).
  • Mod7-Worksheet-Programming-Last-First.docx.