1.Discussion Question: Summary & Critical Thinking

In this discussion question you have the opportunity to be creative and to relate what you have learned to your professional lives. Please explore and critically think about some of the learning objectives and concepts presented in this course. Please effectively communicate how you would lead an organization (or a group of people within the organization) by applying the knowledge you have learned ethically and responsibly. Your discussion should also include innovative thinking, and information-technology aspects (such as the Internet, social-media, computers, and so forth) that may assist you in decision-making. You may frame your discussion around any functional component of business, and in any context; problem-solving, management, leadership, organizational behavior, and so forth.

2.CLA 2 Comprehensive Learning Assessment

During this course various concepts regarding Software Engineering have been introduced.

Research the following:

1. Three (3) different processes that can be used to manage a software design project.

2. Explain the Software Lifecycle Process to include what occurs during each phase.

Your APA-formatted report should be a minimum of 6-8-pages, and include a minimum of 6 peer-reviewed or academic resources.

*Please refer to the Grading Criteria for Comprehensive Learning Assessments (CLAs) in the University Policies for specific guidelines and expectations.

Please follow these guidelines to answer:

• 7 to8-page paper (1,800-word minimum excluding title and references pages)
• APA formatted paper
• Reference at least eight (8) peer-reviewed sources beyond the course materials
• Use the textbook for research and reference it as a source with corresponding intext citations
• Avoid bulleted and numbered lists
• No lengthy direct quotes
• Be clear, well-organized, and specific
• Use paragraphs to express ideas

3.CLA2 Comprehensive Learning Assessment (CLA 2) Presentation

In addition to your CLA2 report, please prepare a professional PowerPoint presentation summarizing your findings for CLA2. The presentation will consist of your major findings, analysis, and recommendations in a concise presentation of 15 slides (minimum). You should use content from your CLA2 report as material for your PowerPoint presentation. In addition, you should include learning outcomes from all your major assignments. This would include PA1, CLA1, PA2, and of course, CLA2 (unless otherwise specified by your Professor). An agenda, executive summary, and references slides should also be included. Please keep in mind that the university is moving towards a more digital footprint for our students. This means that your final CLA2 presentation may be recorded, so that you may include it in your “e-portfolio” (graduating students should have all of their CLA2 presentations on a flash-drive, in addition to student biography, resume, interests, and so forth). Students will present their PowerPoint during the last week of class in either the On-Campus Class Session or the online Virtual Class Session, as determined by the professor. Presentations should not exceed 15 minutes.

*Please refer to the Grading Criteria for CLA2 Presentations in the University Policies for specific guidelines and expectations.

• Models based on the system Requirements
• Software Maintenance concepts.
• Reason for using Reuse Components.
• Service-Oriented Architecture.
• Real-Time Software Engineering
• Project Management
• Project Planning
• Quality and Configuration Managements

Briefly explain these concepts in CLA2 presentation slides upto 15 pages.

Using the US-Cert Advisories, during the Department Meeting on Thursday, inform the team of the latest updates and advisories from CISA.

Create a slide and send to the Manager and Lead(s)

Additional information:

Google Releases Security Updates for Chrome

Original release date: April 15, 2022

Google has released Chrome version 100.0.4896.127 for Windows, Mac, and Linux. This version addresses a vulnerability that an attacker could exploit to take control of an affected system. This vulnerability has been detected in exploits in the wild.

CISA encourages users and administrators to review the Chrome Release Note and apply the necessary updates.

This product is provided subject to this Notification and this Privacy & Use policy.

VMware Releases Security Updates for Cloud Director

Original release date: April 15, 2022

VMware has released security updates to address a remote code execution vulnerability in Cloud Director. An attacker could exploit this vulnerability to take control of an affected system.

CISA encourages users and administrators to review VMware Security Advisory VMSA-2022-0013 and apply the necessary updates.

This product is provided subject to this Notification and this Privacy & Use policy.

CISA Adds Nine Known Exploited Vulnerabilities to Catalog

Original release date: April 15, 2022

CISA has added nine new vulnerabilities to its Known Exploited Vulnerabilities Catalog, based on evidence of active exploitation. These types of vulnerabilities are a frequent attack vector for malicious cyber actors and pose significant risk to the federal enterprise. Note: to view the newly added vulnerabilities in the catalog, click on the arrow on the of the “Date Added to Catalog” column, which will sort by descending dates.

Binding Operational Directive (BOD) 22-01: Reducing the Significant Risk of Known Exploited Vulnerabilities established the Known Exploited Vulnerabilities Catalog as a living list of known CVEs that carry significant risk to the federal enterprise. BOD 22-01 requires FCEB agencies to remediate identified vulnerabilities by the due date to protect FCEB networks against active threats. See the BOD 22-01 Fact Sheet for more information.

Although BOD 22-01 only applies to FCEB agencies, CISA strongly urges all organizations to reduce their exposure to cyberattacks by prioritizing timely remediation of Catalog vulnerabilities as part of their vulnerability management practice. CISA will continue to add vulnerabilities to the Catalog that meet the meet the specified criteria.

This product is provided subject to this Notification and this Privacy & Use policy.

Instructions

