Wana Decryptor Attack Case Study - Part 1

Scenario:

You are employed at a bank of medium size, worth 5 billion dollars. The IT Director reports to the CIO – both the CIO and CISO report to the COO. At 11:00 A.M. on a Monday morning, the IT Help Desk receives a call from a user in the Wire Transfer Department. He reports that his computer is frozen, and appears to have a message that some type of ransom is requested to free the files up from a type of encryption.

What should your help desk do next? Consider the following:

• What is your response plan to this incident?
• How would you escalate this situation?
• Who would you notify?
• What is your customer notification plan?
• What is the relevant regulatory requirement?

Let’s identify the most probable sequence of events. Select One:

1. The Help Desk opens a ticket, assigns it to a technician to respond to the user’s workstation, to inspect and determine what the actual problem is and whether it is a virus or a computer issue that could be resolved by the IT team.
2. The Help Desk instructs the user to unplug his computer from the network, proceeds to open a ticket and assigns an IT tech to inspect the user’s computer for an analysis and a possible solution.
3. The Help Desk simultaneously proceeds to notify the IT Director of the issue, dispatches a technician and awaits feedback.
4. In addition to #3, the Help Desk proceeds to inform the CISO of the occurrence.
5. The Help Desk instructs the user to shut down and restart his computer to see if the problem has been remedied before taking any action.
6. Any other actions that are not listed above?

As you reflect on what to do and what may happen, the IT Technician arrives:

• The technician immediately determined and reported that the computer was infected with Ransomware.
• He states that there is no way to remove the malware other than disconnecting it from the network and re-imagine it.
• The other option is to pay the ransom of $300.00.

What now? Post your primary thoughts on the scenario, considerations on the most probable next steps, and what you would do after learning the new information from the IT technician's report then find commonalities and differences in your thoughts and approaches and discuss as a class.

java program

public class FavoriteList {

protected PositionList> fList; // List of entries

/** Constructor; O(1) time */

public FavoriteList() { fList = new NodePositionList>(); }

// Complete your work and write out a main function to test

top, access and remove methods.

}

Radio Link Loss

Radio link loss is a key factor in the design of any radio communications system or wireless communication system.

The radio link loss is a signal loss that essentially reduces the power density of an electromagnetic wave or signal. Since the signal propagates through the environment in which it is traveling., All radio communication, broadcast, and wireless communication systems are affected by this.

Different reasons for the radio link loss

1. Free space loss:  Free space loss occurs when the signal travels through space without any other effects attenuating the signal. It will still diminish as it spreads out. As the signal has to cover a wider area, conservation of energy tells us that the energy in any given area will reduce as the area covered becomes larger.

2. Diffraction:  Radio link loss occurs when an object/obstacle appears in the path. The signal can diffract around the object, but losses occur. The loss is higher, the more rounded the object.

1. Multipath:  In a real terrestrial environment, signals will be reflected, and they will reach the receiver via several different links/paths. These signals may add or subtract from each other depending upon the relative phases of the signals. If the receiver is moved, the scenario will change, and the overall received signal will be found to vary with position.

4. Absorption losses:  Absorption losses occur if the radio links pass into a medium that is not transparent to radio signals.

For, e.g., Buildings, walls, etc., Atmospheric moisture, i.e., moisture in the air, Vegetation, i.e., in dense forest trees and foliage, can attenuate radio signals, particularly when wet.

1. Terrain (land):  The terrain over which signals travel will significantly affect the signal. Hills which obstruct the path will considerably attenuate the signal, often making reception impossible
2. Atmosphere:  The atmosphere can affect radio links paths.

How can we reduce loss?

1. Radio link loss cab is reduced by Predicting radio link loss.

2. Understanding the various elements affecting radio link loss is to be able to predict the loss for a given link.

  Most radio link loss predictions are made using the following techniques.

· Statistical methods:  Statistical methods of predicting signal path loss rely on measured and averaged losses for typical types of radio links. The figures are entered into the prediction model, which can calculate the figures based on the data. This type of approach is normally used for planning cellular networks, broadcast networks.

· Deterministic approach:  This approach to radio link loss and coverage prediction to be used for short-range links where the amount of required data falls within acceptable limits.

Radio Link Loss

Radio link loss is a key factor in the design of any radio communications system or wireless communication system.

The radio link loss is a signal loss that essentially reduces the power density of an electromagnetic wave or signal. Since the signal propagates through the environment in which it is traveling., All radio communication, broadcast, and wireless communication systems are affected by this.

Different reasons for the radio link loss

