20
20210317
Question 1:
1). Using the Web or other resources, write a brief paper about RSA, its history, its methodology, and where it is used.
2). Send a brief message (ten words minimum) using the Caesar Cypher.
Note your safe assign score. Score should be less than 25
IT 345 week 6 A
A Week 6 Discussion
This week we will explore two separate but important topics, cyber-crimes and how technology impacts businesses/employees. As technology evolves, so do the ways it can be exploited. Furthermore, as businesses become more dependent on technology, they must ensure how it impacts their employees.
Pick a topic below and post your reply by Wednesday at midnight. Your response should be at least 500 words and appropriately cites your resources.
Respond to two of your classmates by Sunday at midnight. Your responses should be at least 200 words and should be substantive. You should offer additional resources, insight, or other helpful feedback. A simple “I like your post” will result in a 0.
You will not be able to see your classmates’ posts until you make your first post.
Note: plagiarism is not tolerated in this course. Everything must be in your own words with sources! Failure to do so will result in failing grade.
Discussion_Grading_Rubric_Final (2).docx download
Grading_Late_Discussion-1 (3).docx download
Topics:
- What jobs have been eliminated due to technology? What jobs have been created?
- Do automated systems mean fewer jobs for high-skilled workers?
- Would you want to telecommute? Why or why not? Is it a viable solution for all employers?
- Is hacking that does no direct damage a victimless crime? Give an example to support your case
excel capstone 2 Summer Revene
Excel_Comprehensive_Capstone2_Summer_Revenue
Project Description:
In this project, you will apply skills you practiced from the objectives in Excel Chapters 4 through 10. You will develop a workbook for Frank Osei, the Vice President of Finance, that includes financial information and analysis regarding summer product revenue.
Steps to Perform:
Step
Instructions
1
Open the Excel file Student_Excel_Comp_Cap2_Summer_Revenue.xlsx downloaded with this project.
2
On the Maine Store worksheet, in the range B9:B16, use the Fill Series feature to enter interest rates beginning with 8.00%. Decrease the amounts by .50% ending with 4.50%. Format the rates as Percent Style with two decimal places and apply bold and center.
3
In cell B8, enter a PMT function using the information in the range B2:B4 to calculate a monthly payment. Be sure that the result displays as a positive number.
4
In cells B8:H16, create a Data Table using the information in cells B2:B4 where the row input cell is the Period and the column input cell is the rate. Apply the format in B8 to the results in the data table, and then AutoFit columns C:H. Format the payment option closest to and less than $10,000 per month with the Note cell style. Change the Orientation to Landscape.
5
On the Quarterly Apparel Costs worksheet, apply the Currency [0] cell style to the range B6:E6. Apply the Comma [0] cell style to the range B7:E17. To the range B18:E18, apply the Currency [0] and Total cell styles.
6
Name the ranges B6:E10 Swim_Costs; B11:E14 Shirt_Costs; B15:E16 Jacket_Costs; and B17:E17 Hats_Costs.
7
Insert a new row 15. In cell A15, type Go Explore Shirts. In cell B15, type 9500. In cell C15, type 9695. In cell D15, type 8315. In cell E15, type 9275. Display the Name Manager, and then edit the Shirt_Costs name to include row 15. Select Hats_Costs, and edit the name to Headwear_Costs. (Mac users, click Define Name and make edits using the Define Name dialog box.)
8
Click cell B19. On the Formulas tab, in the Formula Auditing group, click Error Checking, and then select Update Formula to Include Cells. Use the fill handle to copy the corrected formula from cell B19 across through cell E19.
9
On the Quarterly Apparel Costs worksheet, in cell B25, insert a SUM function to sum the Swim_Costs named range, using the name in the formula. Create similar formulas in the range B26:B28, being sure to use the range name in each formula. In B29, calculate a total, and then apply the apply Currency [0] and Total cell style. Apply the Currency [0] style to cell B25 and apply the Comma [0] style to the range B26:B28. Save the workbook.
10
On the Quarterly Apparel Costs worksheet, record a Macro using the name Sheet_Title and the Shortcut key CTRL+j. (Mac users, use Option+Command+j). Store the Macro in the workbook, and as the Description, type Report heading. Click cell A1, type Front Range Action Sports and then press CTRL+ENTER. Merge and center the text across the range A1:E1, and then apply the Title cell style. In cell A2, type Apparel Costs, and then press CTRL+ENTER. Merge and Center the text across the range A2:E2, and then apply the Heading 1 cell style. Click cell A1, and then stop recording the macro. Delete the text in A1:A2, and then test the macro.
11
Edit the Sheet_Title macro to display the Visual Basic Editor. Select and copy all of the code, close the Visual Basic Editor window, and then paste the code in cell A32. Display the worksheet in Page Break Preview. Move the page break to position it between rows 30 and 31 so that the VBA code displays on Page 2. Return to Normal View and save the file as a macro-free workbook.
12
On the Product Information worksheet, select the range A4:C9, and then sort the data by Style Code in ascending order. Select the range A5:C9 and then name the selection Lookup_Table.
13
On the Phone Order worksheet, in cell A9, type C-SW and then press TAB. In cell B9, use a VLOOKUP function to lookup the Item in cell A9 and insert the description from the Product Information worksheet using the Lookup_Table range as the table array. The description is in column 2 of the table array. Fill the formula down through B18. In cell C9, type 12 and in cell D9, type Blue and then press TAB.
14
In cell E9, use the VLOOKUP function to insert the unit price of the item in cell A9 using the Lookup_Table range as the table array. The unit price is in column 3 of the table array. Fill the formula down through E18.
15
In cell A10, type W-RR and in C10 type 12. In cell D10 type Yellow and then delete rows 11:18. Sum the Order Amount and apply the Total cell style.
16
On the Summer Attendance worksheet, in the range G4:G8, insert Line Sparklines to show the attendance trend for each event over the five-year period. Show the High Point and Low Point.
17
Insert a Line with Markers Chart using the ranges A3:F3 and A6:F6. Reposition the chart so that its upper left corner is in A11 and the lower right corner is in F25. Edit the Chart Title to Attendance at Event Live Arizona. Edit the Vertical (Value) Axis to set the Minimum to 6000 and then format the chart using Style 4.
18
On the Expense Report worksheet, in the range H15:H21, create formulas to sum the data in each row, not including Date and Description. In cell H22, enter a formula to sum the total expenses. Apply Accounting Number Format to the ranges C15:H15 and C21:H21. Apply Comma Style to the range C16:H20. In cell H22 apply Accounting Number Format and the Total cell style.
19
Select the ranges D8:F12 and A15:G21 and format the cells so that when the sheet is protected, the selected ranges are not locked. Protect the sheet and be sure the top check box to protect the worksheet and the first two check boxes in the list are selected. Enter the password go.
20
On the Summer Program Revenue sheet, in cell B4, create a DAVERAGE function to calculate the average of the Amount field for the Lessons category. The Criteria range has been set up for you in the range A3:A4. In cell C4, create a DSUM to calculate the total of the Amount field for the Lessons category. Format the range B4:C4 using Accounting Number Format.
21
In the Summer Program Revenue sheet, click cell A9, and then insert the Recommended PivotTable Sum of Amount by Location in a new worksheet. Rename the worksheet PivotTable and Chart. Use the Month field as the report filter. Use the Location field as the row labels and the Item field as the column labels. Format the values in the PivotTable using the Number category with zero decimal places and the 1000 separator.
discussion
- Are protections for Data In Process more likely to be found in an application or an operating system?
- 250 word minimum (-5 if not)
- At least one reference (APA style) (-5 if not one or more)
Data structure and alogorithm
Objectives
Assignment 09: Applications of Stacks
COSC 2336: Data Structures and Algorithms Fall 2020
• More practice with recursion.
• Practice writing some template functions.
• Use stack ADT to implement given algorithms.
• Practice using Stack class container given as a library in a separate file. • Look at some common applications of stacks.
Description
In this assignment, you will be using the Stack abstract data type we developed for this unit and discussed in our lectures, to implement 4 functions that use a stack data type to accomplish their algorithms. The functions range from relatively simple, straight forward use of a stack, to a bit more complex. But in all 4 cases, you should only need to use the abstract stack interface functions push(), pop(), top(), and isEmpty() in order to successfully use our Stack type for this assignment and the function you are asked to write.
NOTE You are to use the Stack ADT abstraction give to you for this assignment. If you are familiar with STL stack containers, you are not to use them for this assignment. Part of the assignment is to look over and learn the Stack ADT implementation we give you here based on our textbook Stack examples.
Setup
For this assignment you will be given the following files:
File Name
assg09-tests.cpp assg09-stackfun.hpp assg09-stackfun.cpp Stack.hpp
Stack.cpp
Description
Unit tests for the member functions
you are to write.
Header file where function prototypes for the functions you write using stacks should go. Implementaiton file, the implementation of the 4 functions you write for this assignment go here. Header file defining a Stack ADT for use in implementing the functions for this assignment. You will not make any modifications in this file, you are only going to be using the given Stack. Implementation file for the Stack ADT
template class. You also do not make any changes in this file either.
Set up a multi-file project to compile the .cpp source files and run them as shown for the class. The Makefile you were given should be usable to create a build project using the Atom editor as required in this class. You will only be adding code to the assg09-stackfun.[hpp|cpp] file in this assignment. The Stack.[hpp|cpp] file contains a Stack container. You are to use this Stack ADT for the 4 functions you are to write for this assignment.
1
The general approach you should take for this assignment, and all assignment is:
- Set up your project with the given starting code. The files should compile and run, but either no tests will be run, or tests will run but be failing.
- For this project, start by uncommenting the first TEST_CASE in the assg09-tests.cpp file. These are the unit tests to test the functionality of your doParenthesisMatch() function, the member function you are to implement.
- AddthecorrectfunctionprototypeforthedoParenthesisMatch()memberfunctionintheassg09-stackfun.hpp header file. The prototype consists of the name of the function, its input parameters and their types, and the return value of the function.
- Add a stub for your doParenthesisMatch() member function to the assg09-stackfun.cpp implementation file. The function should have the same signature as the prototype you gave in the header file. Documentation for the function has not been given for you this time, so add documentation of your function first. This function is supposed to return a bool result, so you should just initially return true so you can get your code to compile.
- Your code should compile and run now. Make sure after adding the function prototype and stub your code compiles and runs. However, your unit tests will be failing initially.
- Incrementally implement the functionality of your doParenthesisMatch() member function. You should try to add no more than 2 or 3 lines of code, and then make sure your program still compiles and runs. Start by adding code to get the first failing test to pass. Then once that test passes, move on to the next failing tests until you have all tests passing. If you write something that causes a previously passing test to fail, you should stop and figure out why, and either fix it so that the original test still passes, or remove what you did and try a new approach.
- Once you have the doParenthesisMatch() member function implemented and all unit tests passing, you should then move on to the other functions in the order suggested. Some functions use previous ones in this assignment, so do them in the order given for you in the tasks below.
Tasks
You should set up your project/code as described in the previous section. In this section we give some more details on implementing the member functions for this assignment. You should perform the following tasks for this assignment:
1. In the first task, we will write a function that will check if a string of parenthesis is matching. Strings will be given to the function of the format “(()((())))”, using only opening “(” and closing “)”. Your function should be named doParenthesisMatch(). It takes a single string as input, and it returns a boolean result of true if the parenthesis match, and false otherwise.
The algorithm to check for matching parenthesis using a stack is fairly simple. A pseudo-code description might be
for each charcter c in expression
do
if c is an open paren '('
push it on stack
if c is a close paren ')':
then
if stack is empty
answer is false, because we can't match the current ')'
else
pop stack, because we just matched an open '(' with a close ')'
endif done
Your function will be given a C++ string class as input. It is relatively simple to parse each character of a C++ string. Here is an example for loop to do this:
2
s = “(())”;
for (size_t index = 0; index < s.length(); index++) {
char c = s[index];
// handle char c of the string expression s here
}
2. In the next task, we will also write a function that decodes a string expression. Given a sequence consisting of ‘I’ and ‘D’ characters, where ‘I’ denotes increasing and ‘D’ denotes decreasing, decode the given sequence to
construct a “minimum number” without repeated digits.
An example of some inputs and outputs will make it clear what is meant by a “minimal number”.
sequence IIII -> DDDD -> ID -> IDIDII -> IIDDIDID ->
output
12345
54321
132
1325467
125437698
If you are given 4 characters in the input sequence, the result will be a number with 5 characters, and further only the digits ‘12345’ would be in the “minimal number” output. Each ‘I’ and ‘D’ in the input denotes that the next digit in the output should go up (increase) or go down (decrease) respectively. As you can see for the input sequence “IDI” you have to accommodate the sequence, thus the output goes from 1 to 3 for the initial increase, because in order to then decrease, and also only use the digits ‘123’, we need 3 for the second digit so the third can decrease to 2.
Take a moment to think how you might write an algorithm to solve this problem? It may be difficult to think of any solution involving a simple iterative loop (though a recursive function is not too difficult).
However, the algorithm is relatively simple if we use a stack. Here is the pseudo-code:
for each index, character c in input sequence
do
push character index+1 onto stack (given 0 based index in C)
if we have processed all characters or c == ‘I’ (an increase) then
pop each index from stack and append it to the end of result
endif
done
Your function should be named decodeIDSequence(). It will take a string of input sequence, like “IDI” as input, and it will return a string type, the resulting minimal number. Notice we will be constructing a string to return here, so simply start with an empty string string result = “” and append the digits to the end when you pop them from the stack as described.
3. In the third task, you will write two functions that will be able to sort a stack. First of all, you should write a simpler method that, given an already sorted stack as input, and an item of the same type as the stack type, the item should be inserted into the correct position on the sorted stack to keep it sorted. For example, the stacks will be sorted in ascending order, where the item at the bottom of the stack is the smallest value, and the item at the top is the largest, like this:
top: 8 7 5 3 1 :bottom
If we call the function to insert a 4 into this sorted stack, the result should be:
top: 8 7 5 4 3 1
Your function should be called insertItemOnSortedStack(). This function takes an item as its first parameter, and a reference to a Stack as its second parameter. You should create and use another temporary stack in your function in order to accomplish the task. The pseudo-code to accomplish this insertion is relatively simple:
3
given inputStack
and create temporaryStack for this algorithm
while top of inputStack > item we want to insert
do
pop topItem from inputStack
push topItem onto the temporaryStack
done
at this point, items on inputStack are <= to the item we want to insert so push item onto inputStack
now put items back from temporaryStack to original inputStack
while temporaryStack is not empty
do
pop topItem from temporaryStack
push topItem onto the inputStack
done
The tests given for the insert function use an AStack
template <class T>
before the function, and change the
work and pass the tests using an
4. Once you have your insertItemOnSortedStack() template function working, it is even easier to use this function to create a sortStack() function. We could implement this function again using a temporary stack, but for this fourth and final function I want you instead to create a recursive function. A recursive function in this case is going to work in essentially the same way, but we will be using the OS/system function call stack implicitly to perform the algorithm, rather than explicitly creating and using our own temporary stack.
Create a function called sortStack(). This function should take a Stack
The function, as the name implies, will take an unsorted stack, and will sort them in the same order we used previously, e.g. in ascending order with the smallest item at the bottom of the stack, and the largest at the top. The pseudo-code to accomplish this using a recursive algorithm is as follows:
given inputStack as an input parameter
# the base case
if inputStack is empty, do nothing (return)
# the general case
take top item from inputStack and save it in a local variable
call sortStack(inputStack) recursively on this now smaller stack
# on return, the stack should be sorted, so
insertItemOnSortedStack(my item I popped, inputStack)
4
Once you have it working for type stacks, also templatize your sortStack() function, so that it will actually work to sort a Stack of any type.
Example Output
Here is the correct output you should get from your program if you correctly implement all the class functions and successfully pass all of the unit tests given for this assignment. If you invoke your function with no command line arguments, only failing tests are usually shown by default. In the second example, we use the -s command line option to have the unit test framework show both successful and failing tests, and thus we get reports of all of the successfully passing tests as well on the output.
$ ./test =============================================================================== All tests passed (47 assertions in 4 test cases)
$ ./test -s
——————————————————————————-
test is a Catch v2.7.2 host application. Run with -? for options
——————————————————————————-
assg09-tests.cpp:33: PASSED: CHECK( doParenthesisMatch(“”) )
with expansion:
true
… output snipped …
=============================================================================== All tests passed (47 assertions in 4 test cases)
Assignment Submission
A MyLeoOnline submission folder has been created for this assignment. There is a target named submit that will create a tared and gziped file named assg02.tar.gz. You should do a make submit when finished and upload your resulting gzip file to the MyLeoOnline Submission folder for this assignment.
$ make submit
tar cvfz assg09.tar.gz assg09-tests.cpp assg09-main.cpp
assg09-stackfun.hpp assg09-stackfun.cpp Stack.hpp Stack.cpp assg09-tests.cpp
assg09-main.cpp
assg09-stackfun.hpp
assg09-stackfun.cpp Stack.hpp
Stack.cpp
5
Requirements and Grading Rubrics
Program Execution, Output and Functional Requirements
- Your program must compile, run and produce some sort of output to be graded. 0 if not satisfied.
- (25 pts.) doParenthesisMatch() is implemented correctly and is passing all of the tests. Used a stack of from
our class Stack.hpp to implement the algorithm.
- (25 pts.) decodeIDSequence() implemented and correct. Used a stack from our class Stack.hpp stack
implementation to implement the asked for algorithm.
- (25 pts.) insertItemOnSortedStack() implemented and working. The function is correctly templatized. The
function takes a reference to the Stack abstract class as it second parameter.
- (25 pts.) sortStack() implemented as described and working. The function was implemented using recursion
as required. The function was templatized as asked for. The function takes a reference to a Stack base class as its only parameter.
Program Style
Your programs must conform to the style and formatting guidelines given for this class. The following is a list of the guidelines that are required for the assignment to be submitted this week.
- Most importantly, make sure you figure out how to set your indentation settings correctly. All programs must use 2 spaces for all indentation levels, and all indentation levels must be correctly indented. Also all tabs must be removed from files, and only 2 spaces used for indentation.
- A function header must be present for member functions you define. You must give a short description of the function, and document all of the input parameters to the function, as well as the return value and data type of the function if it returns a value for the member functions, just like for regular functions. However, setter and getter methods do not require function headers.
- You should have a document header for your class. The class header document should give a description of the class. Also you should document all private member variables that the class manages in the class document header.
- Do not include any statements (such as system(“pause”) or inputting a key from the user to continue) that are meant to keep the terminal from going away. Do not include any code that is specific to a single operating system, such as the system(“pause”) which is Microsoft Windows specific.
Digital Forensics
1) Explain how cookies can show that a user has visited a site if that user’s history has been deleted.
2) Provide your abstract for project on “Deleted Data Recovery”.
Exp19_Excel_Ch02_ML2_SmartPhone
Exp19_Excel_Ch02_ML2_SmartPhone
Project Description:
You have just graduated from college and before beginning your first professional job, you would like to purchase a new smartphone. You have the option to purchase the new phone in one payment or make monthly payments by taking advantage of a 36 month flex payment plan. The payment plan charges an APR of 1.75% for the service. Prior to making your payment decision, you would like to make a worksheet to calculate the monthly payment for consumer reports top three smartphones for young professionals.
dq
What are the various technologies employed by wireless devices to maximize their use of the available radio frequencies? Also discuss methods used to secure 802.11 wireless networking in your initial thread.