For C++ Programming  you will be implementing an undirected weighted Graph ADT and performing Dijkstra’s Algorithm to find the shortest path between two vertices. Your graph can be implemented using either an adjacency list, adjacency matrix, or an incidence matrix. Your graph will implement methods that add and remove vertices, add and remove edges, and calculate the shortest path. Each vertex in your graph will have a string label that will help identify that vertex to you and the test file.

A large portion of this assignment is researching and implementing Dijkstra’s Algorithm. There is information about this algorithm in your textbook and widely available on the web.

Abstract Class Methods

void addVertex(std::string label)

Creates and adds a vertex to the graph with label. No two vertices should have the same label.

void removeVertex(std::string label)

Removes the vertex with label from the graph. Also removes the edges between that vertex and the other vertices of the graph.

void addEdge(std::string label1, std::string label2, unsigned long weight)

Adds an edge of value weight to the graph between the vertex with label1 and the vertex with label2. A vertex with label1 and a vertex with label2 must both exist, there must not already be an edge between those vertices, and a vertex cannot have an edge to itself.

void removeEdge(std::string label1, std::string label2)

Removes the edge from the graph between the vertex with label1 and the vertex with label2. A vertex with label1 and a vertex with label2 must both exist and there must be an edge between those vertices

unsigned long shortestPath(std::string startLabel, std::string endLabel, std::vector<std::string> &path)

Calculates the shortest path between the vertex with startLabel and the vertex with endLabel using Dijkstra’s Algorithm. A vector is passed into the method that stores the shortest path between the vertices. The return value is the sum of the edges between the start and end vertices on the shortest path.

Examples

Below in an example of the functionality of the implemented graph:

std::vector<std::string> vertices1 = { “1”, “2”, “3”, “4”, “5”, “6” };

std::vector<std::tuple<std::string, std::string, unsigned long>> edges1 = { {“1”, “2”, 7}, {“1”, “3”, 9}, {“1”, “6”, 14}, {“2”, “3”, 10}, {“2”, “4”, 15}, {“3”, “4”, 11}, {“3”, “6”, 2}, {“4”, “5”, 6}, {“5”, “6”, 9} };

for (const auto label : vertices1) g.addVertex(label);

for (const auto &tuple : edges1) g.addEdge(std::get<0>(tuple), std::get<1>(tuple), std::get<2>(tuple));

g.shortestPath(“1”, “5”, path); // == 20

g.shortestPath(“1”, “5”, path); // = { “1”, “3”, “6”, “5” }

Deliverables

Please submit complete projects as zipped folders. The zipped folder should contain:

• Graph.cpp (Your written Graph class)
• Graph.hpp (Your written Graph class)
• GraphBase.hpp (The provided base class)
• PP4Test.cpp (Test file)
• catch.hpp (Catch2 Header)

And any additional source and header files needed for your project.

Hints

Though it may be appealing to use an adjacency matrix, it might be simpler to complete this algorithm using an adjacency list for each vertex.

I suggest using a separate class for your edge and vertex.

Remember to write a destructor for your graphs!

I will attach the presentation from the last project later. This work needs to be 3 pages Project 2: Client Response Memo

Top of Form

Begin with a Vulnerability Scan on the Metasploitable 2 VM exactly as you did from the previous homework (steps 1-3 below). You do not have to re-do this portion if you don’t want to. The scan that you preformed from Lab 2 should have the info you need.

______________________________________________________

1. Download and setup Metasploitable 2 as a VM @

http://sourceforge.net/projects/metasploitable/files/Metasploitable2/ (Links to an external site.)Links to an external site.

2. Run Metasploitable 2 and make sure it’s connected to your VM network… might take a bit of Linux shell power. I recommend separating your Kali and Metasploitable 2 VM’s so that they can only talk to each other and are not connected to the rest of your home network. You may need to break this initially in order to update and upgrade your Kali instance.

3. Use Kali to host a network vulnerability scanning tool (OpenVAS, Nessus, Nexpose, Retina, etc) to scan the Metasploitable 2 OS for vulnerabilities. DO NOT INCLUDE any of the rest of your home network. Output the results in a format that you can submit here and evaluate for future homework. No editing required this one time. The direct output from the tool will be acceptable. Analyze the results looking for major weaknesses and potential false positives .

______________________________________________________

4. From the result from step 3, identify the SAMBA service. Alternatively, if your tool does not catch the SAMBA vulnerability, note that. You can then get this result via a simple nmap scan either external to or within Metasploit. Exploit Metasploitable 2 via a SAMBA vulnerability using Metasploit from your Kali machine.

TIP: In order to do this, you will first need to determine what version of SAMBA is running on on Metasploitable 2 (auxiliary/scanner/smb/smb_version) and then identify and appropriate vulnerability for this version. (Hint: exploit/multi/samba/usermap_script)
***YOU MUST LIST THE RESOURCE THAT YOU USED TO IDENTIFY THIS VULNERABILITY. This needs to be independent of any walkthroughs or tutorials for Metasploitable*** (exploit/multi/samba/usermap_script)

5. Demonstrate that this exploit actually gives you some level of control over the Metasploitable 2 machine via your Kali box. Showing that you can perform “root” functions would be a good example of this.

6. Create a BRIEF report showing the output from your vulnerability scan identifying the SAMBA vulnerability and showing a few screenshots with descriptions of your execution of Metasploit to exploit the vulnerability.