1. Free space loss:  Free space loss occurs when the signal travels through space without any other effects attenuating the signal. It will still diminish as it spreads out. As the signal has to cover a wider area, conservation of energy tells us that the energy in any given area will reduce as the area covered becomes larger.

2. Diffraction:  Radio link loss occurs when an object/obstacle appears in the path. The signal can diffract around the object, but losses occur. The loss is higher, the more rounded the object.

1. Multipath:  In a real terrestrial environment, signals will be reflected, and they will reach the receiver via several different links/paths. These signals may add or subtract from each other depending upon the relative phases of the signals. If the receiver is moved, the scenario will change, and the overall received signal will be found to vary with position.

4. Absorption losses:  Absorption losses occur if the radio links pass into a medium that is not transparent to radio signals.

For, e.g., Buildings, walls, etc., Atmospheric moisture, i.e., moisture in the air, Vegetation, i.e., in dense forest trees and foliage, can attenuate radio signals, particularly when wet.

1. Terrain (land):  The terrain over which signals travel will significantly affect the signal. Hills which obstruct the path will considerably attenuate the signal, often making reception impossible
2. Atmosphere:  The atmosphere can affect radio links paths.

How can we reduce loss?

1. Radio link loss cab is reduced by Predicting radio link loss.

2. Understanding the various elements affecting radio link loss is to be able to predict the loss for a given link.

  Most radio link loss predictions are made using the following techniques.

· Statistical methods:  Statistical methods of predicting signal path loss rely on measured and averaged losses for typical types of radio links. The figures are entered into the prediction model, which can calculate the figures based on the data. This type of approach is normally used for planning cellular networks, broadcast networks.

· Deterministic approach:  This approach to radio link loss and coverage prediction to be used for short-range links where the amount of required data falls within acceptable limits.

Please rewrite it in your own words (I mean paraphrase)

Critical Thinking 6-4: Network Firewall Comparison

Use the Internet to identify three network firewalls, and create a chart that compares their features. Note if they are rule-based or application-aware, perform stateless or stateful packet filtering, what additional features they include (IDS, content filtering, etc.), their costs, etc. Which would you recommend? Why?

Give a greedy algorithm to make a reasonable attempt at coloring a graph in ?(? + ?) time. In pseudo code

Suppose a linked list of 20 nodes. The middle node has a data –250. Write the pseudocode to replace the middle node of the linked list with a new node and new data. Assume that the list's head pointer is called head_ptr and the data for the new node is called entry

In C programming, Thanks

Write a program to determine which numbers in an array are inside a particular range. The limits of the range are inclusive.

You have to write a complete "C" Program that compiles and runs in Codeblocks. (main.c)

1. Declare an array that can contain 5 integer numbers. Use as the name of the array your LastName.

2. Use a for loop to ask the user for numbers and fill up the array using those numbers.

3. Ask the user for the lower limit of the range.

4. Ask the user for the upper limit of the range.

5. Use a for loop to check all the numbers in the array and print the numbers inside the range.

The following is an example of how your program should look when you execute it:

Enter a number to store in the array: 10
Enter a number to store in the array: 90
Enter a number to store in the array: 145
Enter a number to store in the array: 94
Enter a number to store in the array: 97

Enter the lower limit of the range: 90
Enter the upper limit of the range: 99

The numbers in the range are: 90, 94, 97

how to count the word of occurance in the text file

example input text file : "test1.txt
hello : 1
good : 1
morning: 1
how : 1
are : 2
you : 2
good : 1

example output text file : "test2.txt"
1 : 4
2 : 2
3 : 0
4 : 0
5 : 0

C++ . It should all be in one code and using WHILE loops

2. Write a piece of code that asks the user for a number and adds up the even numbers from 1 to that entered number.

3. Write a piece of code that asks the user for 2 numbers and adds up the numbers between and including the numbers.

4. Write another piece of code that asks the user for a random file name and adds all of the numbers in the file and reads until the end of the file.

Part 2

Write a C++ program that prompts the user for an Account Number(a whole number). It will then prompt the user for the initial account balance (a double). The user will then enter either w, d, or z to indicate the desire to withdraw an amount from the bank, deposit an amount or end the transactions for that account((accept either uppercase or lowercase). You must use a switch construct to determine the account transaction and a do…while loop to continue processing.  

Test Run:

Enter the account number: 1

Enter the initial balance: 5000

SAVINGS ACCOUNT TRANSACTION

(W)ithdrawal

(D)eposit

(Z) to end account transaction

Enter first letter of transaction type (W, D or Z): w

Amount: $1000

Balance for this account is now: $4000.00

SAVINGS ACCOUNT TRANSACTION

(W)ithdrawal

(D)eposit

(Z) to end account transaction

Enter first letter of transaction type (W, D or Z): d

Amount: $500

Balance for this account is now: $4500.00

SAVINGS ACCOUNT TRANSACTION

(W)ithdrawal

(D)eposit

(Z) to end account transaction

Enter first letter of transaction type (W, D or Z): z

No more changes.

Balance for this account is now: $4500.00

Press any key to continue . . .

I want a unique c++ code for the following. PLEASE HIGHLIGHT THESE FUNCTIONS WITH COMMENTS .

Add the following functions to the class arrayListType: Then, update the main function to test these new functions.

• removeAll - which removes ALL of the instances of a value in the list
• min - which returns the minimum value in the list
• max - which returns the maximum value in the list

arrayListType.h :

#ifndef H_arrayListType
#define H_arrayListType

class arrayListType {
public:
bool isEmpty() const;

bool isFull() const;

int listSize() const;

int maxListSize() const;

void print() const;

bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as the item in the list at the position specified by location.
//Postcondition: Returns true if list[location] is the same as item; otherwise,
// returns false. If location is out of range, an appropriate message is displayed.

void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is  removed and length is decremented by 1.
// If location is out of range appropriate message is displayed.

void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list   
//at the position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.

void clearList();
//Function to remove all the elements from the list After this operation, the size of the list is zero.Postcondition: length = 0;

arrayListType(int size = 100);
//Constructor. The default array size is 100.
//Postcondition: The list points to the array, length = 0, and maxSize = size;

arrayListType (const arrayListType& otherList);
//Copy constructor

~arrayListType();
//Destructor
//Deallocate the memory occupied by the array.
  
void insertAt(int location, int insertItem);
void insertEnd(int insertItem);
void replaceAt(int location, int repItem);
int seqSearch(int searchItem) const;
void remove(int removeItem);

private:
int *list; //array to hold the list elements
int length; //variable to store the length of the list
int maxSize; //variable to store the maximum
//size of the list
};

#endif

arrayListTypeIm.cpp :

#include
#include "arrayListType.h"

using namespace std;

bool arrayListType::isEmpty() const
{
return (length == 0);
} //end isEmpty

bool arrayListType::isFull() const
{
return (length == maxSize);
} //end isFull

int arrayListType::listSize() const
{
   return length;
} //end listSize

int arrayListType::maxListSize() const
{
   return maxSize;
} //end maxListSize

void arrayListType::print() const
{
for (int i = 0; i < length; i++)
cout << list[i] << " ";
cout << endl;
} //end print

bool arrayListType::isItemAtEqual(int location, int item) const
{
if (location < 0 || location >= length)
{
cout << "The location of the item to be removed "
<< "is out of range." << endl;

return false;
}
else
return (list[location] == item);
} //end isItemAtEqual

void arrayListType::removeAt(int location)
{
if (location < 0 || location >= length)
cout << "The location of the item to be removed "
<< "is out of range." << endl;
else
{
for (int i = location; i < length - 1; i++)
list[i] = list[i+1];

length--;
}
} //end removeAt

void arrayListType::retrieveAt(int location, int& retItem) const
{
if (location < 0 || location >= length)
cout << "The location of the item to be retrieved is "
<< "out of range" << endl;
else
retItem = list[location];
} //end retrieveAt

void arrayListType::clearList()
{
length = 0;
} //end clearList

arrayListType::arrayListType(int size)
{
if (size <= 0)
{
cout << "The array size must be positive. Creating "
<< "an array of the size 100." << endl;

maxSize = 100;
}
else
maxSize = size;

length = 0;

list = new int[maxSize];
} //end constructor

arrayListType::~arrayListType()
{
delete [] list;
} //end destructor

arrayListType::arrayListType(const arrayListType& otherList)
{
maxSize = otherList.maxSize;
length = otherList.length;

list = new int[maxSize];    //create the array

for (int j = 0; j < length; j++) //copy otherList
list [j] = otherList.list[j];
}//end copy constructor

//===========
void arrayListType::insertAt(int location, int insertItem)
{
if (location < 0 || location >= maxSize)
cout << "The position of the item to be inserted "
<< "is out of range." << endl;
else if (length >= maxSize) //list is full
cout << "Cannot insert in a full list" << endl;
else
{
for (int i = length; i > location; i--)
list[i] = list[i - 1];   //move the elements down

list[location] = insertItem; //insert the item at
//the specified position

length++;   //increment the length
}
} //end insertAt

void arrayListType::insertEnd(int insertItem)
{
if (length >= maxSize) //the list is full
cout << "Cannot insert in a full list." << endl;
else
{
list[length] = insertItem; //insert the item at the end
length++; //increment the length
}
} //end insertEnd

int arrayListType::seqSearch(int searchItem) const
{
int loc;
bool found = false;

loc = 0;

while (loc < length && !found)
if (list[loc] == searchItem)
found = true;
else
loc++;

if (found)
return loc;
else
return -1;
} //end seqSearch

void arrayListType::remove(int removeItem)
{
int loc;

if (length == 0)
cout << "Cannot delete from an empty list." << endl;
else
{
loc = seqSearch(removeItem);

if (loc != -1)
removeAt(loc);
else
cout << "The item to be deleted is not in the list."
<< endl;
}
} //end remove

void arrayListType::replaceAt(int location, int repItem)
{
if (location < 0 || location >= length)
cout << "The location of the item to be "
<< "replaced is out of range." << endl;
else
list[location] = repItem;
} //end replaceAt

main.cpp :

#include
#include "arrayListType.h"

using namespace std;   
  
int main()
{
arrayListType intList(25);   

int number;
cout << "List 8: Enter 8 integers: ";

for (int count = 0; count < 8; count++)
{
cin >> number;
intList.insertEnd(number);   
}

cout << endl;
cout << "Line 16: intList: ";
intList.print();   
cout << endl;

cout << "Line 18: Enter the number to be "
<< "deleted: ";   
cin >> number;   
cout << endl;

intList.remove(number);

cout << "Line 22: After removing " << number
<< " intList: ";
intList.print();   
cout << endl;

cout << "Line 25: Enter the search item: ";

cin >> number;
cout << endl;

if (intList.seqSearch(number) != -1)   
cout << "Line 29: " << number
<< " found in intList." << endl;
else   
cout << "Line 31: " << number
<< " is not in intList." << endl;   

return 0;
}

Upon completion of this exercise, you will have demonstrated the ability to:

• Use C# loops
• Construct conditions

INTRODUCTION

Your instructor will assign one of the following projects, each involves the user of loops and the construction of conditions to control them.

CODING STANDARDS

The following coding standards must be followed when developing your program:

• An opening documentation at the beginning of the source file describing the purpose, input, process, output, author, last modified date of the program.
• Write only one statement per line.
• Write only one declaration per line.
• Use camelCase for local variable names.
• Use UPPER_CASE for constant variable names.
• If continuation lines are not indented automatically, indent them one tab stop (four spaces).
• Do NOT use goto or break statements in your looping structure.

PROJECTS

1. Write a program that will read a sequence of numbers from the keyboard (you are free to choose the input flow method of your choice), and display the minimum, maximum, average, and range (highest minus lowest) of the entered values. Validate the input.

We are using javaCC notation.This is the full question

Given the following grammar:

• String ::= "A" ( "B" | T | V )+
• T ::= ("X" T ) | "Y"
• V ::= ( "C" | "D" )*

Which of the following strings are correct according to this grammar?

Group of answer choices

A C C D X X Y

X X Y

A B C D

A X

A B C D

A C D C

A B C D X Y

A X X X

A X Y X C D

A B X X Y

B C D

A

B X X Y

The following grammar for a program has a problem with semicolons:

• Program ::= Block "."
• Block ::= "{" Statement (";" Statement )* "}"
• Statement ::= Assignment | IfStatement | Block
• Assignment ::= "="
• IfStatement ::= "if" "(" Assignment ")" Statement

Use JavaCC to update

When an if statement has a block after it, the block sometimes must end with a semicolon sometimes but not all the time.

1. Write an example showing a required semicolon after a "}"
2. Write an example where a semicolon is not required after a "}"
3. How can the grammar be modified so that several semicolons can occur in a row with not statements.
4. Can the grammar be modified so that a semicolon is not required after a "}" that ends a Block? Rewrite the grammar to make a semicolon not be required after a "}".

Write a pro-active password checker that checks to make sure that a user entered password meets certain requirements. You must implement a simple program that prompts the user for two String values, a password and the same password again for confirmation. For the purposes of this lab, a legal password must have all of the following properties:

▪ Length of at least 8 characters

▪ Starts with a lower case letter

▪ Ends with a numerical digit

▪ Has one Uppercase

▪ Is exactly equal to the repetition of the password typed for confirmation

Complete your program to prompt the user to enter a password and a confirmation as explained above. If the password is shorter than 8 characters, print Password is too short! Otherwise, if the password does not start with a lower case letter, print Password must start with a lower case letter! Otherwise, if the password does not end with a digit, print Password must end with a digit! Otherwise, if the password does not match the confirmation, print Passwords do not match! If there is no Uppercase letter in the password print Password must contain uppercase letter! Finally, if all the conditions are satisfied, print Password is valid!

Must be in Java